@@ -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
- * [ Binary Search I] ( #binary-search-i )
16
15
* [ Binary Search II] ( #binary-search-ii )
17
16
* [ Dynamic Programming I] ( #dynamic-programming-i )
18
17
* [ Programming Skills I] ( #programming-skills-i )
@@ -26,73 +25,7 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
26
25
* [ Data Structure II] ( #data-structure-ii )
27
26
* [ Algorithm I] ( #algorithm-i )
28
27
* [ Algorithm II] ( #algorithm-ii )
29
-
30
- ### Binary Search I
31
-
32
- #### Day 1
33
-
34
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
35
- |-|-|-|-|-|-
36
-
37
- #### Day 2
38
-
39
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
40
- |-|-|-|-|-|-
41
- | 0035 |[ Search Insert Position] ( src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts ) | Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_ Space_O(1) | 51 | 80.95
42
-
43
- #### Day 3
44
-
45
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
46
- |-|-|-|-|-|-
47
-
48
- #### Day 4
49
-
50
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
51
- |-|-|-|-|-|-
52
-
53
- #### Day 5
54
-
55
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
56
- |-|-|-|-|-|-
57
- | 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
58
-
59
- #### Day 6
60
-
61
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
62
- |-|-|-|-|-|-
63
-
64
- #### Day 7
65
-
66
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
67
- |-|-|-|-|-|-
68
-
69
- #### Day 8
70
-
71
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
72
- |-|-|-|-|-|-
73
- | 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
74
-
75
- #### Day 9
76
-
77
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
78
- |-|-|-|-|-|-
79
-
80
- #### Day 10
81
-
82
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
83
- |-|-|-|-|-|-
84
-
85
- #### Day 11
86
-
87
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
88
- |-|-|-|-|-|-
89
- | 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
90
-
91
- #### Day 12
92
-
93
- | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
94
- |-|-|-|-|-|-
95
- | 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
28
+ * [ Binary Search I] ( #binary-search-i )
96
29
97
30
### Binary Search II
98
31
@@ -1408,6 +1341,73 @@ TypeScript-based LeetCode algorithm problem solutions, regularly updated.
1408
1341
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1409
1342
|-|-|-|-|-|-
1410
1343
1344
+ ### Binary Search I
1345
+
1346
+ #### Day 1
1347
+
1348
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1349
+ |-|-|-|-|-|-
1350
+
1351
+ #### Day 2
1352
+
1353
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1354
+ |-|-|-|-|-|-
1355
+ | 0035 |[ Search Insert Position] ( src/main/ts/g0001_0100/s0035_search_insert_position/solution.ts ) | Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_ Space_O(1) | 51 | 80.95
1356
+
1357
+ #### Day 3
1358
+
1359
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1360
+ |-|-|-|-|-|-
1361
+
1362
+ #### Day 4
1363
+
1364
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1365
+ |-|-|-|-|-|-
1366
+
1367
+ #### Day 5
1368
+
1369
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1370
+ |-|-|-|-|-|-
1371
+ | 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
1372
+
1373
+ #### Day 6
1374
+
1375
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1376
+ |-|-|-|-|-|-
1377
+
1378
+ #### Day 7
1379
+
1380
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1381
+ |-|-|-|-|-|-
1382
+
1383
+ #### Day 8
1384
+
1385
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1386
+ |-|-|-|-|-|-
1387
+ | 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
1388
+
1389
+ #### Day 9
1390
+
1391
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1392
+ |-|-|-|-|-|-
1393
+
1394
+ #### Day 10
1395
+
1396
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1397
+ |-|-|-|-|-|-
1398
+
1399
+ #### Day 11
1400
+
1401
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1402
+ |-|-|-|-|-|-
1403
+ | 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
1404
+
1405
+ #### Day 12
1406
+
1407
+ | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1408
+ |-|-|-|-|-|-
1409
+ | 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
1410
+
1411
1411
## Algorithms
1412
1412
1413
1413
| # | Title | Difficulty | Tag | Time, ms | Time, %
0 commit comments