|
6 | 6 | [](https://github.com/LeetCode-in-Go/LeetCode-in-Go/fork)
|
7 | 7 | > ["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)
|
8 | 8 |
|
9 |
| -* [Binary Search II](#binary-search-ii) |
10 | 9 | * [Dynamic Programming I](#dynamic-programming-i)
|
11 | 10 | * [Programming Skills I](#programming-skills-i)
|
12 | 11 | * [Programming Skills II](#programming-skills-ii)
|
|
21 | 20 | * [Algorithm I](#algorithm-i)
|
22 | 21 | * [Algorithm II](#algorithm-ii)
|
23 | 22 | * [Binary Search I](#binary-search-i)
|
24 |
| - |
25 |
| -### Binary Search II |
26 |
| - |
27 |
| -#### Day 1 |
28 |
| - |
29 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
30 |
| -|-|-|-|-|-|- |
31 |
| -| 0209 |[Minimum Size Subarray Sum](src/main/go/g0201_0300/s0209_minimum_size_subarray_sum)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00 |
32 |
| - |
33 |
| -#### Day 2 |
34 |
| - |
35 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
36 |
| -|-|-|-|-|-|- |
37 |
| - |
38 |
| -#### Day 3 |
39 |
| - |
40 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
41 |
| -|-|-|-|-|-|- |
42 |
| -| 0300 |[Longest Increasing Subsequence](src/main/go/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00 |
43 |
| - |
44 |
| -#### Day 4 |
45 |
| - |
46 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
47 |
| -|-|-|-|-|-|- |
48 |
| - |
49 |
| -#### Day 5 |
50 |
| - |
51 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
52 |
| -|-|-|-|-|-|- |
53 |
| -| 0287 |[Find the Duplicate Number](src/main/go/g0201_0300/s0287_find_the_duplicate_number)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 1 | 90.38 |
54 |
| - |
55 |
| -#### Day 6 |
56 |
| - |
57 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
58 |
| -|-|-|-|-|-|- |
59 |
| - |
60 |
| -#### Day 7 |
61 |
| - |
62 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
63 |
| -|-|-|-|-|-|- |
64 |
| - |
65 |
| -#### Day 8 |
66 |
| - |
67 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
68 |
| -|-|-|-|-|-|- |
69 |
| -| 0240 |[Search a 2D Matrix II](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 9 | 98.86 |
70 |
| - |
71 |
| -#### Day 9 |
72 |
| - |
73 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
74 |
| -|-|-|-|-|-|- |
75 |
| - |
76 |
| -#### Day 10 |
77 |
| - |
78 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
79 |
| -|-|-|-|-|-|- |
80 |
| -| 0222 |[Count Complete Tree Nodes](src/main/go/g0201_0300/s0222_count_complete_tree_nodes)| Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 100.00 |
81 |
| - |
82 |
| -#### Day 11 |
83 |
| - |
84 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
85 |
| -|-|-|-|-|-|- |
86 |
| - |
87 |
| -#### Day 12 |
88 |
| - |
89 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
90 |
| -|-|-|-|-|-|- |
91 |
| -| 0162 |[Find Peak Element](src/main/go/g0101_0200/s0162_find_peak_element)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00 |
92 |
| - |
93 |
| -#### Day 13 |
94 |
| - |
95 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
96 |
| -|-|-|-|-|-|- |
97 |
| - |
98 |
| -#### Day 14 |
99 |
| - |
100 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
101 |
| -|-|-|-|-|-|- |
102 |
| - |
103 |
| -#### Day 15 |
104 |
| - |
105 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
106 |
| -|-|-|-|-|-|- |
107 |
| - |
108 |
| -#### Day 16 |
109 |
| - |
110 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
111 |
| -|-|-|-|-|-|- |
112 |
| - |
113 |
| -#### Day 17 |
114 |
| - |
115 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
116 |
| -|-|-|-|-|-|- |
117 |
| - |
118 |
| -#### Day 18 |
119 |
| - |
120 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
121 |
| -|-|-|-|-|-|- |
122 |
| - |
123 |
| -#### Day 19 |
124 |
| - |
125 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
126 |
| -|-|-|-|-|-|- |
127 |
| - |
128 |
| -#### Day 20 |
129 |
| - |
130 |
| -| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
131 |
| -|-|-|-|-|-|- |
| 23 | +* [Binary Search II](#binary-search-ii) |
132 | 24 |
|
133 | 25 | ### Dynamic Programming I
|
134 | 26 |
|
|
1750 | 1642 | |-|-|-|-|-|-
|
1751 | 1643 | | 0153 |[Find Minimum in Rotated Sorted Array](src/main/go/g0101_0200/s0153_find_minimum_in_rotated_sorted_array)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00
|
1752 | 1644 |
|
| 1645 | +### Binary Search II |
| 1646 | + |
| 1647 | +#### Day 1 |
| 1648 | + |
| 1649 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1650 | +|-|-|-|-|-|- |
| 1651 | +| 0209 |[Minimum Size Subarray Sum](src/main/go/g0201_0300/s0209_minimum_size_subarray_sum)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 0 | 100.00 |
| 1652 | + |
| 1653 | +#### Day 2 |
| 1654 | + |
| 1655 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1656 | +|-|-|-|-|-|- |
| 1657 | + |
| 1658 | +#### Day 3 |
| 1659 | + |
| 1660 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1661 | +|-|-|-|-|-|- |
| 1662 | +| 0300 |[Longest Increasing Subsequence](src/main/go/g0201_0300/s0300_longest_increasing_subsequence)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 0 | 100.00 |
| 1663 | + |
| 1664 | +#### Day 4 |
| 1665 | + |
| 1666 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1667 | +|-|-|-|-|-|- |
| 1668 | + |
| 1669 | +#### Day 5 |
| 1670 | + |
| 1671 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1672 | +|-|-|-|-|-|- |
| 1673 | +| 0287 |[Find the Duplicate Number](src/main/go/g0201_0300/s0287_find_the_duplicate_number)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 1 | 90.38 |
| 1674 | + |
| 1675 | +#### Day 6 |
| 1676 | + |
| 1677 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1678 | +|-|-|-|-|-|- |
| 1679 | + |
| 1680 | +#### Day 7 |
| 1681 | + |
| 1682 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1683 | +|-|-|-|-|-|- |
| 1684 | + |
| 1685 | +#### Day 8 |
| 1686 | + |
| 1687 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1688 | +|-|-|-|-|-|- |
| 1689 | +| 0240 |[Search a 2D Matrix II](src/main/go/g0201_0300/s0240_search_a_2d_matrix_ii)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 9 | 98.86 |
| 1690 | + |
| 1691 | +#### Day 9 |
| 1692 | + |
| 1693 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1694 | +|-|-|-|-|-|- |
| 1695 | + |
| 1696 | +#### Day 10 |
| 1697 | + |
| 1698 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1699 | +|-|-|-|-|-|- |
| 1700 | +| 0222 |[Count Complete Tree Nodes](src/main/go/g0201_0300/s0222_count_complete_tree_nodes)| Easy | Depth_First_Search, Tree, Binary_Search, Binary_Tree | 0 | 100.00 |
| 1701 | + |
| 1702 | +#### Day 11 |
| 1703 | + |
| 1704 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1705 | +|-|-|-|-|-|- |
| 1706 | + |
| 1707 | +#### Day 12 |
| 1708 | + |
| 1709 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1710 | +|-|-|-|-|-|- |
| 1711 | +| 0162 |[Find Peak Element](src/main/go/g0101_0200/s0162_find_peak_element)| Medium | Top_Interview_Questions, Array, Binary_Search, LeetCode_75_Binary_Search | 0 | 100.00 |
| 1712 | + |
| 1713 | +#### Day 13 |
| 1714 | + |
| 1715 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1716 | +|-|-|-|-|-|- |
| 1717 | + |
| 1718 | +#### Day 14 |
| 1719 | + |
| 1720 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1721 | +|-|-|-|-|-|- |
| 1722 | + |
| 1723 | +#### Day 15 |
| 1724 | + |
| 1725 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1726 | +|-|-|-|-|-|- |
| 1727 | + |
| 1728 | +#### Day 16 |
| 1729 | + |
| 1730 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1731 | +|-|-|-|-|-|- |
| 1732 | + |
| 1733 | +#### Day 17 |
| 1734 | + |
| 1735 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1736 | +|-|-|-|-|-|- |
| 1737 | + |
| 1738 | +#### Day 18 |
| 1739 | + |
| 1740 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1741 | +|-|-|-|-|-|- |
| 1742 | + |
| 1743 | +#### Day 19 |
| 1744 | + |
| 1745 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1746 | +|-|-|-|-|-|- |
| 1747 | + |
| 1748 | +#### Day 20 |
| 1749 | + |
| 1750 | +| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> |
| 1751 | +|-|-|-|-|-|- |
| 1752 | + |
1753 | 1753 | ## Algorithms
|
1754 | 1754 |
|
1755 | 1755 | | # | Title | Difficulty | Tag | Time, ms | Time, %
|
|
0 commit comments