Skip to content

Commit 31df4cc

Browse files
javadevjavadev
committed
Added tasks 6-20
1 parent 3594588 commit 31df4cc

File tree

11 files changed

+1005
-104
lines changed

11 files changed

+1005
-104
lines changed

‎README.md‎

Lines changed: 127 additions & 104 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,6 @@
22
[![](https://img.shields.io/github/forks/LeetCode-in-Rust/LeetCode-in-Rust?label=Fork%20me%20on%20GitHub%20&style=flat-square)](https://github.com/LeetCode-in-Rust/LeetCode-in-Rust/fork)
33
> ["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)
44
5-
* [Level 2](#level-2)
65
* [Udemy](#udemy)
76
* [Data Structure I](#data-structure-i)
87
* [Data Structure II](#data-structure-ii)
@@ -16,122 +15,23 @@
1615
* [Graph Theory I](#graph-theory-i)
1716
* [SQL I](#sql-i)
1817
* [Level 1](#level-1)
19-
20-
### Level 2
21-
22-
#### Day 1 Implementation/Simulation
23-
24-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
25-
|-|-|-|-|-|-
26-
27-
#### Day 2 String
28-
29-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
30-
|-|-|-|-|-|-
31-
32-
#### Day 3 Linked List
33-
34-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
35-
|-|-|-|-|-|-
36-
37-
#### Day 4 Linked List
38-
39-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
40-
|-|-|-|-|-|-
41-
42-
#### Day 5 Greedy
43-
44-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
45-
|-|-|-|-|-|-
46-
47-
#### Day 6 Tree
48-
49-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
50-
|-|-|-|-|-|-
51-
52-
#### Day 7 Tree
53-
54-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
55-
|-|-|-|-|-|-
56-
57-
#### Day 8 Binary Search
58-
59-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
60-
|-|-|-|-|-|-
61-
62-
#### Day 9 Binary Search Tree
63-
64-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
65-
|-|-|-|-|-|-
66-
67-
#### Day 10 Graph/BFS/DFS
68-
69-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
70-
|-|-|-|-|-|-
71-
72-
#### Day 11 Graph/BFS/DFS
73-
74-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
75-
|-|-|-|-|-|-
76-
77-
#### Day 12 Dynamic Programming
78-
79-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
80-
|-|-|-|-|-|-
81-
82-
#### Day 13 Dynamic Programming
83-
84-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
85-
|-|-|-|-|-|-
86-
87-
#### Day 14 Sliding Window/Two Pointer
88-
89-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
90-
|-|-|-|-|-|-
91-
| 0003 |[Longest Substring Without Repeating Characters](src/main/rust/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) | 0 | 100.00
92-
93-
#### Day 15 Tree
94-
95-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
96-
|-|-|-|-|-|-
97-
98-
#### Day 16 Design
99-
100-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
101-
|-|-|-|-|-|-
102-
103-
#### Day 17 Interval
104-
105-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
106-
|-|-|-|-|-|-
107-
108-
#### Day 18 Stack
109-
110-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
111-
|-|-|-|-|-|-
112-
113-
#### Day 19 Union Find
114-
115-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
116-
|-|-|-|-|-|-
117-
118-
#### Day 20 Brute Force/Backtracking
119-
120-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
121-
|-|-|-|-|-|-
18+
* [Level 2](#level-2)
12219

12320
### Udemy
12421

12522
#### Udemy Integers
12623

12724
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12825
|-|-|-|-|-|-
26+
| 0007 |[Reverse Integer](src/main/rust/g0001_0100/s0007_reverse_integer)| Medium | Top_Interview_Questions, Math | 0 | 100.00
27+
| 0009 |[Palindrome Number](src/main/rust/g0001_0100/s0009_palindrome_number)| Easy | Math | 0 | 100.00
12928

13029
#### Udemy Strings
13130

13231
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13332
|-|-|-|-|-|-
13433
| 0003 |[Longest Substring Without Repeating Characters](src/main/rust/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) | 0 | 100.00
34+
| 0020 |[Valid Parentheses](src/main/rust/g0001_0100/s0020_valid_parentheses)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
13535
| 0005 |[Longest Palindromic Substring](src/main/rust/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) | 1 | 92.60
13636

13737
#### Udemy Binary Search
@@ -149,6 +49,7 @@
14949

15050
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
15151
|-|-|-|-|-|-
52+
| 0015 |[3Sum](src/main/rust/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) | 27 | 81.94
15253

15354
#### Udemy Famous Algorithm
15455

@@ -189,11 +90,13 @@
18990

19091
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
19192
|-|-|-|-|-|-
93+
| 0010 |[Regular Expression Matching](src/main/rust/g0001_0100/s0010_regular_expression_matching)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00
19294

19395
#### Udemy Backtracking/Recursion
19496

19597
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
19698
|-|-|-|-|-|-
99+
| 0017 |[Letter Combinations of a Phone Number](src/main/rust/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) | 0 | 100.00
197100

198101
#### Udemy Bit Manipulation
199102

@@ -252,6 +155,7 @@
252155

253156
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
254157
|-|-|-|-|-|-
158+
| 0020 |[Valid Parentheses](src/main/rust/g0001_0100/s0020_valid_parentheses)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
255159

256160
#### Day 10 Tree
257161

@@ -284,6 +188,7 @@
284188

285189
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
286190
|-|-|-|-|-|-
191+
| 0015 |[3Sum](src/main/rust/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) | 27 | 81.94
287192

288193
#### Day 2 Array
289194

@@ -413,6 +318,7 @@
413318

414319
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
415320
|-|-|-|-|-|-
321+
| 0019 |[Remove Nth Node From End of List](src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
416322

417323
#### Day 6 Sliding Window
418324

@@ -476,11 +382,13 @@
476382

477383
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
478384
|-|-|-|-|-|-
385+
| 0015 |[3Sum](src/main/rust/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) | 27 | 81.94
479386

480387
#### Day 4 Two Pointers
481388

482389
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
483390
|-|-|-|-|-|-
391+
| 0011 |[Container With Most Water](src/main/rust/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) | 4 | 95.02
484392

485393
#### Day 5 Sliding Window
486394

@@ -516,6 +424,7 @@
516424

517425
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
518426
|-|-|-|-|-|-
427+
| 0017 |[Letter Combinations of a Phone Number](src/main/rust/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) | 0 | 100.00
519428

520429
#### Day 12 Dynamic Programming
521430

@@ -1207,10 +1116,124 @@
12071116
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12081117
|-|-|-|-|-|-
12091118

1119+
### Level 2
1120+
1121+
#### Day 1 Implementation/Simulation
1122+
1123+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1124+
|-|-|-|-|-|-
1125+
1126+
#### Day 2 String
1127+
1128+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1129+
|-|-|-|-|-|-
1130+
1131+
#### Day 3 Linked List
1132+
1133+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1134+
|-|-|-|-|-|-
1135+
| 0019 |[Remove Nth Node From End of List](src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
1136+
1137+
#### Day 4 Linked List
1138+
1139+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1140+
|-|-|-|-|-|-
1141+
1142+
#### Day 5 Greedy
1143+
1144+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1145+
|-|-|-|-|-|-
1146+
1147+
#### Day 6 Tree
1148+
1149+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1150+
|-|-|-|-|-|-
1151+
1152+
#### Day 7 Tree
1153+
1154+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1155+
|-|-|-|-|-|-
1156+
1157+
#### Day 8 Binary Search
1158+
1159+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1160+
|-|-|-|-|-|-
1161+
1162+
#### Day 9 Binary Search Tree
1163+
1164+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1165+
|-|-|-|-|-|-
1166+
1167+
#### Day 10 Graph/BFS/DFS
1168+
1169+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1170+
|-|-|-|-|-|-
1171+
1172+
#### Day 11 Graph/BFS/DFS
1173+
1174+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1175+
|-|-|-|-|-|-
1176+
1177+
#### Day 12 Dynamic Programming
1178+
1179+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1180+
|-|-|-|-|-|-
1181+
1182+
#### Day 13 Dynamic Programming
1183+
1184+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1185+
|-|-|-|-|-|-
1186+
1187+
#### Day 14 Sliding Window/Two Pointer
1188+
1189+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1190+
|-|-|-|-|-|-
1191+
| 0003 |[Longest Substring Without Repeating Characters](src/main/rust/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) | 0 | 100.00
1192+
1193+
#### Day 15 Tree
1194+
1195+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1196+
|-|-|-|-|-|-
1197+
1198+
#### Day 16 Design
1199+
1200+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1201+
|-|-|-|-|-|-
1202+
1203+
#### Day 17 Interval
1204+
1205+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1206+
|-|-|-|-|-|-
1207+
1208+
#### Day 18 Stack
1209+
1210+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1211+
|-|-|-|-|-|-
1212+
1213+
#### Day 19 Union Find
1214+
1215+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1216+
|-|-|-|-|-|-
1217+
1218+
#### Day 20 Brute Force/Backtracking
1219+
1220+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1221+
|-|-|-|-|-|-
1222+
12101223
## Algorithms
12111224

12121225
| # | Title | Difficulty | Tag | Time, ms | Time, %
12131226
|------|----------------|-------------|-------------|----------|--------
1227+
| 0020 |[Valid Parentheses](src/main/rust/g0001_0100/s0020_valid_parentheses)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, String, Stack, Data_Structure_I_Day_9_Stack_Queue, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
1228+
| 0019 |[Remove Nth Node From End of List](src/main/rust/g0001_0100/s0019_remove_nth_node_from_end_of_list)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Algorithm_I_Day_5_Two_Pointers, Level_2_Day_3_Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
1229+
| 0017 |[Letter Combinations of a Phone Number](src/main/rust/g0001_0100/s0017_letter_combinations_of_a_phone_number)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Backtracking, Algorithm_II_Day_11_Recursion_Backtracking, Udemy_Backtracking/Recursion, Big_O_Time_O(4^n)_Space_O(n) | 0 | 100.00
1230+
| 0015 |[3Sum](src/main/rust/g0001_0100/s0015_3sum)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Data_Structure_II_Day_1_Array, Algorithm_II_Day_3_Two_Pointers, Udemy_Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 27 | 81.94
1231+
| 0011 |[Container With Most Water](src/main/rust/g0001_0100/s0011_container_with_most_water)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Greedy, Two_Pointers, Algorithm_II_Day_4_Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 4 | 95.02
1232+
| 0010 |[Regular Expression Matching](src/main/rust/g0001_0100/s0010_regular_expression_matching)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Udemy_Dynamic_Programming, Big_O_Time_O(m\*n)_Space_O(m\*n) | 0 | 100.00
1233+
| 0009 |[Palindrome Number](src/main/rust/g0001_0100/s0009_palindrome_number)| Easy | Math, Udemy_Integers | 0 | 100.00
1234+
| 0008 |[String to Integer (atoi)](src/main/rust/g0001_0100/s0008_string_to_integer_atoi)| Medium | Top_Interview_Questions, String | 0 | 100.00
1235+
| 0007 |[Reverse Integer](src/main/rust/g0001_0100/s0007_reverse_integer)| Medium | Top_Interview_Questions, Math, Udemy_Integers | 0 | 100.00
1236+
| 0006 |[Zigzag Conversion](src/main/rust/g0001_0100/s0006_zigzag_conversion)| Medium | String | 0 | 100.00
12141237
| 0005 |[Longest Palindromic Substring](src/main/rust/g0001_0100/s0005_longest_palindromic_substring)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Data_Structure_II_Day_9_String, Algorithm_II_Day_14_Dynamic_Programming, Dynamic_Programming_I_Day_17, Udemy_Strings, Big_O_Time_O(n)_Space_O(n) | 1 | 92.60
12151238
| 0004 |[Median of Two Sorted Arrays](src/main/rust/g0001_0100/s0004_median_of_two_sorted_arrays)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Divide_and_Conquer, Big_O_Time_O(log(min(N,M)))_Space_O(1) | 0 | 100.00
12161239
| 0003 |[Longest Substring Without Repeating Characters](src/main/rust/g0001_0100/s0003_longest_substring_without_repeating_characters)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Algorithm_I_Day_6_Sliding_Window, Level_2_Day_14_Sliding_Window/Two_Pointer, Udemy_Strings, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00

0 commit comments

Comments
 (0)