Lesson 2 of 8 • 11 upvotes • 8:44mins
In this lesson, we will solve the Finding Duplicate Elements problem. Our challenge is to do it without any extra space. This is a problem based on Arrays. We shall learn how.
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