@@ -12,7 +12,6 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
12
12
> [ "For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby."] ( https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews )
13
13
14
14
##
15
- * [ Algorithm II] ( #algorithm-ii )
16
15
* [ Binary Search I] ( #binary-search-i )
17
16
* [ Binary Search II] ( #binary-search-ii )
18
17
* [ Dynamic Programming I] ( #dynamic-programming-i )
@@ -26,135 +25,7 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
26
25
* [ Data Structure I] ( #data-structure-i )
27
26
* [ Data Structure II] ( #data-structure-ii )
28
27
* [ Algorithm I] ( #algorithm-i )
29
-
30
- ### Algorithm II
31
-
32
- #### Day 1 Binary Search
33
-
34
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
35
- |-|-|-|-|-|-
36
- | 0034 |[ Find First and Last Position of Element in Sorted Array] ( src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_ Space_O(1) | 45 | 98.05
37
- | 0033 |[ Search in Rotated Sorted Array] ( src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_ Space_O(1) | 43 | 98.54
38
- | 0074 |[ Search a 2D Matrix] ( src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_ Space_O(1) | 45 | 96.82
39
-
40
- #### Day 2 Binary Search
41
-
42
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
43
- |-|-|-|-|-|-
44
- | 0153 |[ Find Minimum in Rotated Sorted Array] ( src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_ Space_O(log_N) | 42 | 98.87
45
-
46
- #### Day 3 Two Pointers
47
-
48
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
49
- |-|-|-|-|-|-
50
- | 0015 |[ 3Sum] ( src/main/ts/g0001_0100/s0015_3sum/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\* log(n))_ Space_O(n^2) | 148 | 92.62
51
-
52
- #### Day 4 Two Pointers
53
-
54
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
55
- |-|-|-|-|-|-
56
- | 0011 |[ Container With Most Water] ( src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_ Space_O(1) | 57 | 98.23
57
-
58
- #### Day 5 Sliding Window
59
-
60
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
61
- |-|-|-|-|-|-
62
- | 0438 |[ Find All Anagrams in a String] ( src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_ Space_O(1) | 69 | 96.69
63
-
64
- #### Day 6 Breadth First Search Depth First Search
65
-
66
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
67
- |-|-|-|-|-|-
68
- | 0200 |[ Number of Islands] ( src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\* N)_ Space_O(M\* N) | 61 | 96.71
69
-
70
- #### Day 7 Breadth First Search Depth First Search
71
-
72
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
73
- |-|-|-|-|-|-
74
-
75
- #### Day 8 Breadth First Search Depth First Search
76
-
77
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
78
- |-|-|-|-|-|-
79
-
80
- #### Day 9 Recursion Backtracking
81
-
82
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
83
- |-|-|-|-|-|-
84
- | 0078 |[ Subsets] ( src/main/ts/g0001_0100/s0078_subsets/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_ Space_O(n\* 2^n) | 50 | 94.61
85
-
86
- #### Day 10 Recursion Backtracking
87
-
88
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
89
- |-|-|-|-|-|-
90
- | 0039 |[ Combination Sum] ( src/main/ts/g0001_0100/s0039_combination_sum/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_ Space_O(n+2^n) | 65 | 86.86
91
-
92
- #### Day 11 Recursion Backtracking
93
-
94
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
95
- |-|-|-|-|-|-
96
- | 0017 |[ Letter Combinations of a Phone Number] ( src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_ Space_O(n) | 52 | 79.11
97
- | 0022 |[ Generate Parentheses] ( src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_ Space_O(n) | 60 | 62.03
98
- | 0079 |[ Word Search] ( src/main/ts/g0001_0100/s0079_word_search/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\* n))_ Space_O(m\* n) | 327 | 95.78
99
-
100
- #### Day 12 Dynamic Programming
101
-
102
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
103
- |-|-|-|-|-|-
104
- | 0055 |[ Jump Game] ( src/main/ts/g0001_0100/s0055_jump_game/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_ Space_O(1) | 58 | 91.95
105
-
106
- #### Day 13 Dynamic Programming
107
-
108
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
109
- |-|-|-|-|-|-
110
- | 0045 |[ Jump Game II] ( src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_ Space_O(1) | 50 | 95.93
111
- | 0062 |[ Unique Paths] ( src/main/ts/g0001_0100/s0062_unique_paths/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\* n)_ Space_O(m\* n) | 40 | 98.97
112
-
113
- #### Day 14 Dynamic Programming
114
-
115
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
116
- |-|-|-|-|-|-
117
- | 0005 |[ Longest Palindromic Substring] ( src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 68 | 95.34
118
-
119
- #### Day 15 Dynamic Programming
120
-
121
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
122
- |-|-|-|-|-|-
123
- | 0139 |[ Word Break] ( src/main/ts/g0101_0200/s0139_word_break/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\* N)_ Space_O(M+N+max) | 56 | 88.44
124
-
125
- #### Day 16 Dynamic Programming
126
-
127
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
128
- |-|-|-|-|-|-
129
- | 0300 |[ Longest Increasing Subsequence] ( src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\* log_n)_ Space_O(n) | 57 | 93.75
130
-
131
- #### Day 17 Dynamic Programming
132
-
133
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
134
- |-|-|-|-|-|-
135
- | 1143 |[ Longest Common Subsequence] ( src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\* m)_ Space_O(n\* m) | 94 | 80.56
136
-
137
- #### Day 18 Dynamic Programming
138
-
139
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
140
- |-|-|-|-|-|-
141
- | 0072 |[ Edit Distance] ( src/main/ts/g0001_0100/s0072_edit_distance/solution.ts ) | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_ Space_O(n2) | 68 | 95.20
142
- | 0322 |[ Coin Change] ( src/main/ts/g0301_0400/s0322_coin_change/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\* n)_ Space_O(amount) | 85 | 86.14
143
-
144
- #### Day 19 Bit Manipulation
145
-
146
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
147
- |-|-|-|-|-|-
148
-
149
- #### Day 20 Others
150
-
151
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
152
- |-|-|-|-|-|-
153
-
154
- #### Day 21 Others
155
-
156
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
157
- |-|-|-|-|-|-
28
+ * [ Algorithm II] ( #algorithm-ii )
158
29
159
30
### Binary Search I
160
31
@@ -1408,6 +1279,135 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
1408
1279
|-|-|-|-|-|-
1409
1280
| 0136 |[ Single Number] ( src/main/ts/g0101_0200/s0136_single_number/solution.ts ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_ Space_O(1) | 56 | 85.48
1410
1281
1282
+ ### Algorithm II
1283
+
1284
+ #### Day 1 Binary Search
1285
+
1286
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1287
+ |-|-|-|-|-|-
1288
+ | 0034 |[ Find First and Last Position of Element in Sorted Array] ( src/main/ts/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_ Space_O(1) | 45 | 98.05
1289
+ | 0033 |[ Search in Rotated Sorted Array] ( src/main/ts/g0001_0100/s0033_search_in_rotated_sorted_array/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_ Space_O(1) | 43 | 98.54
1290
+ | 0074 |[ Search a 2D Matrix] ( src/main/ts/g0001_0100/s0074_search_a_2d_matrix/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_ Space_O(1) | 45 | 96.82
1291
+
1292
+ #### Day 2 Binary Search
1293
+
1294
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1295
+ |-|-|-|-|-|-
1296
+ | 0153 |[ Find Minimum in Rotated Sorted Array] ( src/main/ts/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_ Space_O(log_N) | 42 | 98.87
1297
+
1298
+ #### Day 3 Two Pointers
1299
+
1300
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1301
+ |-|-|-|-|-|-
1302
+ | 0015 |[ 3Sum] ( src/main/ts/g0001_0100/s0015_3sum/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\* log(n))_ Space_O(n^2) | 148 | 92.62
1303
+
1304
+ #### Day 4 Two Pointers
1305
+
1306
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1307
+ |-|-|-|-|-|-
1308
+ | 0011 |[ Container With Most Water] ( src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_ Space_O(1) | 57 | 98.23
1309
+
1310
+ #### Day 5 Sliding Window
1311
+
1312
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1313
+ |-|-|-|-|-|-
1314
+ | 0438 |[ Find All Anagrams in a String] ( src/main/ts/g0401_0500/s0438_find_all_anagrams_in_a_string/solution.ts ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_ Space_O(1) | 69 | 96.69
1315
+
1316
+ #### Day 6 Breadth First Search Depth First Search
1317
+
1318
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1319
+ |-|-|-|-|-|-
1320
+ | 0200 |[ Number of Islands] ( src/main/ts/g0101_0200/s0200_number_of_islands/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find, Big_O_Time_O(M\* N)_ Space_O(M\* N) | 61 | 96.71
1321
+
1322
+ #### Day 7 Breadth First Search Depth First Search
1323
+
1324
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1325
+ |-|-|-|-|-|-
1326
+
1327
+ #### Day 8 Breadth First Search Depth First Search
1328
+
1329
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1330
+ |-|-|-|-|-|-
1331
+
1332
+ #### Day 9 Recursion Backtracking
1333
+
1334
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1335
+ |-|-|-|-|-|-
1336
+ | 0078 |[ Subsets] ( src/main/ts/g0001_0100/s0078_subsets/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_ Space_O(n\* 2^n) | 50 | 94.61
1337
+
1338
+ #### Day 10 Recursion Backtracking
1339
+
1340
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1341
+ |-|-|-|-|-|-
1342
+ | 0039 |[ Combination Sum] ( src/main/ts/g0001_0100/s0039_combination_sum/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_ Space_O(n+2^n) | 65 | 86.86
1343
+
1344
+ #### Day 11 Recursion Backtracking
1345
+
1346
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1347
+ |-|-|-|-|-|-
1348
+ | 0017 |[ Letter Combinations of a Phone Number] ( src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_ Space_O(n) | 52 | 79.11
1349
+ | 0022 |[ Generate Parentheses] ( src/main/ts/g0001_0100/s0022_generate_parentheses/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_ Space_O(n) | 60 | 62.03
1350
+ | 0079 |[ Word Search] ( src/main/ts/g0001_0100/s0079_word_search/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\* n))_ Space_O(m\* n) | 327 | 95.78
1351
+
1352
+ #### Day 12 Dynamic Programming
1353
+
1354
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1355
+ |-|-|-|-|-|-
1356
+ | 0055 |[ Jump Game] ( src/main/ts/g0001_0100/s0055_jump_game/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_ Space_O(1) | 58 | 91.95
1357
+
1358
+ #### Day 13 Dynamic Programming
1359
+
1360
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1361
+ |-|-|-|-|-|-
1362
+ | 0045 |[ Jump Game II] ( src/main/ts/g0001_0100/s0045_jump_game_ii/solution.ts ) | Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_ Space_O(1) | 50 | 95.93
1363
+ | 0062 |[ Unique Paths] ( src/main/ts/g0001_0100/s0062_unique_paths/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\* n)_ Space_O(m\* n) | 40 | 98.97
1364
+
1365
+ #### Day 14 Dynamic Programming
1366
+
1367
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1368
+ |-|-|-|-|-|-
1369
+ | 0005 |[ Longest Palindromic Substring] ( src/main/ts/g0001_0100/s0005_longest_palindromic_substring/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_ Space_O(n) | 68 | 95.34
1370
+
1371
+ #### Day 15 Dynamic Programming
1372
+
1373
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1374
+ |-|-|-|-|-|-
1375
+ | 0139 |[ Word Break] ( src/main/ts/g0101_0200/s0139_word_break/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\* N)_ Space_O(M+N+max) | 56 | 88.44
1376
+
1377
+ #### Day 16 Dynamic Programming
1378
+
1379
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1380
+ |-|-|-|-|-|-
1381
+ | 0300 |[ Longest Increasing Subsequence] ( src/main/ts/g0201_0300/s0300_longest_increasing_subsequence/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\* log_n)_ Space_O(n) | 57 | 93.75
1382
+
1383
+ #### Day 17 Dynamic Programming
1384
+
1385
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1386
+ |-|-|-|-|-|-
1387
+ | 1143 |[ Longest Common Subsequence] ( src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts ) | Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\* m)_ Space_O(n\* m) | 94 | 80.56
1388
+
1389
+ #### Day 18 Dynamic Programming
1390
+
1391
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1392
+ |-|-|-|-|-|-
1393
+ | 0072 |[ Edit Distance] ( src/main/ts/g0001_0100/s0072_edit_distance/solution.ts ) | Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_ Space_O(n2) | 68 | 95.20
1394
+ | 0322 |[ Coin Change] ( src/main/ts/g0301_0400/s0322_coin_change/solution.ts ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\* n)_ Space_O(amount) | 85 | 86.14
1395
+
1396
+ #### Day 19 Bit Manipulation
1397
+
1398
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1399
+ |-|-|-|-|-|-
1400
+
1401
+ #### Day 20 Others
1402
+
1403
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1404
+ |-|-|-|-|-|-
1405
+
1406
+ #### Day 21 Others
1407
+
1408
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1409
+ |-|-|-|-|-|-
1410
+
1411
1411
## Algorithms
1412
1412
1413
1413
| # | Title | Difficulty | Tag | Time, ms | Time, %
0 commit comments