Neetcode150/redo.txt at main · peterbonnesoeur/Neetcode150 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105


## Exercises to redo:

- 3-Two_sum
- 4-Group_Anagrams
- 6-Product_of_array_except_self
- 7-Valid_Sudoku
- 9-Longuest_consecutive_sequence

# Two Pointers:
- 10-Valid Palindrome
- 12-ThreeSum
- 14-Tapping_Rainwater

# Sliding Window:
- 15-Best Time to Buy and Sell Stock
- 17-Longest Repeating Character Replacement
- 18-Permutation_In_string
- 20-Sliding Window Maximum

# Stack
- 21-Valid_parenthesis
- 24-Generate_Parenthesis
- 25-Daily_temperatures
- 26-Car_Fleet
- 27-largest_rectangle_area

# Binary search
Can be detected with log(n) complexity
- 31-koko_eating_bananas
- 32-Search_rotating_array
- 35-Median_of_2_sorte_arrays

# Tries:
59 ->  This is a really tricky one.A dfs implementation that can be refined with early stopping mechanism. I had to watch vids about advanced tries for that...

# Linked List:
- 32 - Reverse linked list
- 34 - Reorder list
- 39 - Find duplicate number
- 40 - LRU cache
- 42 - Reverse K Groups

# Tree
- 45- Diameter of binary Tree
- 46- Balanced binary tree
- 49-Lowest_common_ancestor_BST
- 53-Is_Valid_BST
- 55-Construct_Binary_Tree_From_Preorder_And_Inorder_Traversal

# Backtracking
- 67-subsets
- 69-permutations
- 70=subset-2 -> really tricky as the rule of the exercise are arguably wrong...

# Heap
- 63 - Cooling down ->We need to see the heaps there...
- 64 - Kth_largest
- 66 - FindMedian -> Heaps obvious but try to redo all computation on paper pls

# Math & Geometry

- Plus one -> just for the pleasure of over-engineering it.
- 132 - rotate image


# Intervals
- 130 meeting room 2

# Graphs
- 76-Visited_island
- 78 - Max area island : Need to study the BFS again
- 86 - union find but I also want to find something else a bit more BFS style...

# 1-D Dynamic Programming:
- 95-Climbing stairs
- 97 House robber
- 102 Coin Change
- 106 Can Partition

# 2-D Dynamic Programming
-107- Unique Paths
-108 - Longest common subsequence
- 109 MaxProfit
- 110 Coin change 2
- 111 target sum
- 112 isInterleave
- 113 Longest Increasing Path
- 115 minDistance
- 117 Regex
- 119 CanJump1
- 123 Merge triplets
- 125 Check Valid Parenthesis string

# Greedy
119
120
123
125

# Bit manipulation
143
144
145