Section 1 : 0- Introduction

Lecture 1 Introduction 2:7

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

Lecture 2 Solution + code 10:21
Lecture 3 Complexity analysis Text

Section 3 : 2- First repeating character

Lecture 4 Solution + code 5:45
Lecture 5 Complexity analysis Text

Section 4 : 3- Remove duplicates

Lecture 6 Solution + code 6:32
Lecture 7 Complexity analysis Text

Section 5 : 4- Find the duplicate

Lecture 8 Solution + code 15:17
Lecture 9 Complexity analysis Text

Section 6 : 5- Tree depth first search

Lecture 10 Solution + code 7:37
Lecture 11 Complexity analysis Text

Section 7 : 6- Maximum subarray

Lecture 12 Solution + code 11:8
Lecture 13 Complexity analysis Text

Section 8 : 7- Reverse binary tree

Lecture 14 Solution + code 5:17
Lecture 15 Complexity analysis Text

Section 9 : 8- Longest substring without repeating characters

Lecture 16 Solution + code
Lecture 17 Complexity analysis Text

Section 10 : 9- Reverse linked list

Lecture 18 Solution + code 12:15
Lecture 19 Complexity analysis Text

Section 11 : 10- Peak finding

Lecture 20 Solution + code 5:33
Lecture 21 Complexity analysis Text

Section 12 : 11- Palindrome linked list

Lecture 22 Solution + code 5:26
Lecture 23 Complexity analysis Text

Section 13 : 12- Longest possible palindrome

Lecture 24 Solution + code 8:1
Lecture 25 Complexity analysis Text

Section 14 : 13- Get substring index

Lecture 26 Solution + code 14:4
Lecture 27 Complexity analysis Text

Section 15 : 14- Tree breadth first search

Lecture 28 Solution + code 6:47
Lecture 29 Complexity analysis Text

Section 16 : 15- Sort linked list

Lecture 30 Solution + code 13:46
Lecture 31 Complexity analysis Text

Section 17 : 16- Valid binary search tree

Lecture 32 Solution + code 6:36
Lecture 33 Complexity analysis Text

Section 18 : 17- Minimum cost path in matrix

Lecture 34 Solution + code 14:36
Lecture 35 Complexity analysis Text

Section 19 : 18- Balanced binary tree

Lecture 36 Solution + code
Lecture 37 Complexity analysis Text

Section 20 : 19- Paths in matrix

Lecture 38 Solution + code 9:2
Lecture 39 Complexity analysis Text

Section 21 : 20- Tree breadth first search II

Lecture 40 Solution + code 5:52
Lecture 41 Complexity analysis Text

Section 22 : 21- Product of array except self

Lecture 42 Solution + code 6:33
Lecture 43 Complexity analysis Text

Section 23 : 22- Jump to last index

Lecture 44 Solution + code 14:14
Lecture 45 Complexity analysis Text

Section 24 : 23- Graph depth first search

Lecture 46 Solution + code 6:16
Lecture 47 Complexity analysis Text

Section 25 : 24- Graph breadth first search

Lecture 48 Solution + code 7:10
Lecture 49 Complexity analysis Text

Section 26 : 25- String subsequences

Lecture 50 Solution + code 5:25
Lecture 51 Complexity analysis Text

Section 27 : 26- Valid brackets

Lecture 52 Solution + code 6:32
Lecture 53 Complexity analysis Text

Section 28 : 27- Flatten binary tree

Lecture 54 Solution + code 6:59
Lecture 55 Complexity analysis Text

Section 29 : 28- Lowest common ancestor

Lecture 56 Solution + code
Lecture 57 Complexity analysis Text

Section 30 : 29- Minimum in rotated sorted array

Lecture 58 Solution + code 8:50
Lecture 59 Complexity analysis Text

Section 31 : 30- Add two linked lists

Lecture 60 Solution + code 7:29
Lecture 61 Complexity analysis Text

Section 32 : 31- Ways to climb stairs

Lecture 62 Solution + code 10:44
Lecture 63 Complexity analysis Text

Section 33 : 32- Subsets that sum up to k

Lecture 64 Solution + code 13:17
Lecture 65 Complexity analysis Text

Section 34 : 33- Ways to decode

Lecture 66 Solution + code 14:56
Lecture 67 Complexity analysis Text

Section 35 : 34- Remove node from binary search tree

Lecture 68 Solution + code 7:43
Lecture 69 Complexity analysis Text

Section 36 : 35- Array permutations

Lecture 70 Solution + code 15:0
Lecture 71 Complexity analysis Text

Section 37 : 36- Longest common subsequence

Lecture 72 Solution + code 15:22
Lecture 73 Complexity analysis Text

Section 38 : 37- Longest consecutive sequence

Lecture 74 Solution + code 8:31
Lecture 75 Complexity analysis Text

Section 39 : 38- Edit distance

Lecture 76 Solution + code 7:44
Lecture 77 Complexity analysis Text

Section 40 : 39- Count sorted vowel strings

Lecture 78 Solution + code 18:2
Lecture 79 Complexity analysis Text

Section 41 : 40- Smallest number after removing k digits

Lecture 80 Solution + code 7:35
Lecture 81 Complexity analysis Text

Section 42 : 41- Merge intervals

Lecture 82 Solution + code 5:19
Lecture 83 Complexity analysis Text

Section 43 : 42- Insert interval

Lecture 84 Solution + code 4:29
Lecture 85 Complexity analysis Text

Section 44 : 43- Maximum path sum

Lecture 86 Solution + code 7:5
Lecture 87 Complexity analysis Text

Section 45 : 44- 0-1 Knapsack

Lecture 88 Solution + code
Lecture 89 Complexity analysis Text

Section 46 : 45- Shortest palindrome

Lecture 90 Solution + code 6:33
Lecture 91 Complexity analysis Text

Section 47 : 46- Coin change

Lecture 92 Solution + code 5:57
Lecture 93 Complexity analysis Text

Section 48 : 47- Word search

Lecture 94 Solution + code 8:20
Lecture 95 Complexity analysis Text

Section 49 : 48- N-queens

Lecture 96 Solution + code
Lecture 97 Conclusion Text

Section 50 : 49- Word ladder

Lecture 98 Solution + code 19:49
Lecture 99 Complexity analysis Text

Section 51 : 50- Longest increasing subsequence

Lecture 100 Solution + code 18:6
Lecture 101 Complexity analysis Text