Solution #14 - Daniel/Edited - 16.03.2025 #36
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
JRS296
reviewed
Mar 17, 2025
Arrays & Strings/#14 - Longest Common Prefix - Easy/Solution - Longest Common Prefix - Easy
Outdated
Show resolved
Hide resolved
JRS296
reviewed
Mar 17, 2025
...s & Strings/#14 - Longest Common Prefix - Easy/Explanation - Longest Common Prefix - Easy.md
Outdated
Show resolved
Hide resolved
JRS296
requested changes
Mar 17, 2025
JRS296
reviewed
Mar 21, 2025
Comment on lines
+9
to
+21
| ### 1. Lexicographic Sorting | ||
|
|
||
| 1. Lexicographically sorting the array | ||
| 2. Comparing the first and last of the sorted array for prefix. | ||
| 3. Create an empty string called prefix. | ||
| 4. Iteratively, go through the characters to add matching characters to the prefix string. | ||
| 5. When there is a mismatch, end the loop and return the prefix string. | ||
|
|
||
| - Since we are lexicographically sorting the array, the first and last string are the most different. Finding the common prefix between the two, would be the longest common prefix for all the strings in the array between them. | ||
|
|
||
| #### Time Complexity | ||
|
|
||
| O(nlogn) because we sort the array, traversing the two strings will be done in O(n) time which is overshadowed by the worser time complexity O(nlogn). |
There was a problem hiding this comment.
Much better! Kindly add the solutions corresponding to the explanation as well into the cpp file
JRS296
requested changes
Mar 21, 2025
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Solution and Explanation uploaded