|
2 | 2 | [](https://github.com/LeetCode-in-Scala/LeetCode-in-Scala/fork)
|
3 | 3 | > ["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)
|
4 | 4 |
|
5 |
| -* [Algorithm II](#algorithm-ii) |
6 | 5 | * [Binary Search I](#binary-search-i)
|
7 | 6 | * [Binary Search II](#binary-search-ii)
|
8 | 7 | * [Dynamic Programming I](#dynamic-programming-i)
|
|
16 | 15 | * [Data Structure I](#data-structure-i)
|
17 | 16 | * [Data Structure II](#data-structure-ii)
|
18 | 17 | * [Algorithm I](#algorithm-i)
|
19 |
| - |
20 |
| -### Algorithm II |
21 |
| - |
22 |
| -#### Day 1 Binary Search |
23 |
| - |
24 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
25 |
| -|-|-|-|-|-|- |
26 |
| -| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 478 | 97.85 |
27 |
| -| 0033 |[Search in Rotated Sorted Array](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 453 | 91.53 |
28 |
| -| 0074 |[Search a 2D Matrix](src/main/scala/g0001_0100/s0074_search_a_2d_matrix)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 478 | 83.33 |
29 |
| - |
30 |
| -#### Day 2 Binary Search |
31 |
| - |
32 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
33 |
| -|-|-|-|-|-|- |
34 |
| -| 0153 |[Find Minimum in Rotated Sorted Array](src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 457 | 78.79 |
35 |
| - |
36 |
| -#### Day 3 Two Pointers |
37 |
| - |
38 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
39 |
| -|-|-|-|-|-|- |
40 |
| -| 0015 |[3Sum](src/main/scala/g0001_0100/s0015_3sum)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 721 | 95.24 |
41 |
| - |
42 |
| -#### Day 4 Two Pointers |
43 |
| - |
44 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
45 |
| -|-|-|-|-|-|- |
46 |
| -| 0011 |[Container With Most Water](src/main/scala/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 683 | 99.13 |
47 |
| - |
48 |
| -#### Day 5 Sliding Window |
49 |
| - |
50 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
51 |
| -|-|-|-|-|-|- |
52 |
| -| 0438 |[Find All Anagrams in a String](src/main/scala/g0401_0500/s0438_find_all_anagrams_in_a_string)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 576 | 100.00 |
53 |
| - |
54 |
| -#### Day 6 Breadth First Search Depth First Search |
55 |
| - |
56 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
57 |
| -|-|-|-|-|-|- |
58 |
| -| 0200 |[Number of Islands](src/main/scala/g0101_0200/s0200_number_of_islands)| 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) | 537 | 93.18 |
59 |
| - |
60 |
| -#### Day 7 Breadth First Search Depth First Search |
61 |
| - |
62 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
63 |
| -|-|-|-|-|-|- |
64 |
| - |
65 |
| -#### Day 8 Breadth First Search Depth First Search |
66 |
| - |
67 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
68 |
| -|-|-|-|-|-|- |
69 |
| - |
70 |
| -#### Day 9 Recursion Backtracking |
71 |
| - |
72 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
73 |
| -|-|-|-|-|-|- |
74 |
| -| 0078 |[Subsets](src/main/scala/g0001_0100/s0078_subsets)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 452 | 87.50 |
75 |
| - |
76 |
| -#### Day 10 Recursion Backtracking |
77 |
| - |
78 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
79 |
| -|-|-|-|-|-|- |
80 |
| -| 0039 |[Combination Sum](src/main/scala/g0001_0100/s0039_combination_sum)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 488 | 97.50 |
81 |
| - |
82 |
| -#### Day 11 Recursion Backtracking |
83 |
| - |
84 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
85 |
| -|-|-|-|-|-|- |
86 |
| -| 0017 |[Letter Combinations of a Phone Number](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 459 | 58.54 |
87 |
| -| 0022 |[Generate Parentheses](src/main/scala/g0001_0100/s0022_generate_parentheses)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 380 | 100.00 |
88 |
| -| 0079 |[Word Search](src/main/scala/g0001_0100/s0079_word_search)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 783 | 94.87 |
89 |
| - |
90 |
| -#### Day 12 Dynamic Programming |
91 |
| - |
92 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
93 |
| -|-|-|-|-|-|- |
94 |
| -| 0055 |[Jump Game](src/main/scala/g0001_0100/s0055_jump_game)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 622 | 88.31 |
95 |
| - |
96 |
| -#### Day 13 Dynamic Programming |
97 |
| - |
98 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
99 |
| -|-|-|-|-|-|- |
100 |
| -| 0045 |[Jump Game II](src/main/scala/g0001_0100/s0045_jump_game_ii)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 510 | 88.52 |
101 |
| -| 0062 |[Unique Paths](src/main/scala/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 405 | 70.18 |
102 |
| - |
103 |
| -#### Day 14 Dynamic Programming |
104 |
| - |
105 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
106 |
| -|-|-|-|-|-|- |
107 |
| -| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65 |
108 |
| - |
109 |
| -#### Day 15 Dynamic Programming |
110 |
| - |
111 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
112 |
| -|-|-|-|-|-|- |
113 |
| -| 0139 |[Word Break](src/main/scala/g0101_0200/s0139_word_break)| 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) | 482 | 66.67 |
114 |
| - |
115 |
| -#### Day 16 Dynamic Programming |
116 |
| - |
117 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
118 |
| -|-|-|-|-|-|- |
119 |
| -| 0300 |[Longest Increasing Subsequence](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 522 | 88.89 |
120 |
| - |
121 |
| -#### Day 17 Dynamic Programming |
122 |
| - |
123 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
124 |
| -|-|-|-|-|-|- |
125 |
| -| 1143 |[Longest Common Subsequence](src/main/scala/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 507 | 100.00 |
126 |
| - |
127 |
| -#### Day 18 Dynamic Programming |
128 |
| - |
129 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
130 |
| -|-|-|-|-|-|- |
131 |
| -| 0072 |[Edit Distance](src/main/scala/g0001_0100/s0072_edit_distance)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 487 | 100.00 |
132 |
| -| 0322 |[Coin Change](src/main/scala/g0301_0400/s0322_coin_change)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 533 | 84.21 |
133 |
| - |
134 |
| -#### Day 19 Bit Manipulation |
135 |
| - |
136 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
137 |
| -|-|-|-|-|-|- |
138 |
| - |
139 |
| -#### Day 20 Others |
140 |
| - |
141 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
142 |
| -|-|-|-|-|-|- |
143 |
| - |
144 |
| -#### Day 21 Others |
145 |
| - |
146 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
147 |
| -|-|-|-|-|-|- |
| 18 | +* [Algorithm II](#algorithm-ii) |
148 | 19 |
|
149 | 20 | ### Binary Search I
|
150 | 21 |
|
|
823 | 694 |
|
824 | 695 | | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
|
825 | 696 | |-|-|-|-|-|-
|
826 |
| -| 0394 |[Decode String](src/main/scala/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 476 | 10.00 |
| 697 | +| 0394 |[Decode String](src/main/scala/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 449 | 50.00 |
827 | 698 |
|
828 | 699 | #### Day 15 Heap
|
829 | 700 |
|
|
970 | 841 | | 0003 |[Longest Substring Without Repeating Characters](src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 482 | 96.91
|
971 | 842 | | 0020 |[Valid Parentheses](src/main/scala/g0001_0100/s0020_valid_parentheses)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 449 | 65.58
|
972 | 843 | | 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65
|
973 |
| -| 0394 |[Decode String](src/main/scala/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 476 | 10.00 |
| 844 | +| 0394 |[Decode String](src/main/scala/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Big_O_Time_O(n)_Space_O(n) | 449 | 50.00 |
974 | 845 | | 0049 |[Group Anagrams](src/main/scala/g0001_0100/s0049_group_anagrams)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\*k_log_k)_Space_O(n) | 618 | 91.67
|
975 | 846 |
|
976 | 847 | #### Udemy Binary Search
|
|
1398 | 1269 | |-|-|-|-|-|-
|
1399 | 1270 | | 0136 |[Single Number](src/main/scala/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 530 | 78.57
|
1400 | 1271 |
|
| 1272 | +### Algorithm II |
| 1273 | + |
| 1274 | +#### Day 1 Binary Search |
| 1275 | + |
| 1276 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1277 | +|-|-|-|-|-|- |
| 1278 | +| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/scala/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 478 | 97.85 |
| 1279 | +| 0033 |[Search in Rotated Sorted Array](src/main/scala/g0001_0100/s0033_search_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 453 | 91.53 |
| 1280 | +| 0074 |[Search a 2D Matrix](src/main/scala/g0001_0100/s0074_search_a_2d_matrix)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 478 | 83.33 |
| 1281 | + |
| 1282 | +#### Day 2 Binary Search |
| 1283 | + |
| 1284 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1285 | +|-|-|-|-|-|- |
| 1286 | +| 0153 |[Find Minimum in Rotated Sorted Array](src/main/scala/g0101_0200/s0153_find_minimum_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 457 | 78.79 |
| 1287 | + |
| 1288 | +#### Day 3 Two Pointers |
| 1289 | + |
| 1290 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1291 | +|-|-|-|-|-|- |
| 1292 | +| 0015 |[3Sum](src/main/scala/g0001_0100/s0015_3sum)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 721 | 95.24 |
| 1293 | + |
| 1294 | +#### Day 4 Two Pointers |
| 1295 | + |
| 1296 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1297 | +|-|-|-|-|-|- |
| 1298 | +| 0011 |[Container With Most Water](src/main/scala/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 683 | 99.13 |
| 1299 | + |
| 1300 | +#### Day 5 Sliding Window |
| 1301 | + |
| 1302 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1303 | +|-|-|-|-|-|- |
| 1304 | +| 0438 |[Find All Anagrams in a String](src/main/scala/g0401_0500/s0438_find_all_anagrams_in_a_string)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_Space_O(1) | 576 | 100.00 |
| 1305 | + |
| 1306 | +#### Day 6 Breadth First Search Depth First Search |
| 1307 | + |
| 1308 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1309 | +|-|-|-|-|-|- |
| 1310 | +| 0200 |[Number of Islands](src/main/scala/g0101_0200/s0200_number_of_islands)| 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) | 537 | 93.18 |
| 1311 | + |
| 1312 | +#### Day 7 Breadth First Search Depth First Search |
| 1313 | + |
| 1314 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1315 | +|-|-|-|-|-|- |
| 1316 | + |
| 1317 | +#### Day 8 Breadth First Search Depth First Search |
| 1318 | + |
| 1319 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1320 | +|-|-|-|-|-|- |
| 1321 | + |
| 1322 | +#### Day 9 Recursion Backtracking |
| 1323 | + |
| 1324 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1325 | +|-|-|-|-|-|- |
| 1326 | +| 0078 |[Subsets](src/main/scala/g0001_0100/s0078_subsets)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Backtracking, Big_O_Time_O(2^n)_Space_O(n\*2^n) | 452 | 87.50 |
| 1327 | + |
| 1328 | +#### Day 10 Recursion Backtracking |
| 1329 | + |
| 1330 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1331 | +|-|-|-|-|-|- |
| 1332 | +| 0039 |[Combination Sum](src/main/scala/g0001_0100/s0039_combination_sum)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 488 | 97.50 |
| 1333 | + |
| 1334 | +#### Day 11 Recursion Backtracking |
| 1335 | + |
| 1336 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1337 | +|-|-|-|-|-|- |
| 1338 | +| 0017 |[Letter Combinations of a Phone Number](src/main/scala/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Big_O_Time_O(4^n)_Space_O(n) | 459 | 58.54 |
| 1339 | +| 0022 |[Generate Parentheses](src/main/scala/g0001_0100/s0022_generate_parentheses)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 380 | 100.00 |
| 1340 | +| 0079 |[Word Search](src/main/scala/g0001_0100/s0079_word_search)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 783 | 94.87 |
| 1341 | + |
| 1342 | +#### Day 12 Dynamic Programming |
| 1343 | + |
| 1344 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1345 | +|-|-|-|-|-|- |
| 1346 | +| 0055 |[Jump Game](src/main/scala/g0001_0100/s0055_jump_game)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 622 | 88.31 |
| 1347 | + |
| 1348 | +#### Day 13 Dynamic Programming |
| 1349 | + |
| 1350 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1351 | +|-|-|-|-|-|- |
| 1352 | +| 0045 |[Jump Game II](src/main/scala/g0001_0100/s0045_jump_game_ii)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 510 | 88.52 |
| 1353 | +| 0062 |[Unique Paths](src/main/scala/g0001_0100/s0062_unique_paths)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Combinatorics, Big_O_Time_O(m\*n)_Space_O(m\*n) | 405 | 70.18 |
| 1354 | + |
| 1355 | +#### Day 14 Dynamic Programming |
| 1356 | + |
| 1357 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1358 | +|-|-|-|-|-|- |
| 1359 | +| 0005 |[Longest Palindromic Substring](src/main/scala/g0001_0100/s0005_longest_palindromic_substring)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 502 | 87.65 |
| 1360 | + |
| 1361 | +#### Day 15 Dynamic Programming |
| 1362 | + |
| 1363 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1364 | +|-|-|-|-|-|- |
| 1365 | +| 0139 |[Word Break](src/main/scala/g0101_0200/s0139_word_break)| 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) | 482 | 66.67 |
| 1366 | + |
| 1367 | +#### Day 16 Dynamic Programming |
| 1368 | + |
| 1369 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1370 | +|-|-|-|-|-|- |
| 1371 | +| 0300 |[Longest Increasing Subsequence](src/main/scala/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 522 | 88.89 |
| 1372 | + |
| 1373 | +#### Day 17 Dynamic Programming |
| 1374 | + |
| 1375 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1376 | +|-|-|-|-|-|- |
| 1377 | +| 1143 |[Longest Common Subsequence](src/main/scala/g1101_1200/s1143_longest_common_subsequence)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n\*m)_Space_O(n\*m) | 507 | 100.00 |
| 1378 | + |
| 1379 | +#### Day 18 Dynamic Programming |
| 1380 | + |
| 1381 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1382 | +|-|-|-|-|-|- |
| 1383 | +| 0072 |[Edit Distance](src/main/scala/g0001_0100/s0072_edit_distance)| Hard | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 487 | 100.00 |
| 1384 | +| 0322 |[Coin Change](src/main/scala/g0301_0400/s0322_coin_change)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Big_O_Time_O(m\*n)_Space_O(amount) | 533 | 84.21 |
| 1385 | + |
| 1386 | +#### Day 19 Bit Manipulation |
| 1387 | + |
| 1388 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1389 | +|-|-|-|-|-|- |
| 1390 | + |
| 1391 | +#### Day 20 Others |
| 1392 | + |
| 1393 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1394 | +|-|-|-|-|-|- |
| 1395 | + |
| 1396 | +#### Day 21 Others |
| 1397 | + |
| 1398 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1399 | +|-|-|-|-|-|- |
| 1400 | + |
1401 | 1401 | ## Algorithms
|
1402 | 1402 |
|
1403 | 1403 | | # | Title | Difficulty | Tag | Time, ms | Time, %
|
|
1412 | 1412 | | 0438 |[Find All Anagrams in a String](src/main/scala/g0401_0500/s0438_find_all_anagrams_in_a_string)| Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Algorithm_II_Day_5_Sliding_Window, Programming_Skills_II_Day_12, Level_1_Day_12_Sliding_Window/Two_Pointer, Big_O_Time_O(n+m)_Space_O(1) | 576 | 100.00
|
1413 | 1413 | | 0437 |[Path Sum III](src/main/scala/g0401_0500/s0437_path_sum_iii)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Level_2_Day_7_Tree, Big_O_Time_O(n)_Space_O(n) | 498 | 90.91
|
1414 | 1414 | | 0416 |[Partition Equal Subset Sum](src/main/scala/g0401_0500/s0416_partition_equal_subset_sum)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Level_2_Day_13_Dynamic_Programming, Big_O_Time_O(n\*sums)_Space_O(n\*sums) | 577 | 100.00
|
1415 |
| -| 0394 |[Decode String](src/main/scala/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 476 | 10.00 |
| 1415 | +| 0394 |[Decode String](src/main/scala/g0301_0400/s0394_decode_string)| Medium | Top_100_Liked_Questions, String, Stack, Recursion, Level_1_Day_14_Stack, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 449 | 50.00 |
1416 | 1416 | | 0347 |[Top K Frequent Elements](src/main/scala/g0301_0400/s0347_top_k_frequent_elements)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Divide_and_Conquer, Quickselect, Bucket_Sort, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(k) | 589 | 93.24
|
1417 | 1417 | | 0338 |[Counting Bits](src/main/scala/g0301_0400/s0338_counting_bits)| Easy | Top_100_Liked_Questions, Dynamic_Programming, Bit_Manipulation, Udemy_Bit_Manipulation, Big_O_Time_O(num)_Space_O(num) | 447 | 92.68
|
1418 | 1418 | | 0322 |[Coin Change](src/main/scala/g0301_0400/s0322_coin_change)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Breadth_First_Search, Algorithm_II_Day_18_Dynamic_Programming, Dynamic_Programming_I_Day_20, Level_2_Day_12_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(amount) | 533 | 84.21
|
|
0 commit comments