@@ -9,8 +9,6 @@ Cpp-based LeetCode algorithm problem solutions, regularly updated.
99> [ "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 )
1010
1111##
12- * [ Programming Skills II] ( #programming-skills-ii )
13- * [ Graph Theory I] ( #graph-theory-i )
1412* [ SQL I] ( #sql-i )
1513* [ Level 1] ( #level-1 )
1614* [ Level 2] ( #level-2 )
@@ -24,188 +22,8 @@ Cpp-based LeetCode algorithm problem solutions, regularly updated.
2422* [ Binary Search II] ( #binary-search-ii )
2523* [ Dynamic Programming I] ( #dynamic-programming-i )
2624* [ Programming Skills I] ( #programming-skills-i )
27-
28- ###Programming Skills II
29-
30- ####Day 1
31-
32- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
33- |-|-|-|-|-|-
34-
35- ####Day 2
36-
37- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
38- |-|-|-|-|-|-
39-
40- ####Day 3
41-
42- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
43- |-|-|-|-|-|-
44-
45- ####Day 4
46-
47- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
48- |-|-|-|-|-|-
49-
50- ####Day 5
51-
52- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
53- |-|-|-|-|-|-
54-
55- ####Day 6
56-
57- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
58- |-|-|-|-|-|-
59- | 0739 |[ Daily Temperatures] ( src/main/cpp/g0701_0800/s0739_daily_temperatures/Solution.cpp ) | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_ Space_O(n) | 103 | 91.31
60-
61- ####Day 7
62-
63- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
64- |-|-|-|-|-|-
65- | 0048 |[ Rotate Image] ( src/main/cpp/g0001_0100/s0048_rotate_image/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_ Space_O(1) | 0 | 100.00
66-
67- ####Day 8
68-
69- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
70- |-|-|-|-|-|-
71-
72- ####Day 9
73-
74- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
75- |-|-|-|-|-|-
76-
77- ####Day 10
78-
79- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
80- |-|-|-|-|-|-
81-
82- ####Day 11
83-
84- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
85- |-|-|-|-|-|-
86- | 0049 |[ Group Anagrams] ( src/main/cpp/g0001_0100/s0049_group_anagrams/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\* k_log_k)_ Space_O(n) | 18 | 96.16
87-
88- ####Day 12
89-
90- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
91- |-|-|-|-|-|-
92- | 0438 |[ Find All Anagrams in a String] ( src/main/cpp/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.cpp ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_ Space_O(1) | 0 | 100.00
93-
94- ####Day 13
95-
96- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
97- |-|-|-|-|-|-
98-
99- ####Day 14
100-
101- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
102- |-|-|-|-|-|-
103- | 0138 |[ Copy List with Random Pointer] ( src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_ Space_O(N) | 5 | 65.69
104-
105- ####Day 15
106-
107- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
108- |-|-|-|-|-|-
109- | 0002 |[ Add Two Numbers] ( src/main/cpp/g0001_0100/s0002_add_two_numbers/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_ Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 16 | 82.17
110-
111- ####Day 16
112-
113- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
114- |-|-|-|-|-|-
115-
116- ####Day 17
117-
118- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
119- |-|-|-|-|-|-
120-
121- ####Day 18
122-
123- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
124- |-|-|-|-|-|-
125- | 0155 |[ Min Stack] ( src/main/cpp/g0101_0200/s0155_min_stack/MinStack.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_ Space_O(N) | 10 | 96.74
126-
127- ####Day 19
128-
129- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
130- |-|-|-|-|-|-
131-
132- ####Day 20
133-
134- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
135- |-|-|-|-|-|-
136-
137- ###Graph Theory I
138-
139- ####Day 1 Matrix Related Problems
140-
141- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
142- |-|-|-|-|-|-
143- | 0200 |[ Number of Islands] ( src/main/cpp/g0101_0200/s0200_number_of_islands/Solution.cpp ) | 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) | 19 | 97.48
144-
145- ####Day 2 Matrix Related Problems
146-
147- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
148- |-|-|-|-|-|-
149-
150- ####Day 3 Matrix Related Problems
151-
152- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
153- |-|-|-|-|-|-
154-
155- ####Day 4 Matrix Related Problems
156-
157- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
158- |-|-|-|-|-|-
159-
160- ####Day 5 Matrix Related Problems
161-
162- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
163- |-|-|-|-|-|-
164-
165- ####Day 6 Matrix Related Problems
166-
167- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
168- |-|-|-|-|-|-
169-
170- ####Day 7 Standard Traversal
171-
172- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
173- |-|-|-|-|-|-
174-
175- ####Day 8 Standard Traversal
176-
177- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
178- |-|-|-|-|-|-
179-
180- ####Day 9 Standard Traversal
181-
182- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
183- |-|-|-|-|-|-
184-
185- ####Day 10 Standard Traversal
186-
187- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
188- |-|-|-|-|-|-
189-
190- ####Day 11 Breadth First Search
191-
192- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
193- |-|-|-|-|-|-
194-
195- ####Day 12 Breadth First Search
196-
197- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
198- |-|-|-|-|-|-
199-
200- ####Day 13 Graph Theory
201-
202- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
203- |-|-|-|-|-|-
204-
205- ####Day 14 Graph Theory
206-
207- |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
208- |-|-|-|-|-|-
25+ * [ Programming Skills II] ( #programming-skills-ii )
26+ * [ Graph Theory I] ( #graph-theory-i )
20927
21028###SQL I
21129
@@ -1590,6 +1408,188 @@ Cpp-based LeetCode algorithm problem solutions, regularly updated.
15901408|<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
15911409|-|-|-|-|-|-
15921410
1411+ ###Programming Skills II
1412+
1413+ ####Day 1
1414+
1415+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1416+ |-|-|-|-|-|-
1417+
1418+ ####Day 2
1419+
1420+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1421+ |-|-|-|-|-|-
1422+
1423+ ####Day 3
1424+
1425+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1426+ |-|-|-|-|-|-
1427+
1428+ ####Day 4
1429+
1430+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1431+ |-|-|-|-|-|-
1432+
1433+ ####Day 5
1434+
1435+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1436+ |-|-|-|-|-|-
1437+
1438+ ####Day 6
1439+
1440+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1441+ |-|-|-|-|-|-
1442+ | 0739 |[ Daily Temperatures] ( src/main/cpp/g0701_0800/s0739_daily_temperatures/Solution.cpp ) | Medium | Top_100_Liked_Questions, Array, Stack, Monotonic_Stack, LeetCode_75_Monotonic_Stack, Big_O_Time_O(n)_ Space_O(n) | 103 | 91.31
1443+
1444+ ####Day 7
1445+
1446+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1447+ |-|-|-|-|-|-
1448+ | 0048 |[ Rotate Image] ( src/main/cpp/g0001_0100/s0048_rotate_image/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Matrix, Big_O_Time_O(n^2)_ Space_O(1) | 0 | 100.00
1449+
1450+ ####Day 8
1451+
1452+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1453+ |-|-|-|-|-|-
1454+
1455+ ####Day 9
1456+
1457+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1458+ |-|-|-|-|-|-
1459+
1460+ ####Day 10
1461+
1462+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1463+ |-|-|-|-|-|-
1464+
1465+ ####Day 11
1466+
1467+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1468+ |-|-|-|-|-|-
1469+ | 0049 |[ Group Anagrams] ( src/main/cpp/g0001_0100/s0049_group_anagrams/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, String, Hash_Table, Sorting, Big_O_Time_O(n\* k_log_k)_ Space_O(n) | 18 | 96.16
1470+
1471+ ####Day 12
1472+
1473+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1474+ |-|-|-|-|-|-
1475+ | 0438 |[ Find All Anagrams in a String] ( src/main/cpp/g0401_0500/s0438_find_all_anagrams_in_a_string/Solution.cpp ) | Medium | Top_100_Liked_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n+m)_ Space_O(1) | 0 | 100.00
1476+
1477+ ####Day 13
1478+
1479+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1480+ |-|-|-|-|-|-
1481+
1482+ ####Day 14
1483+
1484+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1485+ |-|-|-|-|-|-
1486+ | 0138 |[ Copy List with Random Pointer] ( src/main/cpp/g0101_0200/s0138_copy_list_with_random_pointer/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_ Space_O(N) | 5 | 65.69
1487+
1488+ ####Day 15
1489+
1490+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1491+ |-|-|-|-|-|-
1492+ | 0002 |[ Add Two Numbers] ( src/main/cpp/g0001_0100/s0002_add_two_numbers/Solution.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_ Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 16 | 82.17
1493+
1494+ ####Day 16
1495+
1496+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1497+ |-|-|-|-|-|-
1498+
1499+ ####Day 17
1500+
1501+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1502+ |-|-|-|-|-|-
1503+
1504+ ####Day 18
1505+
1506+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1507+ |-|-|-|-|-|-
1508+ | 0155 |[ Min Stack] ( src/main/cpp/g0101_0200/s0155_min_stack/MinStack.cpp ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Stack, Design, Big_O_Time_O(1)_ Space_O(N) | 10 | 96.74
1509+
1510+ ####Day 19
1511+
1512+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1513+ |-|-|-|-|-|-
1514+
1515+ ####Day 20
1516+
1517+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1518+ |-|-|-|-|-|-
1519+
1520+ ###Graph Theory I
1521+
1522+ ####Day 1 Matrix Related Problems
1523+
1524+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1525+ |-|-|-|-|-|-
1526+ | 0200 |[ Number of Islands] ( src/main/cpp/g0101_0200/s0200_number_of_islands/Solution.cpp ) | 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) | 19 | 97.48
1527+
1528+ ####Day 2 Matrix Related Problems
1529+
1530+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1531+ |-|-|-|-|-|-
1532+
1533+ ####Day 3 Matrix Related Problems
1534+
1535+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1536+ |-|-|-|-|-|-
1537+
1538+ ####Day 4 Matrix Related Problems
1539+
1540+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1541+ |-|-|-|-|-|-
1542+
1543+ ####Day 5 Matrix Related Problems
1544+
1545+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1546+ |-|-|-|-|-|-
1547+
1548+ ####Day 6 Matrix Related Problems
1549+
1550+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1551+ |-|-|-|-|-|-
1552+
1553+ ####Day 7 Standard Traversal
1554+
1555+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1556+ |-|-|-|-|-|-
1557+
1558+ ####Day 8 Standard Traversal
1559+
1560+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1561+ |-|-|-|-|-|-
1562+
1563+ ####Day 9 Standard Traversal
1564+
1565+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1566+ |-|-|-|-|-|-
1567+
1568+ ####Day 10 Standard Traversal
1569+
1570+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1571+ |-|-|-|-|-|-
1572+
1573+ ####Day 11 Breadth First Search
1574+
1575+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1576+ |-|-|-|-|-|-
1577+
1578+ ####Day 12 Breadth First Search
1579+
1580+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1581+ |-|-|-|-|-|-
1582+
1583+ ####Day 13 Graph Theory
1584+
1585+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1586+ |-|-|-|-|-|-
1587+
1588+ ####Day 14 Graph Theory
1589+
1590+ |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- --> |<!-- -->
1591+ |-|-|-|-|-|-
1592+
15931593##Algorithms
15941594
15951595| # | Title | Difficulty | Tag | Time, ms | Time, %