@@ -34,7 +34,6 @@ implementation 'com.github.javadev:leetcode-in-java:1.13'
3434> [ "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 )
3535
3636##
37- * [ Algorithm I] ( #algorithm-i )
3837* [ Algorithm II] ( #algorithm-ii )
3938* [ Binary Search I] ( #binary-search-i )
4039* [ Binary Search II] ( #binary-search-ii )
@@ -48,109 +47,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.13'
4847* [ Udemy] ( #udemy )
4948* [ Data Structure I] ( #data-structure-i )
5049* [ Data Structure II] ( #data-structure-ii )
51-
52- ### Algorithm I
53-
54- #### Day 1 Binary Search
55-
56- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
57- |-|-|-|-|-|-
58- | 0704 |[ Binary Search] ( src/main/java/g0701_0800/s0704_binary_search/Solution.java ) | Easy | Array, Binary_Search | 0 | 100.00
59- | 0278 |[ First Bad Version] ( src/main/java/g0201_0300/s0278_first_bad_version/Solution.java ) | Easy | Binary_Search, Interactive | 15 | 87.89
60- | 0035 |[ Search Insert Position] ( src/main/java/g0001_0100/s0035_search_insert_position/Solution.java ) | Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00
61-
62- #### Day 2 Two Pointers
63-
64- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
65- |-|-|-|-|-|-
66- | 0977 |[ Squares of a Sorted Array] ( src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java ) | Easy | Array, Sorting, Two_Pointers | 1 | 100.00
67- | 0189 |[ Rotate Array] ( src/main/java/g0101_0200/s0189_rotate_array/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers | 0 | 100.00
68-
69- #### Day 3 Two Pointers
70-
71- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
72- |-|-|-|-|-|-
73- | 0283 |[ Move Zeroes] ( src/main/java/g0201_0300/s0283_move_zeroes/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 2 | 79.54
74- | 0167 |[ Two Sum II - Input Array Is Sorted] ( src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java ) | Medium | Array, Binary_Search, Two_Pointers | 1 | 99.21
75-
76- #### Day 4 Two Pointers
77-
78- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
79- |-|-|-|-|-|-
80- | 0344 |[ Reverse String] ( src/main/java/g0301_0400/s0344_reverse_string/Solution.java ) | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 1 | 99.91
81- | 0557 |[ Reverse Words in a String III] ( src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java ) | Easy | String, Two_Pointers | 4 | 97.75
82-
83- #### Day 5 Two Pointers
84-
85- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
86- |-|-|-|-|-|-
87- | 0876 |[ Middle of the Linked List] ( src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java ) | Easy | Two_Pointers, Linked_List | 0 | 100.00
88- | 0019 |[ Remove Nth Node From End of List] ( src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List | 1 | 59.72
89-
90- #### Day 6 Sliding Window
91-
92- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
93- |-|-|-|-|-|-
94- | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 5 | 91.03
95- | 0567 |[ Permutation in String] ( src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java ) | Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 5 | 93.93
96-
97- #### Day 7 Breadth First Search Depth First Search
98-
99- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
100- |-|-|-|-|-|-
101- | 0733 |[ Flood Fill] ( src/main/java/g0701_0800/s0733_flood_fill/Solution.java ) | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
102- | 0695 |[ Max Area of Island] ( src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java ) | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 76.79
103-
104- #### Day 8 Breadth First Search Depth First Search
105-
106- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
107- |-|-|-|-|-|-
108- | 0617 |[ Merge Two Binary Trees] ( src/main/java/g0601_0700/s0617_merge_two_binary_trees/Solution.java ) | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 72.47
109- | 0116 |[ Populating Next Right Pointers in Each Node] ( src/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node/Solution.java ) | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 0 | 100.00
110-
111- #### Day 9 Breadth First Search Depth First Search
112-
113- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
114- |-|-|-|-|-|-
115- | 0542 |[ 01 Matrix] ( src/main/java/g0501_0600/s0542_01_matrix/Solution.java ) | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83
116- | 0994 |[ Rotting Oranges] ( src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java ) | Medium | Array, Breadth_First_Search, Matrix | 3 | 74.27
117-
118- #### Day 10 Recursion Backtracking
119-
120- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
121- |-|-|-|-|-|-
122- | 0021 |[ Merge Two Sorted Lists] ( src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 1 | 69.17
123- | 0206 |[ Reverse Linked List] ( src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 0 | 100.00
124-
125- #### Day 11 Recursion Backtracking
126-
127- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
128- |-|-|-|-|-|-
129- | 0077 |[ Combinations] ( src/main/java/g0001_0100/s0077_combinations/Solution.java ) | Medium | Backtracking | 5 | 90.06
130- | 0046 |[ Permutations] ( src/main/java/g0001_0100/s0046_permutations/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking | 1 | 97.24
131- | 0784 |[ Letter Case Permutation] ( src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java ) | Medium | String, Bit_Manipulation, Backtracking | 10 | 40.38
132-
133- #### Day 12 Dynamic Programming
134-
135- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
136- |-|-|-|-|-|-
137- | 0070 |[ Climbing Stairs] ( src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 0 | 100.00
138- | 0198 |[ House Robber] ( src/main/java/g0101_0200/s0198_house_robber/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 0 | 100.00
139- | 0120 |[ Triangle] ( src/main/java/g0101_0200/s0120_triangle/Solution.java ) | Medium | Array, Dynamic_Programming | 2 | 94.63
140-
141- #### Day 13 Bit Manipulation
142-
143- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
144- |-|-|-|-|-|-
145- | 0231 |[ Power of Two] ( src/main/java/g0201_0300/s0231_power_of_two/Solution.java ) | Easy | Math, Bit_Manipulation, Recursion | 1 | 100.00
146- | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
147-
148- #### Day 14 Bit Manipulation
149-
150- | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
151- |-|-|-|-|-|-
152- | 0190 |[ Reverse Bits] ( src/main/java/g0101_0200/s0190_reverse_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 1 | 98.66
153- | 0136 |[ Single Number] ( src/main/java/g0101_0200/s0136_single_number/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 1 | 99.97
50+ * [ Algorithm I] ( #algorithm-i )
15451
15552### Algorithm II
15653
@@ -1844,6 +1741,109 @@ implementation 'com.github.javadev:leetcode-in-java:1.13'
18441741| 0451 |[ Sort Characters By Frequency] ( src/main/java/g0401_0500/s0451_sort_characters_by_frequency/Solution.java ) | Medium | String, Hash_Table, Sorting, Heap_Priority_Queue, Counting, Bucket_Sort | 13 | 89.63
18451742| 0973 |[ K Closest Points to Origin] ( src/main/java/g0901_1000/s0973_k_closest_points_to_origin/Solution.java ) | Medium | Array, Math, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Geometry, Quickselect | 4 | 98.26
18461743
1744+ ### Algorithm I
1745+
1746+ #### Day 1 Binary Search
1747+
1748+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1749+ |-|-|-|-|-|-
1750+ | 0704 |[ Binary Search] ( src/main/java/g0701_0800/s0704_binary_search/Solution.java ) | Easy | Array, Binary_Search | 0 | 100.00
1751+ | 0278 |[ First Bad Version] ( src/main/java/g0201_0300/s0278_first_bad_version/Solution.java ) | Easy | Binary_Search, Interactive | 15 | 87.89
1752+ | 0035 |[ Search Insert Position] ( src/main/java/g0001_0100/s0035_search_insert_position/Solution.java ) | Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00
1753+
1754+ #### Day 2 Two Pointers
1755+
1756+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1757+ |-|-|-|-|-|-
1758+ | 0977 |[ Squares of a Sorted Array] ( src/main/java/g0901_1000/s0977_squares_of_a_sorted_array/Solution.java ) | Easy | Array, Sorting, Two_Pointers | 1 | 100.00
1759+ | 0189 |[ Rotate Array] ( src/main/java/g0101_0200/s0189_rotate_array/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers | 0 | 100.00
1760+
1761+ #### Day 3 Two Pointers
1762+
1763+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1764+ |-|-|-|-|-|-
1765+ | 0283 |[ Move Zeroes] ( src/main/java/g0201_0300/s0283_move_zeroes/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Two_Pointers | 2 | 79.54
1766+ | 0167 |[ Two Sum II - Input Array Is Sorted] ( src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java ) | Medium | Array, Binary_Search, Two_Pointers | 1 | 99.21
1767+
1768+ #### Day 4 Two Pointers
1769+
1770+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1771+ |-|-|-|-|-|-
1772+ | 0344 |[ Reverse String] ( src/main/java/g0301_0400/s0344_reverse_string/Solution.java ) | Easy | Top_Interview_Questions, String, Two_Pointers, Recursion | 1 | 99.91
1773+ | 0557 |[ Reverse Words in a String III] ( src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii/Solution.java ) | Easy | String, Two_Pointers | 4 | 97.75
1774+
1775+ #### Day 5 Two Pointers
1776+
1777+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1778+ |-|-|-|-|-|-
1779+ | 0876 |[ Middle of the Linked List] ( src/main/java/g0801_0900/s0876_middle_of_the_linked_list/Solution.java ) | Easy | Two_Pointers, Linked_List | 0 | 100.00
1780+ | 0019 |[ Remove Nth Node From End of List] ( src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List | 1 | 59.72
1781+
1782+ #### Day 6 Sliding Window
1783+
1784+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1785+ |-|-|-|-|-|-
1786+ | 0003 |[ Longest Substring Without Repeating Characters] ( src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window | 5 | 91.03
1787+ | 0567 |[ Permutation in String] ( src/main/java/g0501_0600/s0567_permutation_in_string/Solution.java ) | Medium | String, Hash_Table, Two_Pointers, Sliding_Window | 5 | 93.93
1788+
1789+ #### Day 7 Breadth First Search Depth First Search
1790+
1791+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1792+ |-|-|-|-|-|-
1793+ | 0733 |[ Flood Fill] ( src/main/java/g0701_0800/s0733_flood_fill/Solution.java ) | Easy | Array, Depth_First_Search, Breadth_First_Search, Matrix | 1 | 85.36
1794+ | 0695 |[ Max Area of Island] ( src/main/java/g0601_0700/s0695_max_area_of_island/Solution.java ) | Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 3 | 76.79
1795+
1796+ #### Day 8 Breadth First Search Depth First Search
1797+
1798+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1799+ |-|-|-|-|-|-
1800+ | 0617 |[ Merge Two Binary Trees] ( src/main/java/g0601_0700/s0617_merge_two_binary_trees/Solution.java ) | Easy | Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree | 1 | 72.47
1801+ | 0116 |[ Populating Next Right Pointers in Each Node] ( src/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node/Solution.java ) | Medium | Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Linked_List | 0 | 100.00
1802+
1803+ #### Day 9 Breadth First Search Depth First Search
1804+
1805+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1806+ |-|-|-|-|-|-
1807+ | 0542 |[ 01 Matrix] ( src/main/java/g0501_0600/s0542_01_matrix/Solution.java ) | Medium | Array, Dynamic_Programming, Breadth_First_Search, Matrix | 7 | 95.83
1808+ | 0994 |[ Rotting Oranges] ( src/main/java/g0901_1000/s0994_rotting_oranges/Solution.java ) | Medium | Array, Breadth_First_Search, Matrix | 3 | 74.27
1809+
1810+ #### Day 10 Recursion Backtracking
1811+
1812+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1813+ |-|-|-|-|-|-
1814+ | 0021 |[ Merge Two Sorted Lists] ( src/main/java/g0001_0100/s0021_merge_two_sorted_lists/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 1 | 69.17
1815+ | 0206 |[ Reverse Linked List] ( src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion | 0 | 100.00
1816+
1817+ #### Day 11 Recursion Backtracking
1818+
1819+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1820+ |-|-|-|-|-|-
1821+ | 0077 |[ Combinations] ( src/main/java/g0001_0100/s0077_combinations/Solution.java ) | Medium | Backtracking | 5 | 90.06
1822+ | 0046 |[ Permutations] ( src/main/java/g0001_0100/s0046_permutations/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking | 1 | 97.24
1823+ | 0784 |[ Letter Case Permutation] ( src/main/java/g0701_0800/s0784_letter_case_permutation/Solution.java ) | Medium | String, Bit_Manipulation, Backtracking | 10 | 40.38
1824+
1825+ #### Day 12 Dynamic Programming
1826+
1827+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1828+ |-|-|-|-|-|-
1829+ | 0070 |[ Climbing Stairs] ( src/main/java/g0001_0100/s0070_climbing_stairs/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization | 0 | 100.00
1830+ | 0198 |[ House Robber] ( src/main/java/g0101_0200/s0198_house_robber/Solution.java ) | Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming | 0 | 100.00
1831+ | 0120 |[ Triangle] ( src/main/java/g0101_0200/s0120_triangle/Solution.java ) | Medium | Array, Dynamic_Programming | 2 | 94.63
1832+
1833+ #### Day 13 Bit Manipulation
1834+
1835+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1836+ |-|-|-|-|-|-
1837+ | 0231 |[ Power of Two] ( src/main/java/g0201_0300/s0231_power_of_two/Solution.java ) | Easy | Math, Bit_Manipulation, Recursion | 1 | 100.00
1838+ | 0191 |[ Number of 1 Bits] ( src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation | 1 | 84.87
1839+
1840+ #### Day 14 Bit Manipulation
1841+
1842+ | <!-- --> <!-- --> <!-- --> <!-- --> <!-- --> <!-- -->
1843+ |-|-|-|-|-|-
1844+ | 0190 |[ Reverse Bits] ( src/main/java/g0101_0200/s0190_reverse_bits/Solution.java ) | Easy | Top_Interview_Questions, Bit_Manipulation, Divide_and_Conquer | 1 | 98.66
1845+ | 0136 |[ Single Number] ( src/main/java/g0101_0200/s0136_single_number/Solution.java ) | Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation | 1 | 99.97
1846+
18471847## Algorithms
18481848
18491849| # | Title | Difficulty | Tag | Time, ms | Time, %
0 commit comments