Study Home
Data Structures
File | reviewed | mastery |
---|---|---|
Trie | false | 4 |
Heap | false | 4 |
DP | false | 4 |
Bit Operations | false | 4 |
Binary Search | false | 4 |
Data struct Template | false | 4 |
Leet Code to review
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
746 Min Cost Climbing Stairs | - | - | 1 | - | |
Leet Code Template | - | - | 2 | - |
array
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
238 Product of Array Except self | 5 | in place with variable | 2 |
| - |
443 String compression | 6 | idea is there but implementation not clear | 2 |
| - |
backtracing
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
216 Combination Sum III | 3 | backtracking idea is there but implementation lack | 2 |
| - |
17 Letter Combinations of a Phone Number | 9 | Need to be more familiar with string manipulation | 2 |
| - |
bfs
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
994 Rotting Orange | 6 | Revised how to do bfs | 2 |
| - |
bfs,binary tree
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
199 Binary Tree Right Side View | 7 | - | 2 |
| - |
bfs,graph
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
1926 Nearest Exit from Entrance in Maze | - | In BFS, however, we explore cells by the order of their distance from the starting position, so whenever we reach an exit cell, we are guaranteed that it is the closest exit! | 2 |
| - |
binary search
Note3 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
875 Koko Eating Bananas | 4 | Need the detailed implementation of binary search, the quotient and movement of low and high is not exact | 2 |
| - |
2300 Successful Pairs of Spells and Potions | 6 | use bisect | 2 |
| - |
162 Find Peak Element | 8 | - | 2 |
| - |
binary tree,dfs
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
236 Lowest Common Ancestor of a Binary Tree | 4 | optimisation | 2 |
| - |
bits
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
136 Single Number | 2 | bit operation revision | 2 |
| - |
bits,dp
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
338 Counting bits | 2 | I have no idea how to use bits to solve this problem | 2 |
| - |
dfs
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
1466 Reorder Routes to Make All Paths Lead to the City Zero | 3 | - | 2 |
| - |
399. Evaluate Division | 7 | Revised how to do dfs | 2 |
| false |
dp
Note3 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
790 Domino and Tromino Tiling | 0 | - | 2 |
| - |
62 Unique Paths | 6 | - | 2 |
| - |
198 House Robber | 6 | go lang array manipulation and dp methodologies | 2 |
| - |
dp,P2D
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
72 Edit Distance | 0 | bottom up tabulation revise | 2 |
| - |
1143 Longest Common Subsequence | 6 | Review how memoization works | 2 |
| - |
graph,bfs,dfs
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
547 Number of Province | 4 | Read the question carefully | 2 |
| - |
greedy,interval scheduling
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
435 Non-overlapping intervals | 5 | - | 2 |
| - |
hashmap,set
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
2352 Equal Row and column pairs | 8 | abit unfamiliar with python default dict | 2 |
| - |
heap
Note4 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
2542 Maximum Subsequence Score | 2 | - | 2 |
| - |
215 Kth Largest Element in Array | 3 | Very not familiar with how to perform heap code | 2 |
| - |
2462 Total Cost to Hire K Workers | 5 | the logical though abit messy | 2 |
| - |
2336 Smallest Number in Infinite Set | 7 | - | 2 |
| - |
Interval
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
452 Minimum Number of Arrows to Burst Balloons | 6 | - | 2 |
| - |
linked list
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
2130 Maximum Twin Sum of a Linked List | 5 | fast and slow pointer to identify the mid point, revise how to reverse a linked list | 2 |
| false |
monotonic stack
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
739 Daily Temperature | 6 | Learn about monotonic stack | 2 |
| - |
sliding window
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
1456 Maximum Number of Vowels in a Substring of Given Length | 6 | indexing is not clear | 2 |
| - |
1493 Longest Subarray of 1's After Deleting One Element | 7 | - | 2 |
| - |
stack
Note2 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
735 Asteroid Collision | 7 | find out clearly, when are the time that an if else is needed | 2 |
| - |
394 Decode String | 8 | - | 2 |
| - |
stack,monotonic stack
Note1 | Mastery | Comment | Difficulty | Topics | reviewed |
---|---|---|---|---|---|
901 Online Stock Span | 8 | - | 2 |
| - |
Lesson to review
Evaluation Error: TypeError: Cannot read properties of undefined (reading 'push') at eval (eval at <anonymous> (plugin:dataview), <anonymous>:28:21) at async DataviewJSRenderer.render (plugin:dataview:18650:13)