Lesson 3 of 8 • 7 upvotes • 7:03mins
In this lesson, we will learn how to solve the Finding Triplet Problem. This is a problem based on Arrays. We will find an efficient solution contrary to the naive approach. 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