Skip to content

Create missing_num_in_sorted_arr #1298

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
Harsha-Ramesh-Naik wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Create missing_num_in_sorted_arr #1298

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions missing_num_in_sorted_arr
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
class solution(object):
def missing_number_bs(self, arr):

low, high = 0, len(arr) - 1
while low <= high:
mid = (low + high) // 2
expected = mid + 1
if arr[mid] == expected:
low = mid + 1 # missing is to the right
else:
high = mid - 1 # missing is to the left (or here)

return low + 1 # the missing number