Optimized LongestPalindromicSubstring.java (Reduced Time Complexity )
Optimized Longest Polindromic Substring from avg run time of 532ms to 13ms
- [x] I have read CONTRIBUTING.md.
- [x] This pull request is all my own work -- I have not plagiarized it.
- [x] All filenames are in PascalCase.
- [x] All functions and variable names follow Java naming conventions.
- [x] All new algorithms have a URL in their comments that points to Wikipedia or other similar explanations.
- [x] All new code is formatted with
clang-format -i --style=file path/to/your/file.java
Reduced Time Complexity from avg run time 434ms to 13 ms
Codecov Report
Attention: Patch coverage is 0% with 16 lines in your changes missing coverage. Please review.
Project coverage is 46.92%. Comparing base (
b231a72) to head (34e7667).
| Files | Patch % | Lines |
|---|---|---|
| ...lgorithms/strings/LongestPalindromicSubstring.java | 0.00% | 16 Missing :warning: |
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
:umbrella: View full report in Codecov by Sentry.
:loudspeaker: Have feedback on the report? Share it here.
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!