Movatterモバイル変換

[0]ホーム
URL:

Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

 Sign up
Appearance settings

Commit72c01ea

Browse files
authored
Updated readme
1 parentda284d4 commit72c01ea

File tree

1 file changed

+106
-106
lines changed

1 file changed

+106
-106
lines changed

‎README.md

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

13429
###Dynamic Programming I
13530

@@ -1407,6 +1302,111 @@ Ruby-based LeetCode algorithm problem solutions, regularly updated.
14071302
|-|-|-|-|-|-
14081303
| 0153 |[Find Minimum in Rotated Sorted Array](src/main/ruby/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.rb)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 58 | 78.74
14091304

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

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

0 commit comments

Comments
 (0)
[8]ページ先頭
©2009-2025 Movatter.jp