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

Commit9ddda61

Browse files
authored
Updated readme
1 parentc7cb28c commit9ddda61

File tree

1 file changed

+87
-87
lines changed

1 file changed

+87
-87
lines changed

‎README.md

Lines changed: 87 additions & 87 deletions
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,6 @@ implementation 'com.github.javadev:leetcode-in-java:1.43'
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-
*[Binary Search I](#binary-search-i)
3837
*[Binary Search II](#binary-search-ii)
3938
*[Dynamic Programming I](#dynamic-programming-i)
4039
*[Programming Skills I](#programming-skills-i)
@@ -49,91 +48,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.43'
4948
*[Data Structure II](#data-structure-ii)
5049
*[Algorithm I](#algorithm-i)
5150
*[Algorithm II](#algorithm-ii)
52-
53-
###Binary Search I
54-
55-
####Day 1
56-
57-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
58-
|-|-|-|-|-|-
59-
| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00
60-
| 0374 |[Guess Number Higher or Lower](src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java)| Easy | Binary_Search, Interactive, LeetCode_75_Binary_Search | 0 | 100.00
61-
62-
####Day 2
63-
64-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
65-
|-|-|-|-|-|-
66-
| 0035 |[Search Insert Position](src/main/java/g0001_0100/s0035_search_insert_position/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00
67-
| 0852 |[Peak Index in a Mountain Array](src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java)| Medium | Array, Binary_Search | 0 | 100.00
68-
69-
####Day 3
70-
71-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
72-
|-|-|-|-|-|-
73-
| 0367 |[Valid Perfect Square](src/main/java/g0301_0400/s0367_valid_perfect_square/Solution.java)| Easy | Math, Binary_Search | 0 | 100.00
74-
| 1385 |[Find the Distance Value Between Two Arrays](src/main/java/g1301_1400/s1385_find_the_distance_value_between_two_arrays/Solution.java)| Easy | Array, Sorting, Binary_Search, Two_Pointers | 5 | 65.78
75-
76-
####Day 4
77-
78-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
79-
|-|-|-|-|-|-
80-
| 0069 |[Sqrt(x)](src/main/java/g0001_0100/s0069_sqrtx/Solution.java)| Easy | Top_Interview_Questions, Math, Binary_Search | 1 | 86.67
81-
| 0744 |[Find Smallest Letter Greater Than Target](src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00
82-
83-
####Day 5
84-
85-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
86-
|-|-|-|-|-|-
87-
| 0278 |[First Bad Version](src/main/java/g0201_0300/s0278_first_bad_version/Solution.java)| Easy | Binary_Search, Interactive | 15 | 87.89
88-
| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00
89-
90-
####Day 6
91-
92-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
93-
|-|-|-|-|-|-
94-
| 0441 |[Arranging Coins](src/main/java/g0401_0500/s0441_arranging_coins/Solution.java)| Easy | Math, Binary_Search | 2 | 95.97
95-
| 1539 |[Kth Missing Positive Number](src/main/java/g1501_1600/s1539_kth_missing_positive_number/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00
96-
97-
####Day 7
98-
99-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
100-
|-|-|-|-|-|-
101-
| 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 | 2 | 92.62
102-
| 1608 |[Special Array With X Elements Greater Than or Equal X](src/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x/Solution.java)| Easy | Array, Sorting, Binary_Search | 2 | 61.14
103-
104-
####Day 8
105-
106-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
107-
|-|-|-|-|-|-
108-
| 1351 |[Count Negative Numbers in a Sorted Matrix](src/main/java/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/Solution.java)| Easy | Array, Binary_Search, Matrix | 1 | 49.66
109-
| 0074 |[Search a 2D Matrix](src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00
110-
111-
####Day 9
112-
113-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
114-
|-|-|-|-|-|-
115-
| 1337 |[The K Weakest Rows in a Matrix](src/main/java/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/Solution.java)| Easy | Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue | 1 | 99.77
116-
| 1346 |[Check If N and Its Double Exist](src/main/java/g1301_1400/s1346_check_if_n_and_its_double_exist/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 1 | 99.64
117-
118-
####Day 10
119-
120-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
121-
|-|-|-|-|-|-
122-
| 0350 |[Intersection of Two Arrays II](src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 4 | 69.62
123-
| 0633 |[Sum of Square Numbers](src/main/java/g0601_0700/s0633_sum_of_square_numbers/Solution.java)| Medium | Math, Binary_Search, Two_Pointers | 4 | 82.92
124-
125-
####Day 11
126-
127-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
128-
|-|-|-|-|-|-
129-
| 1855 |[Maximum Distance Between a Pair of Values](src/main/java/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.java)| Medium | Array, Greedy, Binary_Search, Two_Pointers | 4 | 62.20
130-
| 0033 |[Search in Rotated Sorted Array](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00
131-
132-
####Day 12
133-
134-
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
135-
|-|-|-|-|-|-
136-
| 0153 |[Find Minimum in Rotated Sorted Array](src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00
51+
*[Binary Search I](#binary-search-i)
13752

13853
###Binary Search II
13954

@@ -498,7 +413,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.43'
498413
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
499414
|-|-|-|-|-|-
500415
| 0709 |[To Lower Case](src/main/java/g0701_0800/s0709_to_lower_case/Solution.java)| Easy | String | 1 | 71.74
501-
| 1309 |[Decrypt String from Alphabet to Integer Mapping](src/main/java/g1301_1400/s1309_decrypt_string_from_alphabet_to_integer_mapping/Solution.java)| Easy | String |6 |28.25
416+
| 1309 |[Decrypt String from Alphabet to Integer Mapping](src/main/java/g1301_1400/s1309_decrypt_string_from_alphabet_to_integer_mapping/Solution.java)| Easy | String |0 |100.00
502417
| 0953 |[Verifying an Alien Dictionary](src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary/Solution.java)| Easy | Array, String, Hash_Table | 0 | 100.00
503418

504419
####Day 10 Linked List and Tree
@@ -2112,6 +2027,91 @@ implementation 'com.github.javadev:leetcode-in-java:1.43'
21122027
| 0202 |[Happy Number](src/main/java/g0201_0300/s0202_happy_number/Solution.java)| Easy | Top_Interview_Questions, Hash_Table, Math, Two_Pointers | 0 | 100.00
21132028
| 0149 |[Max Points on a Line](src/main/java/g0101_0200/s0149_max_points_on_a_line/Solution.java)| Hard | Top_Interview_Questions, Array, Hash_Table, Math, Geometry | 7 | 99.18
21142029

2030+
###Binary Search I
2031+
2032+
####Day 1
2033+
2034+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2035+
|-|-|-|-|-|-
2036+
| 0704 |[Binary Search](src/main/java/g0701_0800/s0704_binary_search/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search | 0 | 100.00
2037+
| 0374 |[Guess Number Higher or Lower](src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java)| Easy | Binary_Search, Interactive, LeetCode_75_Binary_Search | 0 | 100.00
2038+
2039+
####Day 2
2040+
2041+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2042+
|-|-|-|-|-|-
2043+
| 0035 |[Search Insert Position](src/main/java/g0001_0100/s0035_search_insert_position/Solution.java)| Easy | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00
2044+
| 0852 |[Peak Index in a Mountain Array](src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array/Solution.java)| Medium | Array, Binary_Search | 0 | 100.00
2045+
2046+
####Day 3
2047+
2048+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2049+
|-|-|-|-|-|-
2050+
| 0367 |[Valid Perfect Square](src/main/java/g0301_0400/s0367_valid_perfect_square/Solution.java)| Easy | Math, Binary_Search | 0 | 100.00
2051+
| 1385 |[Find the Distance Value Between Two Arrays](src/main/java/g1301_1400/s1385_find_the_distance_value_between_two_arrays/Solution.java)| Easy | Array, Sorting, Binary_Search, Two_Pointers | 5 | 65.78
2052+
2053+
####Day 4
2054+
2055+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2056+
|-|-|-|-|-|-
2057+
| 0069 |[Sqrt(x)](src/main/java/g0001_0100/s0069_sqrtx/Solution.java)| Easy | Top_Interview_Questions, Math, Binary_Search | 1 | 86.67
2058+
| 0744 |[Find Smallest Letter Greater Than Target](src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00
2059+
2060+
####Day 5
2061+
2062+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2063+
|-|-|-|-|-|-
2064+
| 0278 |[First Bad Version](src/main/java/g0201_0300/s0278_first_bad_version/Solution.java)| Easy | Binary_Search, Interactive | 15 | 87.89
2065+
| 0034 |[Find First and Last Position of Element in Sorted Array](src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00
2066+
2067+
####Day 6
2068+
2069+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2070+
|-|-|-|-|-|-
2071+
| 0441 |[Arranging Coins](src/main/java/g0401_0500/s0441_arranging_coins/Solution.java)| Easy | Math, Binary_Search | 2 | 95.97
2072+
| 1539 |[Kth Missing Positive Number](src/main/java/g1501_1600/s1539_kth_missing_positive_number/Solution.java)| Easy | Array, Binary_Search | 0 | 100.00
2073+
2074+
####Day 7
2075+
2076+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2077+
|-|-|-|-|-|-
2078+
| 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 | 2 | 92.62
2079+
| 1608 |[Special Array With X Elements Greater Than or Equal X](src/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x/Solution.java)| Easy | Array, Sorting, Binary_Search | 2 | 61.14
2080+
2081+
####Day 8
2082+
2083+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2084+
|-|-|-|-|-|-
2085+
| 1351 |[Count Negative Numbers in a Sorted Matrix](src/main/java/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix/Solution.java)| Easy | Array, Binary_Search, Matrix | 1 | 49.66
2086+
| 0074 |[Search a 2D Matrix](src/main/java/g0001_0100/s0074_search_a_2d_matrix/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Big_O_Time_O(endRow+endCol)_Space_O(1) | 0 | 100.00
2087+
2088+
####Day 9
2089+
2090+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2091+
|-|-|-|-|-|-
2092+
| 1337 |[The K Weakest Rows in a Matrix](src/main/java/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix/Solution.java)| Easy | Array, Sorting, Binary_Search, Matrix, Heap_Priority_Queue | 1 | 99.77
2093+
| 1346 |[Check If N and Its Double Exist](src/main/java/g1301_1400/s1346_check_if_n_and_its_double_exist/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 1 | 99.64
2094+
2095+
####Day 10
2096+
2097+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2098+
|-|-|-|-|-|-
2099+
| 0350 |[Intersection of Two Arrays II](src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search, Two_Pointers | 4 | 69.62
2100+
| 0633 |[Sum of Square Numbers](src/main/java/g0601_0700/s0633_sum_of_square_numbers/Solution.java)| Medium | Math, Binary_Search, Two_Pointers | 4 | 82.92
2101+
2102+
####Day 11
2103+
2104+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2105+
|-|-|-|-|-|-
2106+
| 1855 |[Maximum Distance Between a Pair of Values](src/main/java/g1801_1900/s1855_maximum_distance_between_a_pair_of_values/Solution.java)| Medium | Array, Greedy, Binary_Search, Two_Pointers | 4 | 62.20
2107+
| 0033 |[Search in Rotated Sorted Array](src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Binary_Search, Big_O_Time_O(log_n)_Space_O(1) | 0 | 100.00
2108+
2109+
####Day 12
2110+
2111+
|<!----> |<!----> |<!----> |<!----> |<!----> |<!---->
2112+
|-|-|-|-|-|-
2113+
| 0153 |[Find Minimum in Rotated Sorted Array](src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array/Solution.java)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Big_O_Time_O(log_N)_Space_O(log_N) | 0 | 100.00
2114+
21152115
##Contributing
21162116
Your ideas/fixes/algorithms are more than welcome!
21172117

0 commit comments

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