Skip to content

Commit 0e9bea2

Browse files
javadevjavadev
authored
Updated readme
1 parent 241fdc1 commit 0e9bea2

File tree

1 file changed

+78
-78
lines changed

1 file changed

+78
-78
lines changed

‎README.md‎

Lines changed: 78 additions & 78 deletions
Original file line numberDiff line numberDiff line change
@@ -32,7 +32,6 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
3232
> ["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)
3333
3434
##
35-
* [Algorithm I](#algorithm-i)
3635
* [Algorithm II](#algorithm-ii)
3736
* [Binary Search I](#binary-search-i)
3837
* [Binary Search II](#binary-search-ii)
@@ -46,83 +45,7 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
4645
* [Udemy](#udemy)
4746
* [Data Structure I](#data-structure-i)
4847
* [Data Structure II](#data-structure-ii)
49-
50-
### Algorithm I
51-
52-
#### Day 1 Binary Search
53-
54-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
55-
|-|-|-|-|-|-
56-
| 0035 |[Search Insert Position](src/main/scala/g0001_0100/s0035_search_insert_position/Solution.scala)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 466 | 87.04
57-
58-
#### Day 2 Two Pointers
59-
60-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
61-
|-|-|-|-|-|-
62-
63-
#### Day 3 Two Pointers
64-
65-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
66-
|-|-|-|-|-|-
67-
68-
#### Day 4 Two Pointers
69-
70-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
71-
|-|-|-|-|-|-
72-
73-
#### Day 5 Two Pointers
74-
75-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
76-
|-|-|-|-|-|-
77-
| 0019 |[Remove Nth Node From End of List](src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 492 | 52.63
78-
79-
#### Day 6 Sliding Window
80-
81-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
82-
|-|-|-|-|-|-
83-
| 0003 |[Longest Substring Without Repeating Characters](src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 482 | 96.91
84-
85-
#### Day 7 Breadth First Search Depth First Search
86-
87-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
88-
|-|-|-|-|-|-
89-
90-
#### Day 8 Breadth First Search Depth First Search
91-
92-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
93-
|-|-|-|-|-|-
94-
95-
#### Day 9 Breadth First Search Depth First Search
96-
97-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
98-
|-|-|-|-|-|-
99-
100-
#### Day 10 Recursion Backtracking
101-
102-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
103-
|-|-|-|-|-|-
104-
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
105-
106-
#### Day 11 Recursion Backtracking
107-
108-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
109-
|-|-|-|-|-|-
110-
| 0046 |[Permutations](src/main/scala/g0001_0100/s0046_permutations/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 470 | 92.31
111-
112-
#### Day 12 Dynamic Programming
113-
114-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
115-
|-|-|-|-|-|-
116-
117-
#### Day 13 Bit Manipulation
118-
119-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
120-
|-|-|-|-|-|-
121-
122-
#### Day 14 Bit Manipulation
123-
124-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
125-
|-|-|-|-|-|-
48+
* [Algorithm I](#algorithm-i)
12649

12750
### Algorithm II
12851

@@ -1295,6 +1218,83 @@ implementation 'com.github.javadev:leetcode-in-scala:1.0'
12951218
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12961219
|-|-|-|-|-|-
12971220

1221+
### Algorithm I
1222+
1223+
#### Day 1 Binary Search
1224+
1225+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1226+
|-|-|-|-|-|-
1227+
| 0035 |[Search Insert Position](src/main/scala/g0001_0100/s0035_search_insert_position/Solution.scala)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 466 | 87.04
1228+
1229+
#### Day 2 Two Pointers
1230+
1231+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1232+
|-|-|-|-|-|-
1233+
1234+
#### Day 3 Two Pointers
1235+
1236+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1237+
|-|-|-|-|-|-
1238+
1239+
#### Day 4 Two Pointers
1240+
1241+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1242+
|-|-|-|-|-|-
1243+
1244+
#### Day 5 Two Pointers
1245+
1246+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1247+
|-|-|-|-|-|-
1248+
| 0019 |[Remove Nth Node From End of List](src/main/scala/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 492 | 52.63
1249+
1250+
#### Day 6 Sliding Window
1251+
1252+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1253+
|-|-|-|-|-|-
1254+
| 0003 |[Longest Substring Without Repeating Characters](src/main/scala/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(n)_Space_O(1) | 482 | 96.91
1255+
1256+
#### Day 7 Breadth First Search Depth First Search
1257+
1258+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1259+
|-|-|-|-|-|-
1260+
1261+
#### Day 8 Breadth First Search Depth First Search
1262+
1263+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1264+
|-|-|-|-|-|-
1265+
1266+
#### Day 9 Breadth First Search Depth First Search
1267+
1268+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1269+
|-|-|-|-|-|-
1270+
1271+
#### Day 10 Recursion Backtracking
1272+
1273+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1274+
|-|-|-|-|-|-
1275+
| 0021 |[Merge Two Sorted Lists](src/main/scala/g0001_0100/s0021_merge_two_sorted_lists/Solution.scala)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 480 | 89.72
1276+
1277+
#### Day 11 Recursion Backtracking
1278+
1279+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1280+
|-|-|-|-|-|-
1281+
| 0046 |[Permutations](src/main/scala/g0001_0100/s0046_permutations/Solution.scala)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 470 | 92.31
1282+
1283+
#### Day 12 Dynamic Programming
1284+
1285+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1286+
|-|-|-|-|-|-
1287+
1288+
#### Day 13 Bit Manipulation
1289+
1290+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1291+
|-|-|-|-|-|-
1292+
1293+
#### Day 14 Bit Manipulation
1294+
1295+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1296+
|-|-|-|-|-|-
1297+
12981298
## Algorithms
12991299

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

0 commit comments

Comments
 (0)