Skip to content

Commit 7acf927

Browse files
javadevjavadev
authored
Updated readme
1 parent 8abb3a0 commit 7acf927

File tree

1 file changed

+109
-109
lines changed

1 file changed

+109
-109
lines changed

‎README.md

Lines changed: 109 additions & 109 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,6 @@ Go-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,114 +25,7 @@ Go-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-
| 0209 |[Minimum Size Subarray Sum](src/main/go/g0201_0300/s0209_minimum_size_subarray_sum/solution.go)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00
37-
38-
#### Day 2
39-
40-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
41-
|-|-|-|-|-|-
42-
43-
#### Day 3
44-
45-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
46-
|-|-|-|-|-|-
47-
| 0300 |[Longest Increasing Subsequence](src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00
48-
49-
#### Day 4
50-
51-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
52-
|-|-|-|-|-|-
53-
54-
#### Day 5
55-
56-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
57-
|-|-|-|-|-|-
58-
| 0287 |[Find the Duplicate Number](src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 1 | 90.38
59-
60-
#### Day 6
61-
62-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
63-
|-|-|-|-|-|-
64-
65-
#### Day 7
66-
67-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
68-
|-|-|-|-|-|-
69-
70-
#### Day 8
71-
72-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
73-
|-|-|-|-|-|-
74-
| 0240 |[Search a 2D Matrix II](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 9 | 98.86
75-
76-
#### Day 9
77-
78-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
79-
|-|-|-|-|-|-
80-
81-
#### Day 10
82-
83-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
84-
|-|-|-|-|-|-
85-
| 0222 |[Count Complete Tree Nodes](src/main/go/g0201_0300/s0222_count_complete_tree_nodes/solution.go)| Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 100.00
86-
87-
#### Day 11
88-
89-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
90-
|-|-|-|-|-|-
91-
92-
#### Day 12
93-
94-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
95-
|-|-|-|-|-|-
96-
| 0162 |[Find Peak Element](src/main/go/g0101_0200/s0162_find_peak_element/solution.go)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00
97-
98-
#### Day 13
99-
100-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
101-
|-|-|-|-|-|-
102-
103-
#### Day 14
104-
105-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
106-
|-|-|-|-|-|-
107-
108-
#### Day 15
109-
110-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
111-
|-|-|-|-|-|-
112-
113-
#### Day 16
114-
115-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
116-
|-|-|-|-|-|-
117-
118-
#### Day 17
119-
120-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
121-
|-|-|-|-|-|-
122-
123-
#### Day 18
124-
125-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
126-
|-|-|-|-|-|-
127-
128-
#### Day 19
129-
130-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
131-
|-|-|-|-|-|-
132-
133-
#### Day 20
134-
135-
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
136-
|-|-|-|-|-|-
28+
* [Binary Search II](#binary-search-ii)
13729

13830
### Dynamic Programming I
13931

@@ -1755,6 +1647,114 @@ Go-based LeetCode algorithm problem solutions, regularly updated.
17551647
|-|-|-|-|-|-
17561648
| 0153 |[Find Minimum in Rotated Sorted Array](src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/solution.go)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00
17571649

1650+
### Binary Search II
1651+
1652+
#### Day 1
1653+
1654+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1655+
|-|-|-|-|-|-
1656+
| 0209 |[Minimum Size Subarray Sum](src/main/go/g0201_0300/s0209_minimum_size_subarray_sum/solution.go)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00
1657+
1658+
#### Day 2
1659+
1660+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1661+
|-|-|-|-|-|-
1662+
1663+
#### Day 3
1664+
1665+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1666+
|-|-|-|-|-|-
1667+
| 0300 |[Longest Increasing Subsequence](src/main/go/g0201_0300/s0300_longest_increasing_subsequence/solution.go)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00
1668+
1669+
#### Day 4
1670+
1671+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1672+
|-|-|-|-|-|-
1673+
1674+
#### Day 5
1675+
1676+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1677+
|-|-|-|-|-|-
1678+
| 0287 |[Find the Duplicate Number](src/main/go/g0201_0300/s0287_find_the_duplicate_number/solution.go)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 1 | 90.38
1679+
1680+
#### Day 6
1681+
1682+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1683+
|-|-|-|-|-|-
1684+
1685+
#### Day 7
1686+
1687+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1688+
|-|-|-|-|-|-
1689+
1690+
#### Day 8
1691+
1692+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1693+
|-|-|-|-|-|-
1694+
| 0240 |[Search a 2D Matrix II](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii/solution.go)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 9 | 98.86
1695+
1696+
#### Day 9
1697+
1698+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1699+
|-|-|-|-|-|-
1700+
1701+
#### Day 10
1702+
1703+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1704+
|-|-|-|-|-|-
1705+
| 0222 |[Count Complete Tree Nodes](src/main/go/g0201_0300/s0222_count_complete_tree_nodes/solution.go)| Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 100.00
1706+
1707+
#### Day 11
1708+
1709+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1710+
|-|-|-|-|-|-
1711+
1712+
#### Day 12
1713+
1714+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1715+
|-|-|-|-|-|-
1716+
| 0162 |[Find Peak Element](src/main/go/g0101_0200/s0162_find_peak_element/solution.go)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00
1717+
1718+
#### Day 13
1719+
1720+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1721+
|-|-|-|-|-|-
1722+
1723+
#### Day 14
1724+
1725+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1726+
|-|-|-|-|-|-
1727+
1728+
#### Day 15
1729+
1730+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1731+
|-|-|-|-|-|-
1732+
1733+
#### Day 16
1734+
1735+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1736+
|-|-|-|-|-|-
1737+
1738+
#### Day 17
1739+
1740+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1741+
|-|-|-|-|-|-
1742+
1743+
#### Day 18
1744+
1745+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1746+
|-|-|-|-|-|-
1747+
1748+
#### Day 19
1749+
1750+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1751+
|-|-|-|-|-|-
1752+
1753+
#### Day 20
1754+
1755+
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
1756+
|-|-|-|-|-|-
1757+
17581758
## Algorithms
17591759

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

0 commit comments

Comments
 (0)