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

Commit 826df26

Browse files
Updated tags for tasks 12-63
1 parent 44a5059 commit 826df26

File tree

16 files changed

+51
-53
lines changed

16 files changed

+51
-53
lines changed

‎README.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1339,7 +1339,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.41'
13391339
| 0392 |[Is Subsequence](src/main/java/g0301_0400/s0392_is_subsequence/Solution.java)| Easy | String, Dynamic_Programming, Two_Pointers | 1 | 93.01
13401340
| 0125 |[Valid Palindrome](src/main/java/g0101_0200/s0125_valid_palindrome/Solution.java)| Easy | Top_Interview_Questions, String, Two_Pointers | 3 | 98.64
13411341
| 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
1342-
| 0026 |[Remove Duplicates from Sorted Array](src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java)| Easy | Top_Interview_Questions, Array, Two_Pointers | 1 | 98.56
1342+
| 0026 |[Remove Duplicates from Sorted Array](src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java)| Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00
13431343
| 0042 |[Trapping Rain Water](src/main/java/g0001_0100/s0042_trapping_rain_water/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
13441344
| 0015 |[3Sum](src/main/java/g0001_0100/s0015_3sum/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 29 | 72.02
13451345

@@ -1488,7 +1488,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.41'
14881488
|-|-|-|-|-|-
14891489
| 0088 |[Merge Sorted Array](src/main/java/g0001_0100/s0088_merge_sorted_array/Solution.java)| Easy | Top_Interview_Questions, Array, Sorting, Two_Pointers | 0 | 100.00
14901490
| 0027 |[Remove Element](src/main/java/g0001_0100/s0027_remove_element/Solution.java)| Easy | Array, Two_Pointers | 0 | 100.00
1491-
| 0026 |[Remove Duplicates from Sorted Array](src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java)| Easy | Top_Interview_Questions, Array, Two_Pointers | 1 | 98.56
1491+
| 0026 |[Remove Duplicates from Sorted Array](src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java)| Easy | Top_Interview_Questions, Array, Two_Pointers | 0 | 100.00
14921492
| 0080 |[Remove Duplicates from Sorted Array II](src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii/Solution.java)| Medium | Array, Two_Pointers | 0 | 100.00
14931493
| 0169 |[Majority Element](src/main/java/g0101_0200/s0169_majority_element/Solution.java)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Sorting, Counting, Divide_and_Conquer, Big_O_Time_O(n)_Space_O(1) | 1 | 99.89
14941494
| 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, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
@@ -1525,10 +1525,10 @@ implementation 'com.github.javadev:leetcode-in-java:1.41'
15251525

15261526
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
15271527
|-|-|-|-|-|-
1528-
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
15291528
| 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, Big_O_Time_O(n)_Space_O(1), AI_can_be_used_to_solve_the_task | 2 | 98.59
1530-
| 0030 |[Substring with Concatenation of All Words](src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java)| Hard | String, Hash_Table, Sliding_Window | 1472 | 34.43
1529+
| 0030 |[Substring with Concatenation of All Words](src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words/Solution.java)| Hard | String, Hash_Table, Sliding_Window | 11 | 97.43
15311530
| 0076 |[Minimum Window Substring](src/main/java/g0001_0100/s0076_minimum_window_substring/Solution.java)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Sliding_Window, Big_O_Time_O(s.length())_Space_O(1) | 2 | 99.83
1531+
| 0209 |[Minimum Size Subarray Sum](src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 1 | 100.00
15321532

15331533
#### Top Interview 150 Matrix
15341534

@@ -1660,7 +1660,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.41'
16601660
| 0077 |[Combinations](src/main/java/g0001_0100/s0077_combinations/Solution.java)| Medium | Backtracking | 11 | 77.40
16611661
| 0046 |[Permutations](src/main/java/g0001_0100/s0046_permutations/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Backtracking, Big_O_Time_O(n\*n!)_Space_O(n+n!) | 1 | 94.08
16621662
| 0039 |[Combination Sum](src/main/java/g0001_0100/s0039_combination_sum/Solution.java)| Medium | Top_100_Liked_Questions, Array, Backtracking, Big_O_Time_O(2^n)_Space_O(n+2^n) | 1 | 99.99
1663-
| 0052 |[N-Queens II](src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java)| Hard | Backtracking | 1 | 96.99
1663+
| 0052 |[N-Queens II](src/main/java/g0001_0100/s0052_n_queens_ii/Solution.java)| Hard | Backtracking | 0 | 100.00
16641664
| 0022 |[Generate Parentheses](src/main/java/g0001_0100/s0022_generate_parentheses/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(2^n)_Space_O(n) | 0 | 100.00
16651665
| 0079 |[Word Search](src/main/java/g0001_0100/s0079_word_search/Solution.java)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Matrix, Backtracking, Big_O_Time_O(4^(m\*n))_Space_O(m\*n) | 64 | 98.51
16661666

‎src/main/java/g0001_0100/s0012_integer_to_roman/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0012_integer_to_roman;
22

33
// #Medium #String #Hash_Table #Math #Top_Interview_150_Array/String
4-
// #2024_02_11_Time_2_ms_(100.00%)_Space_44.1_MB_(80.61%)
4+
// #2025_03_04_Time_2_(100.00%)_Space_44.30_(83.82%)
55

66
public class Solution {
77
public String intToRoman(int num) {

‎src/main/java/g0001_0100/s0013_roman_to_integer/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0013_roman_to_integer;
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
4-
// #Top_Interview_150_Array/String #2024_02_11_Time_2_ms_(100.00%)_Space_44.5_MB_(76.62%)
4+
// #Top_Interview_150_Array/String #2025_03_04_Time_2_(100.00%)_Space_44.54_(91.65%)
55

66
public class Solution {
77
public int romanToInt(String s) {

‎src/main/java/g0001_0100/s0014_longest_common_prefix/Solution.java

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0001_0100.s0014_longest_common_prefix;
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
4-
// #Udemy_Strings #Top_Interview_150_Array/String
5-
// #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%)
4+
// #Udemy_Strings #Top_Interview_150_Array/String #2025_03_04_Time_0_(100.00%)_Space_41.35_(87.42%)
65

76
public class Solution {
87
public String longestCommonPrefix(String[] strs) {

‎src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0026_remove_duplicates_from_sorted_array;
22

33
// #Easy #Top_Interview_Questions #Array #Two_Pointers #Udemy_Two_Pointers
4-
// #Top_Interview_150_Array/String #2023_08_09_Time_1_ms_(98.56%)_Space_43.9_MB_(51.95%)
4+
// #Top_Interview_150_Array/String #2025_03_04_Time_0_(100.00%)_Space_44.59_(95.49%)
55

66
public class Solution {
77
public int removeDuplicates(int[] nums) {

‎src/main/java/g0001_0100/s0027_remove_element/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0027_remove_element;
22

33
// #Easy #Array #Two_Pointers #Top_Interview_150_Array/String
4-
// #2023_08_09_Time_0_ms_(100.00%)_Space_40.9_MB_(87.68%)
4+
// #2025_03_04_Time_0_(100.00%)_Space_42.15_(29.50%)
55

66
public class Solution {
77
public int removeElement(int[] nums, int val) {

‎src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22

33
// #Easy #Top_Interview_Questions #String #Two_Pointers #String_Matching
44
// #Programming_Skills_II_Day_1 #Top_Interview_150_Array/String
5-
// #2023_08_09_Time_0_ms_(100.00%)_Space_40.5_MB_(71.14%)
5+
// #2025_03_04_Time_0_(100.00%)_Space_41.19_(97.77%)
66

77
public class Solution {
88
public int strStr(String haystack, String needle) {
Lines changed: 32 additions & 33 deletions
Original file line numberDiff line numberDiff line change
@@ -1,51 +1,50 @@
11
package g0001_0100.s0030_substring_with_concatenation_of_all_words;
22

33
// #Hard #String #Hash_Table #Sliding_Window #Top_Interview_150_Sliding_Window
4-
// #2023_08_09_Time_1472_ms_(34.43%)_Space_45_MB_(24.98%)
4+
// #2025_03_04_Time_11_(97.43%)_Space_45.96_(24.38%)
55

66
import java.util.ArrayList;
77
import java.util.HashMap;
88
import java.util.List;
99
import java.util.Map;
1010

11-
@SuppressWarnings("java:S127")
1211
public class Solution {
1312
public List<Integer> findSubstring(String s, String[] words) {
14-
List<Integer> indices = new ArrayList<>();
15-
if (words.length == 0) {
16-
return indices;
13+
List<Integer> ans = new ArrayList<>();
14+
int n1 = words[0].length();
15+
int n2 = s.length();
16+
Map<String, Integer> map1 = new HashMap<>();
17+
for (String ch : words) {
18+
map1.put(ch, map1.getOrDefault(ch, 0) + 1);
1719
}
18-
// Put each word into a HashMap and calculate word frequency
19-
Map<String, Integer> wordMap = new HashMap<>();
20-
for (String word : words) {
21-
wordMap.put(word, wordMap.getOrDefault(word, 0) + 1);
22-
}
23-
int wordLength = words[0].length();
24-
int window = words.length * wordLength;
25-
for (int i = 0; i < wordLength; i++) {
26-
// move a word's length each time
27-
for (int j = i; j + window <= s.length(); j = j + wordLength) {
28-
// get the subStr
29-
String subStr = s.substring(j, j + window);
30-
Map<String, Integer> map = new HashMap<>();
31-
// start from the last word
32-
for (int k = words.length - 1; k >= 0; k--) {
33-
// get the word from subStr
34-
String word = subStr.substring(k * wordLength, (k + 1) * wordLength);
35-
int count = map.getOrDefault(word, 0) + 1;
36-
// if the num of the word is greater than wordMap's, move (k * wordLength) and
37-
// break
38-
if (count > wordMap.getOrDefault(word, 0)) {
39-
j = j + k * wordLength;
40-
break;
41-
} else if (k == 0) {
42-
indices.add(j);
43-
} else {
44-
map.put(word, count);
20+
for (int i = 0; i < n1; i++) {
21+
int left = i;
22+
int j = i;
23+
int c = 0;
24+
Map<String, Integer> map2 = new HashMap<>();
25+
while (j + n1 <= n2) {
26+
String word1 = s.substring(j, j + n1);
27+
j += n1;
28+
if (map1.containsKey(word1)) {
29+
map2.put(word1, map2.getOrDefault(word1, 0) + 1);
30+
c++;
31+
while (map2.get(word1) > map1.get(word1)) {
32+
String word2 = s.substring(left, left + n1);
33+
map2.put(word2, map2.get(word2) - 1);
34+
left += n1;
35+
c--;
36+
}
37+
if (c == words.length) {
38+
ans.add(left);
4539
}
40+
} else {
41+
map2.clear();
42+
c = 0;
43+
left = j;
4644
}
4745
}
4846
}
49-
return indices;
47+
48+
return ans;
5049
}
5150
}

‎src/main/java/g0001_0100/s0036_valid_sudoku/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0036_valid_sudoku;
22

33
// #Medium #Top_Interview_Questions #Array #Hash_Table #Matrix #Data_Structure_I_Day_5_Array
4-
// #Top_Interview_150_Matrix #2023_08_09_Time_1_ms_(100.00%)_Space_43.8_MB_(30.47%)
4+
// #Top_Interview_150_Matrix #2025_03_04_Time_1_(100.00%)_Space_44.50_(57.83%)
55

66
public class Solution {
77
private int j1;

‎src/main/java/g0001_0100/s0050_powx_n/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0050_powx_n;
22

33
// #Medium #Top_Interview_Questions #Math #Recursion #Udemy_Integers #Top_Interview_150_Math
4-
// #2023_08_11_Time_0_ms_(100.00%)_Space_41.2_MB_(14.99%)
4+
// #2025_03_04_Time_0_(100.00%)_Space_41.72_(93.18%)
55

66
public class Solution {
77
public double myPow(double x, int n) {

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /