50 popular coding interview problems
50 popular coding interview problems solved and explained to rock your coding interview
Watch Promo
The 50 popular interview coding problems course, the course you should take if you're preparing for coding interviews or if you want to increase your problem-solving skills
Why? Because the course covers different topics on algorithms (dynamic programming, backtracking, divide and conquer...) and on data structures (arrays, linked lists, stacks, trees, graphs...), all that while learning how to solve problems and how to optimize time and space complexity
But wait..there's more, lectures of this course are very rich and complete, you can have a look at free preview lectures below
And also, you will be able to ask questions when you don't understand something! isn't that amazing?
Still hesitating? Know that you have a 30 days money-back guarantee, so you have nothing to lose!
Want to know what problems are covered? Check the curriculum below
Course Curriculum
-
Start0- Introduction (2:39)
-
Preview1- Find pair that sums up to k (10:21)
-
Start2- First repeating character (5:44)
-
Start3- Remove duplicates (6:32)
-
Preview4- Find the duplicate (15:16)
-
Start5- Tree depth first search (7:37)
-
Start6- Maximum subarray (11:08)
-
Start7- Reverse binary tree (5:17)
-
Start8- Longest substring without repeating characters (9:08)
-
Start9- Reverse linked list (12:15)
-
Start10- Peak finding (5:32)
-
Start11- Palindrome linked list (5:25)
-
Start12- Longest possible palindrome (8:00)
-
Start13- Get substring index (14:04)
-
Start14- Tree breadth first search (6:47)
-
Start15- Sort linked list (13:46)
-
Start16- Valid binary search tree (6:36)
-
Preview17- Minimum cost path in matrix (14:35)
-
Start18- Balanced binary tree (8:02)
-
Preview19- Paths in matrix (9:01)
-
Start20- Tree breadth first search II (5:51)
-
Start21- Product of array except self (6:32)
-
Preview22- Jump to last index (14:14)
-
Start23- Graph depth first search (6:16)
-
Start24- Graph breadth first search (7:10)
-
Preview25- String subsequences (5:25)
-
Start26- Valid brackets (6:31)
-
Start27- Flatten binary tree (6:59)
-
Preview28- Lowest common ancestor (17:16)
-
Start29- Minimum in rotated sorted array (8:50)
-
Start30- Add two linked lists (7:28)
-
Start31- Ways to climb stairs (10:44)
-
Start32- Subsets that sum up to k (13:17)
-
Start33- Ways to decode (14:56)
-
Start34- Remove node from binary search tree (7:43)
-
Start35- Array permutations (14:59)
-
Start36- Longest common subsequence (15:21)
-
Start37- Longest consecutive sequence (8:31)
-
Start38- Edit distance (7:43)
-
Start39- Longest common substring (20:53)
-
Start40- Smallest number after removing k digits (7:34)
-
Start41- Insert interval (4:29)
-
Start42- Merge intervals (5:18)
-
Start43- Maximum path sum (7:04)
-
Start44- 0-1 Knapsack (7:08)
-
Start45- Shortest palindrome (6:33)
-
Start46- Coin change (5:57)
-
Start47- Word search (8:19)
-
Start48- N-queens (16:23)
-
Start49- Word ladder (19:49)
-
Start50- Longest increasing subsequence (18:06)