Share LeetCode and HackerRank solutions.


[ LeetCode 87 ] Subsets | Bit Manipulation | Python | Complexity explained | Code
18:03
[ LeetCode 87 ] Subsets | Bit Manipulation | Python | Complexity explained | Code
[ LeetCode 2642 ] Design Graph With Shortest Path Calculator | Floyd-Warshall | Python
11:48
[ LeetCode 2642 ] Design Graph With Shortest Path Calculator | Floyd-Warshall | Python
[ LeetCode 2355 ] Maximum Number of Books You Can Take | Python | DP | Stack | 中文 | 視覺化解釋
7:31
[ LeetCode 2355 ] Maximum Number of Books You Can Take | Python | DP | Stack | 中文 | 視覺化解釋
[ LeetCode 2355 ] Maximum Number of Books You Can Take | DP | Stack | 中文 | 視覺化解釋
38:23
[ LeetCode 2355 ] Maximum Number of Books You Can Take | DP | Stack | 中文 | 視覺化解釋
[ LeetCode 779 ] K-th Symbol In Grammar | Recursion | Binary Tree | Python
15:30
[ LeetCode 779 ] K-th Symbol In Grammar | Recursion | Binary Tree | Python
[ Hackerrank ] Reverse Shuffle Merge | Stack | Linear O | Python
22:41
[ Hackerrank ] Reverse Shuffle Merge | Stack | Linear O | Python
[ LeetCode 2251 ] Number Of Flowers In Full Bloom
22:00
[ LeetCode 2251 ] Number Of Flowers In Full Bloom
[ LeetCode 847 ] Shortest Path Visiting All Nodes | Python | BFS | Graph
37:36
[ LeetCode 847 ] Shortest Path Visiting All Nodes | Python | BFS | Graph
[ LeetCode 2104 ] Sum of Subarray Ranges | Coding | Python
6:54
[ LeetCode 2104 ] Sum of Subarray Ranges | Coding | Python
[ HackerRank ] Recursive Digit Sum | Java | char caculation
9:49
[ HackerRank ] Recursive Digit Sum | Java | char caculation
[ HackerRank ] Fraudulent Activity Notifications | Counting sort | Find Median | Java
22:14
[ HackerRank ] Fraudulent Activity Notifications | Counting sort | Find Median | Java
[ HackerRank ] LegoBlocks | Dynamic Programming | Python | Visual Explanation
33:38
[ HackerRank ] LegoBlocks | Dynamic Programming | Python | Visual Explanation
[ LeetCode 606 ] Construct String from Binary Tree | Stack | Complexity Explained | Python
24:57
[ LeetCode 606 ] Construct String from Binary Tree | Stack | Complexity Explained | Python
[ LeetCode 1326 ] Minimum Number of Taps to Open to Water a Garden | Greedy | Python
25:02
[ LeetCode 1326 ] Minimum Number of Taps to Open to Water a Garden | Greedy | Python
[ LeetCode 120 ] Triangle | Bottomu-Up DP | Recursion | Memoization | Complexity Explained | Python
16:05
[ LeetCode 120 ] Triangle | Bottomu-Up DP | Recursion | Memoization | Complexity Explained | Python
[ LeetCode 289 ] Game of Life | Java | Bit | In-place update
20:56
[ LeetCode 289 ] Game of Life | Java | Bit | In-place update
[ LeetCode 399 ] Evaluate Division | Union Find | Python
39:21
[ LeetCode 399 ] Evaluate Division | Union Find | Python
[ LeetCode 1130 ] Minimum Cost Tree From Leaf Values || DP || Python
24:45
[ LeetCode 1130 ] Minimum Cost Tree From Leaf Values || DP || Python
[ LeetCode 862 ] Shortest Subarray with Sum at Least K | deque | python
28:28
[ LeetCode 862 ] Shortest Subarray with Sum at Least K | deque | python
[ LeetCode 2104 ] Sum of Subarray Ranges | Monotonic Stack
18:57
[ LeetCode 2104 ] Sum of Subarray Ranges | Monotonic Stack
[ LeetCode 1857 ] Largest Color Value in Directed Graph | DFS + Memoization
28:08
[ LeetCode 1857 ] Largest Color Value in Directed Graph | DFS + Memoization
[LeetCode 2345 ] Finding the number of visible mountains | One pass Argo
15:27
[LeetCode 2345 ] Finding the number of visible mountains | One pass Argo
[ LeetCode 1319 ] Number of Operations to Make Network Connected | DFS | Explain in diagram
15:44
[ LeetCode 1319 ] Number of Operations to Make Network Connected | DFS | Explain in diagram
[ LeetCode 862 ] [ Chinese ] Shortest Subarray with Sum at Least K | starts from n square to linear
21:07
[ LeetCode 862 ] [ Chinese ] Shortest Subarray with Sum at Least K | starts from n square to linear
[ Leetcode 1888 ] [ Chinese ] Minimum Number of Flips to Make the Binary String Alternating
9:37
[ Leetcode 1888 ] [ Chinese ] Minimum Number of Flips to Make the Binary String Alternating
[ LeetCode 240 ] Search a 2D matrix 2
10:17
[ LeetCode 240 ] Search a 2D matrix 2