Repository navigation
Optimized LongestPalindromicSubstring.java (Reduced Time Complexity ) - #5379
narasimhas9490 wants to merge 3 commits into
Conversation
Optimized Longest Polindromic Substring from avg run time of 532ms to 13ms
|
Reduced Time Complexity from avg run time 434ms to 13 ms |
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## master #5379 +/- ##
============================================
+ Coverage 46.90% 46.92% +0.02%
- Complexity 2903 2904 +1
============================================
Files 525 525
Lines 15363 15362 -1
Branches 2908 2905 -3
============================================
+ Hits 7206 7209 +3
+ Misses 7855 7853 -2
+ Partials 302 300 -2 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
BamaCharanChhandogi
left a comment
There was a problem hiding this comment.
The changes in this pull request significantly improve the efficiency and readability of the code. Great work!
One suggestion for further improvement: consider renaming the method f to something more descriptive, like expandAroundCenter
| for (int i = 0; i < n / 2; ++i) { | ||
| if (s.charAt(lo + i) != s.charAt(hi - i)) { | ||
| return false; | ||
| public void f(String s, int l, int r) { |
There was a problem hiding this comment.
| public void f(String s, int l, int r) { | |
| private void expandAroundCenter(String s, int l, int r) { |
|
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution! |
|
Please reopen this pull request once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution! |
Optimized Longest Polindromic Substring from avg run time of 532ms to 13ms
clang-format -i --style=file path/to/your/file.java