Please Login To Continue
Modifying Binary Search
Lesson 6 of 8 • 8 upvotes • 8:02mins
Shashank Shekhar
This lesson is an introductory lesson to the modifications of Binary Search. We will learn how we can modify binary search to find first and last occurence of numbers present multiple times in a container. This lesson is based on Binary Search. Watch the video to understand how this works.
Top Coding Interview Questions and Solutions
8 lessons • 1h 7m
1
Kadane's Algorithm: Largest Sum Contiguous Subarray
9:45mins
2
Finding Duplicate Numbers in Constant Space Complexity
8:44mins
3
Triplet of Numbers Summimg to a Value
7:03mins
4
Arrange Numbers to Form Largest Number
7:27mins
5
Maximum j-i Such That arr [j] > arr [I]
8:57mins
6
Modifying Binary Search
8:02mins
7
Searching in Rotated Arrays - I
8:49mins
8
Searching in Rotated Arrays - II
8:36mins
Crack Campus Placements with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
