Add Python solutions for Search Insert Position and Search Range#13422
Add Python solutions for Search Insert Position and Search Range#13422avimishraa wants to merge 2 commits intoTheAlgorithms:masterfrom
Conversation
avimishraa
force-pushed
the
add/binary_search_python
branch
from
90f66df to
017acc8
Compare
algorithms-keeper
bot
added
the
require tests
![algorithms-keeper[bot]](https://avatars.githubusercontent.com/in/235834?s=60&v=4){kind=small}
There was a problem hiding this comment.
Click here to look at the relevant links ⬇️
🔗 Relevant Links
Repository:
Python:
Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.
algorithms-keeper commands and options
algorithms-keeper actions can be triggered by commenting on this PR:
@algorithms-keeper reviewto trigger the checks for only added pull request files@algorithms-keeper review-allto trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.
| @@ -0,0 +1,27 @@ | |||
| from typing import List | |||
|
|
|||
| def search_insert(nums: List[int], target: int) -> int: | |||
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/Binary search algo/search_insert_position.py, please provide doctest for the function search_insert
| @@ -0,0 +1,39 @@ | |||
| from typing import List | |||
|
|
|||
| def search_range(nums: List[int], target: int) -> List[int]: | |||
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/Binary search algo/search_range.py, please provide doctest for the function search_range
| Returns [-1, -1] if the target is not found. | ||
| """ | ||
|
|
||
| def find_bound(is_first: bool) -> int: |
There was a problem hiding this comment.
As there is no test file in this pull request nor any test function or class in the file data_structures/Binary search algo/search_range.py, please provide doctest for the function find_bound
for more information, see https://pre-commit.ci
|
Closing require_tests PRs to prepare for Hacktoberfest |
2 participants
Description
This PR adds Python solutions for two binary search problems from LeetCode:
Search Insert Position (LeetCode 35)
Find First and Last Position of Element in Sorted Array (LeetCode 34)
Test
Both solutions are tested with example inputs and are ready to run in Python.