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

Commit2d73cbf

Browse files
authored
Added tag LeetCode_75
1 parent04723b5 commit2d73cbf

File tree

76 files changed

+220
-195
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

76 files changed

+220
-195
lines changed

‎README.md

Lines changed: 91 additions & 91 deletions

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
packageg0001_0100.s0011_container_with_most_water;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
4-
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%)
4+
// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_11_09_Time_3_ms_(96.01%)_Space_57.8_MB_(52.01%)
66

77
publicclassSolution {
88
publicintmaxArea(int[]height) {

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
packageg0001_0100.s0017_letter_combinations_of_a_phone_number;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
4-
// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
4+
// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking
5+
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
66
// #2024_11_09_Time_0_ms_(100.00%)_Space_42.3_MB_(28.63%)
77

88
importjava.util.ArrayList;

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

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
packageg0001_0100.s0062_unique_paths;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
4-
// #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
5-
// #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
6-
// #2024_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%)
4+
// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
5+
// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
6+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_11_11_Time_0_ms_(100.00%)_Space_40.7_MB_(12.56%)
77

88
publicclassSolution {
99
publicintuniquePaths(intm,intn) {

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0001_0100.s0072_edit_distance;
22

3-
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
55
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
66
// #2024_11_11_Time_3_ms_(97.19%)_Space_43.2_MB_(98.23%)

‎src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
4-
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
4+
// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree
55
// #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
66
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
77
// #2024_11_13_Time_0_ms_(100.00%)_Space_42.2_MB_(88.11%)

‎src/main/java/g0101_0200/s0136_single_number/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
packageg0101_0200.s0136_single_number;
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
4-
// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
5-
// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1)
6-
// #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)
4+
// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
5+
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
6+
// #Big_O_Time_O(N)_Space_O(1) #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)
77

88
publicclassSolution {
99
publicintsingleNumber(int[]nums) {

‎src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0101_0200.s0151_reverse_words_in_a_string;
22

3-
// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String
4-
// #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%)
3+
// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings
4+
// #Top_Interview_150_Array/String #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%)
55

66
publicclassSolution {
77
publicStringreverseWords(Strings) {

‎src/main/java/g0101_0200/s0162_find_peak_element/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0101_0200.s0162_find_peak_element;
22

3-
// #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
4-
// #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
3+
// #Medium #Top_Interview_Questions #Array #Binary_Search #LeetCode_75_Binary_Search
4+
// #Algorithm_II_Day_2_Binary_Search #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
55
// #2025_03_06_Time_0_ms_(100.00%)_Space_42.78_MB_(21.39%)
66

77
publicclassSolution {

‎src/main/java/g0101_0200/s0198_house_robber/Solution.java

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
4-
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
4+
// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
55
// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
66
// #Big_O_Time_O(n)_Space_O(n) #2024_11_15_Time_0_ms_(100.00%)_Space_40.7_MB_(77.55%)
77

‎src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
packageg0101_0200.s0199_binary_tree_right_side_view;
22

33
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
4-
// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree #Top_Interview_150_Binary_Tree_BFS
5-
// #2025_03_09_Time_0_ms_(100.00%)_Space_42.21_MB_(42.76%)
4+
// #LeetCode_75_Binary_Tree/BFS #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
5+
// #Top_Interview_150_Binary_Tree_BFS #2025_03_09_Time_0_ms_(100.00%)_Space_42.21_MB_(42.76%)
66

77
importcom_github_leetcode.TreeNode;
88
importjava.util.ArrayList;

‎src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
packageg0201_0300.s0206_reverse_linked_list;
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
4-
// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
5-
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1)
6-
// #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%)
4+
// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List
5+
// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
6+
// #Big_O_Time_O(N)_Space_O(1) #2024_11_15_Time_0_ms_(100.00%)_Space_42.5_MB_(41.63%)
77

88
importcom_github_leetcode.ListNode;
99

‎src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
4-
// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
4+
// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
55
// #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
66
// #2024_11_15_Time_32_ms_(95.05%)_Space_54.9_MB_(91.16%)
77

‎src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
packageg0201_0300.s0215_kth_largest_element_in_an_array;
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
4-
// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue
5-
// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n))
6-
// #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%)
4+
// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
5+
// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
6+
// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2022_07_02_Time_5_ms_(70.82%)_Space_45.1_MB_(24.69%)
77

88
importjava.util.Arrays;
99

‎src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0201_0300.s0216_combination_sum_iii;
22

3-
// #Medium #Array #Backtracking #Udemy_Backtracking/Recursion
3+
// #Medium #Array #Backtracking #LeetCode_75_Backtracking #Udemy_Backtracking/Recursion
44
// #2022_07_02_Time_1_ms_(81.35%)_Space_41.8_MB_(46.36%)
55

66
importjava.util.ArrayList;

‎src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,9 @@
11
packageg0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree;
22

33
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
4-
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
5-
// #Big_O_Time_O(n)_Space_O(n) #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)
4+
// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
5+
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
6+
// #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)
67

78
importcom_github_leetcode.TreeNode;
89

‎src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
packageg0201_0300.s0238_product_of_array_except_self;
22

3-
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
4-
// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
5-
// #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%)
3+
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String
4+
// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String
5+
// #Big_O_Time_O(n^2)_Space_O(n) #2024_11_16_Time_1_ms_(99.66%)_Space_55.1_MB_(79.02%)
66

77
publicclassSolution {
88
publicint[]productExceptSelf(int[]nums) {

‎src/main/java/g0201_0300/s0283_move_zeroes/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
packageg0201_0300.s0283_move_zeroes;
22

3-
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
4-
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%)
3+
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers
4+
// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
5+
// #Big_O_Time_O(n)_Space_O(1) #2024_11_16_Time_2_ms_(83.99%)_Space_45.9_MB_(50.99%)
66

77
publicclassSolution {
88
publicvoidmoveZeroes(int[]nums) {

‎src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0301_0400.s0328_odd_even_linked_list;
22

3-
// #Medium #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
3+
// #Medium #Linked_List #LeetCode_75_LinkedList #Level_2_Day_4_Linked_List #Udemy_Linked_List
44
// #2022_07_09_Time_0_ms_(100.00%)_Space_44.8_MB_(44.32%)
55

66
importcom_github_leetcode.ListNode;

‎src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0301_0400.s0334_increasing_triplet_subsequence;
22

3-
// #Medium #Array #Greedy #Data_Structure_II_Day_5_Array
3+
// #Medium #Array #Greedy #LeetCode_75_Array/String #Data_Structure_II_Day_5_Array
44
// #2022_07_10_Time_2_ms_(99.33%)_Space_93.5_MB_(47.20%)
55

66
publicclassSolution {

‎src/main/java/g0301_0400/s0338_counting_bits/Solution.java

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
packageg0301_0400.s0338_counting_bits;
22

3-
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
4-
// #Big_O_Time_O(num)_Space_O(num) #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%)
3+
// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
4+
// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
5+
// #2024_11_16_Time_2_ms_(96.37%)_Space_46.4_MB_(70.53%)
56

67
publicclassSolution {
78
publicint[]countBits(intnum) {

‎src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg0301_0400.s0345_reverse_vowels_of_a_string;
22

3-
// #Easy #String #Two_Pointers #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%)
3+
// #Easy #String #Two_Pointers #LeetCode_75_Array/String
4+
// #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%)
45

56
publicclassSolution {
67
privatebooleanisVowel(charc) {

‎src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0301_0400.s0374_guess_number_higher_or_lower;
22

3-
// #Easy #Binary_Search #Interactive #Binary_Search_I_Day_1
3+
// #Easy #Binary_Search #Interactive #LeetCode_75_Binary_Search #Binary_Search_I_Day_1
44
// #2022_07_12_Time_0_ms_(100.00%)_Space_40.4_MB_(74.20%)
55

66
/*

‎src/main/java/g0301_0400/s0392_is_subsequence/Solution.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
packageg0301_0400.s0392_is_subsequence;
22

3-
// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19
4-
// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers
5-
// #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)
3+
// #Easy #String #Dynamic_Programming #Two_Pointers #LeetCode_75_Two_Pointers
4+
// #Dynamic_Programming_I_Day_19 #Level_1_Day_2_String #Udemy_Two_Pointers
5+
// #Top_Interview_150_Two_Pointers #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)
66

77
publicclassSolution {
88
publicbooleanisSubsequence(Strings,Stringt) {

‎src/main/java/g0301_0400/s0394_decode_string/Solution.java

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
packageg0301_0400.s0394_decode_string;
22

3-
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
4-
// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%)
3+
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack
4+
// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
5+
// #2024_11_17_Time_0_ms_(100.00%)_Space_41.5_MB_(58.38%)
56

67
publicclassSolution {
78
privateinti =0;

‎src/main/java/g0301_0400/s0399_evaluate_division/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
packageg0301_0400.s0399_evaluate_division;
22

33
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path
4-
// #Top_Interview_150_Graph_General #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%)
4+
// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General
5+
// #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%)
56

67
importjava.util.HashMap;
78
importjava.util.List;

‎src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0401_0500.s0435_non_overlapping_intervals;
22

3-
// #Medium #Array #Dynamic_Programming #Sorting #Greedy #Data_Structure_II_Day_4_Array
4-
// #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%)
3+
// #Medium #Array #Dynamic_Programming #Sorting #Greedy #LeetCode_75_Intervals
4+
// #Data_Structure_II_Day_4_Array #2022_07_16_Time_96_ms_(47.37%)_Space_106.6_MB_(6.15%)
55

66
importjava.util.Arrays;
77

‎src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0401_0500.s0437_path_sum_iii;
22

3-
// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
4-
// #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%)
3+
// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
4+
// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_2_ms_(100.00%)_Space_44.7_MB_(11.66%)
55

66
importcom_github_leetcode.TreeNode;
77
importjava.util.HashMap;

‎src/main/java/g0401_0500/s0443_string_compression/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg0401_0500.s0443_string_compression;
22

3-
// #Medium #String #Two_Pointers #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)
3+
// #Medium #String #Two_Pointers #LeetCode_75_Array/String
4+
// #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)
45

56
publicclassSolution {
67
/* This is breaking the rules, it's not in-place. */

‎src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0401_0500.s0450_delete_node_in_a_bst;
22

3-
// #Medium #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_II_Day_16_Tree
4-
// #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%)
3+
// #Medium #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
4+
// #Data_Structure_II_Day_16_Tree #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons;
22

3-
// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals
3+
// #Medium #Array #Sorting #Greedy #LeetCode_75_Intervals #Top_Interview_150_Intervals
44
// #2025_03_09_Time_52_ms_(89.91%)_Space_68.86_MB_(77.92%)
55

66
importjava.util.Arrays;

‎src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0501_0600.s0547_number_of_provinces;
22

3-
// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find
3+
// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #LeetCode_75_Graphs/DFS
44
// #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
55
// #Graph_Theory_I_Day_8_Standard_Traversal #Level_2_Day_19_Union_Find
66
// #2022_08_02_Time_2_ms_(69.51%)_Space_54.2_MB_(42.16%)

‎src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg0601_0700.s0605_can_place_flowers;
22

3-
// #Easy #Array #Greedy #Udemy_Arrays #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%)
3+
// #Easy #Array #Greedy #LeetCode_75_Array/String #Udemy_Arrays
4+
// #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%)
45

56
publicclassSolution {
67
publicbooleancanPlaceFlowers(int[]flowerbed,intn) {

‎src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg0601_0700.s0643_maximum_average_subarray_i;
22

3-
// #Easy #Array #Sliding_Window #2022_03_21_Time_5_ms_(74.81%)_Space_58.3_MB_(84.86%)
3+
// #Easy #Array #Sliding_Window #LeetCode_75_Sliding_Window
4+
// #2022_03_21_Time_5_ms_(74.81%)_Space_58.3_MB_(84.86%)
45

56
publicclassSolution {
67
publicdoublefindMaxAverage(int[]nums,intk) {

‎src/main/java/g0601_0700/s0649_dota2_senate/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg0601_0700.s0649_dota2_senate;
22

3-
// #Medium #String #Greedy #Queue #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%)
3+
// #Medium #String #Greedy #Queue #LeetCode_75_Queue
4+
// #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%)
45

56
publicclassSolution {
67
publicStringpredictPartyVictory(Stringsenate) {

‎src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0601_0700.s0700_search_in_a_binary_search_tree;
22

3-
// #Easy #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_13_Tree
4-
// #2022_03_22_Time_0_ms_(100.00%)_Space_52.3_MB_(6.38%)
3+
// #Easy #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
4+
// #Data_Structure_I_Day_13_Tree #2022_03_22_Time_0_ms_(100.00%)_Space_52.3_MB_(6.38%)
55

66
importcom_github_leetcode.TreeNode;
77

‎src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
packageg0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee;
22

3-
// #Medium #Array #Dynamic_Programming #Greedy #Dynamic_Programming_I_Day_8
4-
// #2022_03_24_Time_4_ms_(78.57%)_Space_75.9_MB_(33.27%)
3+
// #Medium #Array #Dynamic_Programming #Greedy #LeetCode_75_DP/Multidimensional
4+
// #Dynamic_Programming_I_Day_8 #2022_03_24_Time_4_ms_(78.57%)_Space_75.9_MB_(33.27%)
55

66
publicclassSolution {
77
publicintmaxProfit(int[]prices,intfee) {

‎src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0701_0800.s0724_find_pivot_index;
22

3-
// #Easy #Array #Prefix_Sum #Level_1_Day_1_Prefix_Sum
3+
// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum #Level_1_Day_1_Prefix_Sum
44
// #2022_03_24_Time_2_ms_(69.67%)_Space_52.1_MB_(59.19%)
55

66
publicclassSolution {

‎src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
packageg0701_0800.s0735_asteroid_collision;
22

3-
// #Medium #Array #Stack #Level_2_Day_18_Stack #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%)
3+
// #Medium #Array #Stack #LeetCode_75_Stack #Level_2_Day_18_Stack
4+
// #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%)
45

56
importjava.util.Deque;
67
importjava.util.LinkedList;

‎src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,8 @@
11
packageg0701_0800.s0739_daily_temperatures;
22

3-
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
4-
// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)
3+
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack
4+
// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n)
5+
// #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)
56

67
@SuppressWarnings("java:S135")
78
publicclassSolution {

‎src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
packageg0701_0800.s0746_min_cost_climbing_stairs;
22

3-
// #Easy #Array #Dynamic_Programming #Dynamic_Programming_I_Day_2
3+
// #Easy #Array #Dynamic_Programming #LeetCode_75_DP/1D #Dynamic_Programming_I_Day_2
44
// #Level_1_Day_11_Dynamic_Programming #2022_03_25_Time_1_ms_(86.38%)_Space_43.6_MB_(54.14%)
55

66
publicclassSolution {

0 commit comments

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