Section 1 : 0- Introduction

Lecture 1 Introduction 00:02:07 Duration

Section 2 : 1- Find pair that sums up to k

Lecture 1 Solution + code 00:10:21 Duration
Lecture 2 Complexity analysis

Section 3 : 2- First repeating character

Lecture 1 Solution + code 00:05:45 Duration
Lecture 2 Complexity analysis

Section 4 : 3- Remove duplicates

Lecture 1 Solution + code 00:06:32 Duration
Lecture 2 Complexity analysis

Section 5 : 4- Find the duplicate

Lecture 1 Solution + code 00:15:17 Duration
Lecture 2 Complexity analysis

Section 6 : 5- Tree depth first search

Lecture 1 Solution + code 00:07:37 Duration
Lecture 2 Complexity analysis

Section 7 : 6- Maximum subarray

Lecture 1 Solution + code 00:11:08 Duration
Lecture 2 Complexity analysis

Section 8 : 7- Reverse binary tree

Lecture 1 Solution + code 00:05:17 Duration
Lecture 2 Complexity analysis

Section 9 : 8- Longest substring without repeating characters

Lecture 1 Solution + code
Lecture 2 Complexity analysis

Section 10 : 9- Reverse linked list

Lecture 1 Solution + code 00:12:15 Duration
Lecture 2 Complexity analysis

Section 11 : 10- Peak finding

Lecture 1 Solution + code 00:05:33 Duration
Lecture 2 Complexity analysis

Section 12 : 11- Palindrome linked list

Lecture 1 Solution + code 00:05:26 Duration
Lecture 2 Complexity analysis

Section 13 : 12- Longest possible palindrome

Lecture 1 Solution + code 00:08:01 Duration
Lecture 2 Complexity analysis

Section 14 : 13- Get substring index

Lecture 1 Solution + code 00:14:04 Duration
Lecture 2 Complexity analysis

Section 15 : 14- Tree breadth first search

Lecture 1 Solution + code 00:06:47 Duration
Lecture 2 Complexity analysis

Section 16 : 15- Sort linked list

Lecture 1 Solution + code 00:13:46 Duration
Lecture 2 Complexity analysis

Section 17 : 16- Valid binary search tree

Lecture 1 Solution + code 00:06:36 Duration
Lecture 2 Complexity analysis

Section 18 : 17- Minimum cost path in matrix

Lecture 1 Solution + code 00:14:36 Duration
Lecture 2 Complexity analysis

Section 19 : 18- Balanced binary tree

Lecture 1 Solution + code
Lecture 2 Complexity analysis

Section 20 : 19- Paths in matrix

Lecture 1 Solution + code 00:09:02 Duration
Lecture 2 Complexity analysis

Section 21 : 20- Tree breadth first search II

Lecture 1 Solution + code 00:05:52 Duration
Lecture 2 Complexity analysis

Section 22 : 21- Product of array except self

Lecture 1 Solution + code 00:06:33 Duration
Lecture 2 Complexity analysis

Section 23 : 22- Jump to last index

Lecture 1 Solution + code 00:14:14 Duration
Lecture 2 Complexity analysis

Section 24 : 23- Graph depth first search

Lecture 1 Solution + code 00:06:16 Duration
Lecture 2 Complexity analysis

Section 25 : 24- Graph breadth first search

Lecture 1 Solution + code 00:07:10 Duration
Lecture 2 Complexity analysis

Section 26 : 25- String subsequences

Lecture 1 Solution + code 00:05:25 Duration
Lecture 2 Complexity analysis

Section 27 : 26- Valid brackets

Lecture 1 Solution + code 00:06:32 Duration
Lecture 2 Complexity analysis

Section 28 : 27- Flatten binary tree

Lecture 1 Solution + code 00:06:59 Duration
Lecture 2 Complexity analysis

Section 29 : 28- Lowest common ancestor

Lecture 1 Solution + code
Lecture 2 Complexity analysis

Section 30 : 29- Minimum in rotated sorted array

Lecture 1 Solution + code 00:08:50 Duration
Lecture 2 Complexity analysis

Section 31 : 30- Add two linked lists

Lecture 1 Solution + code 00:07:29 Duration
Lecture 2 Complexity analysis

Section 32 : 31- Ways to climb stairs

Lecture 1 Solution + code 00:10:44 Duration
Lecture 2 Complexity analysis

Section 33 : 32- Subsets that sum up to k

Lecture 1 Solution + code 00:13:17 Duration
Lecture 2 Complexity analysis

Section 34 : 33- Ways to decode

Lecture 1 Solution + code 00:14:56 Duration
Lecture 2 Complexity analysis

Section 35 : 34- Remove node from binary search tree

Lecture 1 Solution + code 00:07:43 Duration
Lecture 2 Complexity analysis

Section 36 : 35- Array permutations

Lecture 1 Solution + code 00:15:00 Duration
Lecture 2 Complexity analysis

Section 37 : 36- Longest common subsequence

Lecture 1 Solution + code 00:15:22 Duration
Lecture 2 Complexity analysis

Section 38 : 37- Longest consecutive sequence

Lecture 1 Solution + code 00:08:31 Duration
Lecture 2 Complexity analysis

Section 39 : 38- Edit distance

Lecture 1 Solution + code 00:07:44 Duration
Lecture 2 Complexity analysis

Section 40 : 39- Count sorted vowel strings

Lecture 1 Solution + code 00:18:02 Duration
Lecture 2 Complexity analysis

Section 41 : 40- Smallest number after removing k digits

Lecture 1 Solution + code 00:07:35 Duration
Lecture 2 Complexity analysis

Section 42 : 41- Merge intervals

Lecture 1 Solution + code 00:05:19 Duration
Lecture 2 Complexity analysis

Section 43 : 42- Insert interval

Lecture 1 Solution + code 00:04:29 Duration
Lecture 2 Complexity analysis

Section 44 : 43- Maximum path sum

Lecture 1 Solution + code 00:07:05 Duration
Lecture 2 Complexity analysis

Section 45 : 44- 0-1 Knapsack

Lecture 1 Solution + code
Lecture 2 Complexity analysis

Section 46 : 45- Shortest palindrome

Lecture 1 Solution + code 00:06:33 Duration
Lecture 2 Complexity analysis

Section 47 : 46- Coin change

Lecture 1 Solution + code 00:05:57 Duration
Lecture 2 Complexity analysis

Section 48 : 47- Word search

Lecture 1 Solution + code 00:08:20 Duration
Lecture 2 Complexity analysis

Section 49 : 48- N-queens

Lecture 1 Solution + code
Lecture 2 Conclusion

Section 50 : 49- Word ladder

Lecture 1 Solution + code 00:19:49 Duration
Lecture 2 Complexity analysis

Section 51 : 50- Longest increasing subsequence

Lecture 1 Solution + code 00:18:06 Duration
Lecture 2 Complexity analysis