Belief - Practice makes perfection; Digestion needs time!

We emphasize the general methods, logics, and the use of data structures. Hopefully the contents also help you practice coding.

About me: Engineer/Scientist working on ML/AI based on San Francisco, CA; Ph.D. in Math / 数学博士
Content: Personal Notes and Practices on Data Structure and Algorithm, Coding, Leetcode (数据结构与算法, 编程练习)。

Disclaimer: The solutions in the channel videos, as personal notes and practice, represent the author's personal understanding, research and studies. They do not form any suggestions. We make no representation or warranty of any kind, express or implied, regarding the accuracy, adequacy, validity, reliability, availability or completeness of any information, correctness for these videos as personal notes.

leetcode 392 Is Subsequence | two pointer
5:18
leetcode 392 Is Subsequence | two pointer
leetcode 3551 Minimum Swaps to Sort by Digit Sum | sort + find
11:49
leetcode 3551 Minimum Swaps to Sort by Digit Sum | sort + find
leetcode 3561 Resulting String After Adjacent Removals | stack
6:01
leetcode 3561 Resulting String After Adjacent Removals | stack
leetcode 408 Valid Word Abbreviation | two pointer sliding window
9:06
leetcode 408 Valid Word Abbreviation | two pointer sliding window
leetcode 3550 Smallest Index With Digit Sum Equal to Index | while loop or type conversion
3:54
leetcode 3550 Smallest Index With Digit Sum Equal to Index | while loop or type conversion
leetcode 2131 Longest Palindrome by Concatenating Two Letter Words | dict and count
6:18
leetcode 2131 Longest Palindrome by Concatenating Two Letter Words | dict and count
leetcode 3489 Zero Array Transformation IV | construct all possible decrements
8:49
leetcode 3489 Zero Array Transformation IV | construct all possible decrements
leetcode 3489 Zero Array Transformation IV | dp with bitmask, two versions of the same idea
15:32
leetcode 3489 Zero Array Transformation IV | dp with bitmask, two versions of the same idea
leetcode 3362 Zero Array Transformation III | two heaps
20:33
leetcode 3362 Zero Array Transformation III | two heaps
leetcode 3355 Zero Array Transformation I | line sweep
7:56
leetcode 3355 Zero Array Transformation I | line sweep
441 Arranging Coins | routine while loop, or binary search
7:22
441 Arranging Coins | routine while loop, or binary search
leetcode 75 Sort Colors | three way partition
8:21
leetcode 75 Sort Colors | three way partition
leetcode 2901 Longest Unequal Adjacent Groups Subsequence II | DP with path chasing
11:56
leetcode 2901 Longest Unequal Adjacent Groups Subsequence II | DP with path chasing
leetcode 205 Isomorphic Strings | index partition
6:26
leetcode 205 Isomorphic Strings | index partition
leetcode 2900 Longest Unequal Adjacent Groups Subsequence I | index partition
6:44
leetcode 2900 Longest Unequal Adjacent Groups Subsequence I | index partition
leetcode 3545 Minimum Deletions for At Most K Distinct Characters | heap
5:07
leetcode 3545 Minimum Deletions for At Most K Distinct Characters | heap
leetcode 3335 Total Characters in String After Transformation I | queue shifting
8:28
leetcode 3335 Total Characters in String After Transformation I | queue shifting
leetcode 2094 Finding 3 Digit Even Numbers | direct check, or backtracking
8:54
leetcode 2094 Finding 3 Digit Even Numbers | direct check, or backtracking
leetcode 3533 Concatenated Divisibility | recursive backtracking with bitmask
14:38
leetcode 3533 Concatenated Divisibility | recursive backtracking with bitmask
leetcode 1550 Three Consecutive Odds | direct check, or mimic a fixed window using queue
6:23
leetcode 1550 Three Consecutive Odds | direct check, or mimic a fixed window using queue
leetcode 2918 Minimum Equal Sum of Two Arrays After Replacing Zeros | mathematical inequality
12:33
leetcode 2918 Minimum Equal Sum of Two Arrays After Replacing Zeros | mathematical inequality
leetcode 1928 Minimum Cost to Reach Destination in Time | Dijkstra's algorithm with 2 relaxations
17:10
leetcode 1928 Minimum Cost to Reach Destination in Time | Dijkstra's algorithm with 2 relaxations
leetcode 3540 Minimum Time to Visit All Houses | partial sums
21:00
leetcode 3540 Minimum Time to Visit All Houses | partial sums
leetcode 3341 Find Minumum Time to Reach Last Room I | Dijkstra's algorithm
10:14
leetcode 3341 Find Minumum Time to Reach Last Room I | Dijkstra's algorithm
leetcode 3537 Fill a Special Grid | recursion + copy
9:40
leetcode 3537 Fill a Special Grid | recursion + copy
leetcode 3536 Maximum Product of Two Digits | while loop or type conversion
3:31
leetcode 3536 Maximum Product of Two Digits | while loop or type conversion
leetcode 790 Domino and Trimino Tiling Mathematical Induction and DP
11:03
leetcode 790 Domino and Trimino Tiling Mathematical Induction and DP
leetcode 1128 Number of Equivalent Domino Pairs | partition and simple counting
5:41
leetcode 1128 Number of Equivalent Domino Pairs | partition and simple counting
leetcode 3535 Unit Conversion II | dfs or bfs, mod multiplicative inverse
12:40
leetcode 3535 Unit Conversion II | dfs or bfs, mod multiplicative inverse
leetcode 2071 Maximum Number of Tasks You Can Assign | binary search
15:00
leetcode 2071 Maximum Number of Tasks You Can Assign | binary search