Skip to content

Commit d6c4f4e

Browse files
javadevjavadev
committed
Updated readme
1 parent 5d820e8 commit d6c4f4e

File tree

1 file changed

+84
-84
lines changed

1 file changed

+84
-84
lines changed

‎README.md

+84-84
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,6 @@
22
[![](https://img.shields.io/github/forks/LeetCode-in-TypeScript/LeetCode-in-TypeScript?label=Fork%20me%20on%20GitHub%20&style=flat-square)](https://github.com/LeetCode-in-TypeScript/LeetCode-in-TypeScript/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-
* [Algorithm I](#algorithm-i)
65
* [Algorithm II](#algorithm-ii)
76
* [Binary Search I](#binary-search-i)
87
* [Binary Search II](#binary-search-ii)
@@ -16,89 +15,7 @@
1615
* [Udemy](#udemy)
1716
* [Data Structure I](#data-structure-i)
1817
* [Data Structure II](#data-structure-ii)
19-
20-
### Algorithm I
21-
22-
#### Day 1 Binary Search
23-
24-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
25-
|-|-|-|-|-|-
26-
| 0035 |[Search Insert Position](src/main/ts/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 51 | 80.95
27-
28-
#### Day 2 Two Pointers
29-
30-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
31-
|-|-|-|-|-|-
32-
| 0189 |[Rotate Array](src/main/ts/g0101_0200/s0189_rotate_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 75 | 97.25
33-
34-
#### Day 3 Two Pointers
35-
36-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
37-
|-|-|-|-|-|-
38-
| 0283 |[Move Zeroes](src/main/ts/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 71 | 91.63
39-
40-
#### Day 4 Two Pointers
41-
42-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
43-
|-|-|-|-|-|-
44-
45-
#### Day 5 Two Pointers
46-
47-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
48-
|-|-|-|-|-|-
49-
| 0019 |[Remove Nth Node From End of List](src/main/ts/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) | 54 | 87.87
50-
51-
#### Day 6 Sliding Window
52-
53-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
54-
|-|-|-|-|-|-
55-
| 0003 |[Longest Substring Without Repeating Characters](src/main/ts/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) | 65 | 90.77
56-
57-
#### Day 7 Breadth First Search Depth First Search
58-
59-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
60-
|-|-|-|-|-|-
61-
62-
#### Day 8 Breadth First Search Depth First Search
63-
64-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
65-
|-|-|-|-|-|-
66-
67-
#### Day 9 Breadth First Search Depth First Search
68-
69-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
70-
|-|-|-|-|-|-
71-
72-
#### Day 10 Recursion Backtracking
73-
74-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
75-
|-|-|-|-|-|-
76-
| 0021 |[Merge Two Sorted Lists](src/main/ts/g0001_0100/s0021_merge_two_sorted_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 59 | 86.77
77-
| 0206 |[Reverse Linked List](src/main/ts/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 51 | 92.87
78-
79-
#### Day 11 Recursion Backtracking
80-
81-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
82-
|-|-|-|-|-|-
83-
| 0046 |[Permutations](src/main/ts/g0001_0100/s0046_permutations)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 56 | 96.26
84-
85-
#### Day 12 Dynamic Programming
86-
87-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
88-
|-|-|-|-|-|-
89-
| 0070 |[Climbing Stairs](src/main/ts/g0001_0100/s0070_climbing_stairs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 44 | 94.58
90-
| 0198 |[House Robber](src/main/ts/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 51 | 77.29
91-
92-
#### Day 13 Bit Manipulation
93-
94-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
95-
|-|-|-|-|-|-
96-
97-
#### Day 14 Bit Manipulation
98-
99-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
100-
|-|-|-|-|-|-
101-
| 0136 |[Single Number](src/main/ts/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 56 | 85.48
18+
* [Algorithm I](#algorithm-i)
10219

10320
### Algorithm II
10421

@@ -1398,6 +1315,89 @@
13981315
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13991316
|-|-|-|-|-|-
14001317

1318+
### Algorithm I
1319+
1320+
#### Day 1 Binary Search
1321+
1322+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1323+
|-|-|-|-|-|-
1324+
| 0035 |[Search Insert Position](src/main/ts/g0001_0100/s0035_search_insert_position)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 51 | 80.95
1325+
1326+
#### Day 2 Two Pointers
1327+
1328+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1329+
|-|-|-|-|-|-
1330+
| 0189 |[Rotate Array](src/main/ts/g0101_0200/s0189_rotate_array)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 75 | 97.25
1331+
1332+
#### Day 3 Two Pointers
1333+
1334+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1335+
|-|-|-|-|-|-
1336+
| 0283 |[Move Zeroes](src/main/ts/g0201_0300/s0283_move_zeroes)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 71 | 91.63
1337+
1338+
#### Day 4 Two Pointers
1339+
1340+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1341+
|-|-|-|-|-|-
1342+
1343+
#### Day 5 Two Pointers
1344+
1345+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1346+
|-|-|-|-|-|-
1347+
| 0019 |[Remove Nth Node From End of List](src/main/ts/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) | 54 | 87.87
1348+
1349+
#### Day 6 Sliding Window
1350+
1351+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1352+
|-|-|-|-|-|-
1353+
| 0003 |[Longest Substring Without Repeating Characters](src/main/ts/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) | 65 | 90.77
1354+
1355+
#### Day 7 Breadth First Search Depth First Search
1356+
1357+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1358+
|-|-|-|-|-|-
1359+
1360+
#### Day 8 Breadth First Search Depth First Search
1361+
1362+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1363+
|-|-|-|-|-|-
1364+
1365+
#### Day 9 Breadth First Search Depth First Search
1366+
1367+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1368+
|-|-|-|-|-|-
1369+
1370+
#### Day 10 Recursion Backtracking
1371+
1372+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1373+
|-|-|-|-|-|-
1374+
| 0021 |[Merge Two Sorted Lists](src/main/ts/g0001_0100/s0021_merge_two_sorted_lists)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 59 | 86.77
1375+
| 0206 |[Reverse Linked List](src/main/ts/g0201_0300/s0206_reverse_linked_list)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 51 | 92.87
1376+
1377+
#### Day 11 Recursion Backtracking
1378+
1379+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1380+
|-|-|-|-|-|-
1381+
| 0046 |[Permutations](src/main/ts/g0001_0100/s0046_permutations)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 56 | 96.26
1382+
1383+
#### Day 12 Dynamic Programming
1384+
1385+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1386+
|-|-|-|-|-|-
1387+
| 0070 |[Climbing Stairs](src/main/ts/g0001_0100/s0070_climbing_stairs)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 44 | 94.58
1388+
| 0198 |[House Robber](src/main/ts/g0101_0200/s0198_house_robber)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 51 | 77.29
1389+
1390+
#### Day 13 Bit Manipulation
1391+
1392+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1393+
|-|-|-|-|-|-
1394+
1395+
#### Day 14 Bit Manipulation
1396+
1397+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1398+
|-|-|-|-|-|-
1399+
| 0136 |[Single Number](src/main/ts/g0101_0200/s0136_single_number)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 56 | 85.48
1400+
14011401
## Algorithms
14021402

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

0 commit comments

Comments
 (0)