← Productivity
LeetCode Tracker
Log problems, track attempts and repeats, and review what still needs practice.
| Problem | Attempts | Repeats | Long Notes | Short Hint | |
|---|---|---|---|---|---|
| Design Browser HistoryHistory | 0 | 1 | No notes | very similar to design linked list, use a doubly linked list, check when looping for back and forward if the next or prev of the cur element is null. dummy nodes actually make this harder | |
| Max Consecutive OnesHistory | 0 | 0 | No notes | No hint | |
| Remove ElementHistory | 0 | 0 | No notes | No hint | |
| Concatenation of ArrayHistory | 0 | 0 | No notes | No hint | |
| Baseball GameHistory | 0 | 0 | No notes | No hint | |
| Min StackHistory | 0 | 0 | No notes | No hint | |
| Reverse Linked ListHistory | 0 | 0 | No notes | No hint | |
| Merge Two Sorted ListsHistory | 0 | 0 | No notes | No hint | |
| Design Linked ListHistory | 3 | 1 | No notes | a bit easier using two dummy nodes on left and right |