Skip to content

Commit 1e68cc0

Browse files
javadevjavadev
authoredFeb 1, 2024
Updated readme
1 parent 51bdce5 commit 1e68cc0

File tree

1 file changed

+106
-106
lines changed

1 file changed

+106
-106
lines changed
 

‎README.md

+106-106
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,6 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
1212
> ["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)
1313
1414
##
15-
* [Binary Search II](#binary-search-ii)
1615
* [Dynamic Programming I](#dynamic-programming-i)
1716
* [Programming Skills I](#programming-skills-i)
1817
* [Programming Skills II](#programming-skills-ii)
@@ -26,111 +25,7 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
2625
* [Algorithm I](#algorithm-i)
2726
* [Algorithm II](#algorithm-ii)
2827
* [Binary Search I](#binary-search-i)
29-
30-
### Binary Search II
31-
32-
#### Day 1
33-
34-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
35-
|-|-|-|-|-|-
36-
37-
#### Day 2
38-
39-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
40-
|-|-|-|-|-|-
41-
42-
#### Day 3
43-
44-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
45-
|-|-|-|-|-|-
46-
| 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
47-
48-
#### Day 4
49-
50-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
51-
|-|-|-|-|-|-
52-
53-
#### Day 5
54-
55-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
56-
|-|-|-|-|-|-
57-
| 0287 |[Find the Duplicate Number](src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 60 | 98.11
58-
59-
#### Day 6
60-
61-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
62-
|-|-|-|-|-|-
63-
64-
#### Day 7
65-
66-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
67-
|-|-|-|-|-|-
68-
69-
#### Day 8
70-
71-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
72-
|-|-|-|-|-|-
73-
| 0240 |[Search a 2D Matrix II](src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 58 | 64.44
74-
75-
#### Day 9
76-
77-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
78-
|-|-|-|-|-|-
79-
80-
#### Day 10
81-
82-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
83-
|-|-|-|-|-|-
84-
85-
#### Day 11
86-
87-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
88-
|-|-|-|-|-|-
89-
90-
#### Day 12
91-
92-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
93-
|-|-|-|-|-|-
94-
95-
#### Day 13
96-
97-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
98-
|-|-|-|-|-|-
99-
100-
#### Day 14
101-
102-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
103-
|-|-|-|-|-|-
104-
105-
#### Day 15
106-
107-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
108-
|-|-|-|-|-|-
109-
110-
#### Day 16
111-
112-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
113-
|-|-|-|-|-|-
114-
115-
#### Day 17
116-
117-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
118-
|-|-|-|-|-|-
119-
120-
#### Day 18
121-
122-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
123-
|-|-|-|-|-|-
124-
125-
#### Day 19
126-
127-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
128-
|-|-|-|-|-|-
129-
130-
#### Day 20
131-
132-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
133-
|-|-|-|-|-|-
28+
* [Binary Search II](#binary-search-ii)
13429

13530
### Dynamic Programming I
13631

@@ -1408,6 +1303,111 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
14081303
|-|-|-|-|-|-
14091304
| 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
14101305

1306+
### Binary Search II
1307+
1308+
#### Day 1
1309+
1310+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1311+
|-|-|-|-|-|-
1312+
1313+
#### Day 2
1314+
1315+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1316+
|-|-|-|-|-|-
1317+
1318+
#### Day 3
1319+
1320+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1321+
|-|-|-|-|-|-
1322+
| 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
1323+
1324+
#### Day 4
1325+
1326+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1327+
|-|-|-|-|-|-
1328+
1329+
#### Day 5
1330+
1331+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1332+
|-|-|-|-|-|-
1333+
| 0287 |[Find the Duplicate Number](src/main/ts/g0201_0300/s0287_find_the_duplicate_number/solution.ts)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 60 | 98.11
1334+
1335+
#### Day 6
1336+
1337+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1338+
|-|-|-|-|-|-
1339+
1340+
#### Day 7
1341+
1342+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1343+
|-|-|-|-|-|-
1344+
1345+
#### Day 8
1346+
1347+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1348+
|-|-|-|-|-|-
1349+
| 0240 |[Search a 2D Matrix II](src/main/ts/g0201_0300/s0240_search_a_2d_matrix_ii/solution.ts)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 58 | 64.44
1350+
1351+
#### Day 9
1352+
1353+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1354+
|-|-|-|-|-|-
1355+
1356+
#### Day 10
1357+
1358+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1359+
|-|-|-|-|-|-
1360+
1361+
#### Day 11
1362+
1363+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1364+
|-|-|-|-|-|-
1365+
1366+
#### Day 12
1367+
1368+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1369+
|-|-|-|-|-|-
1370+
1371+
#### Day 13
1372+
1373+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1374+
|-|-|-|-|-|-
1375+
1376+
#### Day 14
1377+
1378+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1379+
|-|-|-|-|-|-
1380+
1381+
#### Day 15
1382+
1383+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1384+
|-|-|-|-|-|-
1385+
1386+
#### Day 16
1387+
1388+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1389+
|-|-|-|-|-|-
1390+
1391+
#### Day 17
1392+
1393+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1394+
|-|-|-|-|-|-
1395+
1396+
#### Day 18
1397+
1398+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1399+
|-|-|-|-|-|-
1400+
1401+
#### Day 19
1402+
1403+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1404+
|-|-|-|-|-|-
1405+
1406+
#### Day 20
1407+
1408+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1409+
|-|-|-|-|-|-
1410+
14111411
## Algorithms
14121412

14131413
| # | Title | Difficulty | Tag | Time, ms | Time, %

0 commit comments

Comments
 (0)