Lesson 7 of 8 • 6 upvotes • 8:49mins
In this lesson, we shall learn about Rotated Sorted Array. We shall dive in and understand how to find the pivot of rotated sorted array in logarithmic time complexity. This lesson is based on Binary Search. Watch the video to understand how this works.
8 lessons • 1h 7m
Kadane's Algorithm: Largest Sum Contiguous Subarray
9:45mins
Finding Duplicate Numbers in Constant Space Complexity
8:44mins
Triplet of Numbers Summimg to a Value
7:03mins
Arrange Numbers to Form Largest Number
7:27mins
Maximum j-i Such That arr [j] > arr [I]
8:57mins
Modifying Binary Search
8:02mins
Searching in Rotated Arrays - I
8:49mins
Searching in Rotated Arrays - II
8:36mins