Solution #14 - Nishitha Daryn- 05/08/2025 #82
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
requested changes
Aug 5, 2025
There was a problem hiding this comment.
Not at all in the requested format:
- you've forgotten about the explanation.md file
- Also look at the other PR's that are open, see how they've done theirs. You can look at Neha's open PR's as well as the closed (merged) PR's
Kindly Read the instructions properly
nishithadaryn
force-pushed
the
feature/14-longest-common-prefix
branch
from
8317aa4 to
44c85bb
Compare
nishithadaryn
force-pushed
the
feature/14-longest-common-prefix
branch
from
44c85bb to
e9e0e5c
Compare
|
I have added the two files (solution and explanation) and changed the formatting according to the instructions. |
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.
This PR adds a solution for Leetcode Problem 14: Longest Common Prefix.
The goal is to find the longest common prefix string amongst an array of strings. If there is no common prefix, an empty string "" should be returned.