D12
Recursion
31 stations · 16hThinking recursively: the foundation for trees, backtracking and DP. 5 concept lectures and 26 interview problems explained by codestorywithMIK (16h of video), grouped into 6 patterns such as Basics & Recurrence, Subsets & Subsequences, Permutations & Combinations.
Start this line →- Basics & Recurrence11
- Subsets & Subsequences2
- Permutations & Combinations1
- Divide & Conquer3
- Recursion on Strings & Arrays10
- Recursion on Trees & Lists3
- Introduction6:40
- Recursion Tree20:06
- Time Complexity27:48
- Tail Recursion18:45
All 31 stations in order
- 1.Introduction
- 2.Recursion Leap Of Faith
- 3.Recursion Tree
- 4.Time Complexity
- 5.Tail Recursion
- 6.Reverse a Stack
- 7.Tower Of Hanoi
- 8.Merge Sort
- 9.Quick Sort
- 10.Rat in a Maze Problem
- 11.Flatten BST to sorted list
- 12.Flattening a Linked List
- 13.N-Queens (LeetCode 51)
- 14.Generate Parentheses (LeetCode 22)
- 15.Power Set
- 16.Permutations II (LeetCode 47)
- 17.Subsets (LeetCode 78)
- 18.Regular Expression Matching (LeetCode 10)
- 19.K-th Symbol in Grammar (LeetCode 779)
- 20.Construct String from Binary Tree (LeetCode 606)
- 21.Find the Winner of the Circular Game (LeetCode 1823)
- 22.Integer to English Words (LeetCode 273)
- 23.Different Ways to Add Parentheses (LeetCode 241)
- 24.Lexicographical Numbers (LeetCode 386)
- 25.K-th Smallest in Lexicographical Order (LeetCode 440)
- 26.Find the K-th Character in String Game II (LeetCode 3307)
- 27.Find Kth Bit in Nth Binary String (LeetCode 1545)
- 28.Find the Punishment Number of an Integer (LeetCode 2698)
- 29.The Earliest and Latest Rounds Where Players Compete (LeetCode 1900)
- 30.Special Binary String (LeetCode 761)
- 31.Brace Expansion II (LeetCode 1096)