Skip to content

Commit ebb2e7d

Browse files
javadevjavadev
authored
Updated readme
1 parent 32be484 commit ebb2e7d

File tree

2 files changed

+108
-106
lines changed

2 files changed

+108
-106
lines changed

‎.gitignore

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
.idea/
2+
*.iml

‎README.md

Lines changed: 106 additions & 106 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,6 @@ C#-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)
@@ -26,111 +25,7 @@ C#-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](LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 80 | 89.11
47-
48-
#### Day 4
49-
50-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
51-
|-|-|-|-|-|-
52-
53-
#### Day 5
54-
55-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
56-
|-|-|-|-|-|-
57-
| 0287 |[Find the Duplicate Number](LeetCodeNet/G0201_0300/S0287_find_the_duplicate_number/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 257 | 30.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](LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 142 | 60.76
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

@@ -1592,6 +1487,111 @@ C#-based LeetCode algorithm problem solutions, regularly updated.
15921487
|-|-|-|-|-|-
15931488
| 0153 |[Find Minimum in Rotated Sorted Array](LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 64 | 88.59
15941489

1490+
### Binary Search II
1491+
1492+
#### Day 1
1493+
1494+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1495+
|-|-|-|-|-|-
1496+
1497+
#### Day 2
1498+
1499+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1500+
|-|-|-|-|-|-
1501+
1502+
#### Day 3
1503+
1504+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1505+
|-|-|-|-|-|-
1506+
| 0300 |[Longest Increasing Subsequence](LeetCodeNet/G0201_0300/S0300_longest_increasing_subsequence/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 80 | 89.11
1507+
1508+
#### Day 4
1509+
1510+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1511+
|-|-|-|-|-|-
1512+
1513+
#### Day 5
1514+
1515+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1516+
|-|-|-|-|-|-
1517+
| 0287 |[Find the Duplicate Number](LeetCodeNet/G0201_0300/S0287_find_the_duplicate_number/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 257 | 30.11
1518+
1519+
#### Day 6
1520+
1521+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1522+
|-|-|-|-|-|-
1523+
1524+
#### Day 7
1525+
1526+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1527+
|-|-|-|-|-|-
1528+
1529+
#### Day 8
1530+
1531+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1532+
|-|-|-|-|-|-
1533+
| 0240 |[Search a 2D Matrix II](LeetCodeNet/G0201_0300/S0240_search_a_2d_matrix_ii/Solution.cs)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 142 | 60.76
1534+
1535+
#### Day 9
1536+
1537+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1538+
|-|-|-|-|-|-
1539+
1540+
#### Day 10
1541+
1542+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1543+
|-|-|-|-|-|-
1544+
1545+
#### Day 11
1546+
1547+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1548+
|-|-|-|-|-|-
1549+
1550+
#### Day 12
1551+
1552+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1553+
|-|-|-|-|-|-
1554+
1555+
#### Day 13
1556+
1557+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1558+
|-|-|-|-|-|-
1559+
1560+
#### Day 14
1561+
1562+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1563+
|-|-|-|-|-|-
1564+
1565+
#### Day 15
1566+
1567+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1568+
|-|-|-|-|-|-
1569+
1570+
#### Day 16
1571+
1572+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1573+
|-|-|-|-|-|-
1574+
1575+
#### Day 17
1576+
1577+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1578+
|-|-|-|-|-|-
1579+
1580+
#### Day 18
1581+
1582+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1583+
|-|-|-|-|-|-
1584+
1585+
#### Day 19
1586+
1587+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1588+
|-|-|-|-|-|-
1589+
1590+
#### Day 20
1591+
1592+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1593+
|-|-|-|-|-|-
1594+
15951595
## Algorithms
15961596

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

0 commit comments

Comments
 (0)