Solution #35 - Abdul Wahab - 14/07/2025 #62
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
AbdulWahab938
changed the title
JRS296
requested changes
Jul 19, 2025
AbdulWahab938
changed the title
AbdulWahab938
force-pushed
the
feature/search-insert-position
branch
from
e171717 to
c892599
Compare
AbdulWahab938
changed the title
AbdulWahab938
force-pushed
the
feature/search-insert-position
branch
from
c892599 to
04c43fa
Compare
Done Jonathan, i have made the changes could you please re-review it again. |
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: Search Insert Position.
The goal is to determine the index at which a given target value should be inserted in a sorted integer array.
If the target already exists in the array, its index is returned. Otherwise, the method returns the correct insertion point to maintain the array's sorted order.
An efficient O(logN) solution is implemented using binary search, which finds either the target or its lower bound position.