Skip to content

Added tag LeetCode_75 #1960

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Apr 13, 2025
Merged

Added tag LeetCode_75 #1960

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
241e26e
Added tag LeetCode_75
javadev Apr 13, 2025
4c3b00b
Added tag
javadev Apr 13, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
182 changes: 91 additions & 91 deletions README.md
View file
Open in desktop

Large diffs are not rendered by default.

4 changes: 2 additions & 2 deletions src/main/java/g0001_0100/s0011_container_with_most_water/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0001_0100.s0011_container_with_most_water;

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

public class Solution {
public int maxArea(int[] height) {
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0001_0100.s0017_letter_combinations_of_a_phone_number;

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

import java.util.ArrayList;
Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0001_0100/s0062_unique_paths/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
package g0001_0100.s0062_unique_paths;

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

public class Solution {
public int uniquePaths(int m, int n) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0001_0100/s0072_edit_distance/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0001_0100.s0072_edit_distance;

// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
// #2024_11_11_Time_3_ms_(97.19%)_Space_43.2_MB_(98.23%)
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0101_0200.s0104_maximum_depth_of_binary_tree;

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree
// #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
// #2024_11_13_Time_0_ms_(100.00%)_Space_42.2_MB_(88.11%)
Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0101_0200/s0136_single_number/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
package g0101_0200.s0136_single_number;

// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1)
// #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)
// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
// #Big_O_Time_O(N)_Space_O(1) #2024_11_13_Time_1_ms_(99.86%)_Space_46_MB_(49.33%)

public class Solution {
public int singleNumber(int[] nums) {
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0101_0200/s0151_reverse_words_in_a_string/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0101_0200.s0151_reverse_words_in_a_string;

// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String
// #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%)
// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings
// #Top_Interview_150_Array/String #2025_03_06_Time_2_ms_(99.69%)_Space_42.48_MB_(97.99%)

public class Solution {
public String reverseWords(String s) {
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0101_0200/s0162_find_peak_element/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0101_0200.s0162_find_peak_element;

// #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
// #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
// #Medium #Top_Interview_Questions #Array #Binary_Search #LeetCode_75_Binary_Search
// #Algorithm_II_Day_2_Binary_Search #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
// #2025_03_06_Time_0_ms_(100.00%)_Space_42.78_MB_(21.39%)

public class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0198_house_robber/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0101_0200.s0198_house_robber;

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

Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0101_0200/s0199_binary_tree_right_side_view/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0101_0200.s0199_binary_tree_right_side_view;

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

import com_github_leetcode.TreeNode;
import java.util.ArrayList;
Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0201_0300/s0206_reverse_linked_list/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
package g0201_0300.s0206_reverse_linked_list;

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

import com_github_leetcode.ListNode;

Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0208_implement_trie_prefix_tree/Trie.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0208_implement_trie_prefix_tree;

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

Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,9 +1,9 @@
package g0201_0300.s0215_kth_largest_element_in_an_array;

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue
// #Top_Interview_150_Heap #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%)
// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
// #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%)

import java.util.Arrays;

Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0216_combination_sum_iii/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0201_0300.s0216_combination_sum_iii;

// #Medium #Array #Backtracking #Udemy_Backtracking/Recursion
// #Medium #Array #Backtracking #LeetCode_75_Backtracking #Udemy_Backtracking/Recursion
// #2022_07_02_Time_1_ms_(81.35%)_Space_41.8_MB_(46.36%)

import java.util.ArrayList;
Expand Down
5 changes: 3 additions & 2 deletions src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,9 @@
package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree;

// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
// #Big_O_Time_O(n)_Space_O(n) #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)
// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
// #2024_11_16_Time_6_ms_(100.00%)_Space_44_MB_(98.99%)

import com_github_leetcode.TreeNode;

Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0201_0300/s0238_product_of_array_except_self/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0201_0300.s0238_product_of_array_except_self;

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

public class Solution {
public int[] productExceptSelf(int[] nums) {
Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0201_0300/s0283_move_zeroes/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0201_0300.s0283_move_zeroes;

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

public class Solution {
public void moveZeroes(int[] nums) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0301_0400/s0328_odd_even_linked_list/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0328_odd_even_linked_list;

// #Medium #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
// #Medium #Linked_List #LeetCode_75_LinkedList #Level_2_Day_4_Linked_List #Udemy_Linked_List
// #2022_07_09_Time_0_ms_(100.00%)_Space_44.8_MB_(44.32%)

import com_github_leetcode.ListNode;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0301_0400/s0334_increasing_triplet_subsequence/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0334_increasing_triplet_subsequence;

// #Medium #Array #Greedy #Data_Structure_II_Day_5_Array
// #Medium #Array #Greedy #LeetCode_75_Array/String #Data_Structure_II_Day_5_Array
// #2022_07_10_Time_2_ms_(99.33%)_Space_93.5_MB_(47.20%)

public class Solution {
Expand Down
5 changes: 3 additions & 2 deletions src/main/java/g0301_0400/s0338_counting_bits/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
package g0301_0400.s0338_counting_bits;

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

public class Solution {
public int[] countBits(int num) {
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g0301_0400.s0345_reverse_vowels_of_a_string;

// #Easy #String #Two_Pointers #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%)
// #Easy #String #Two_Pointers #LeetCode_75_Array/String
// #2022_07_11_Time_3_ms_(98.02%)_Space_42.2_MB_(98.08%)

public class Solution {
private boolean isVowel(char c) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0301_0400/s0374_guess_number_higher_or_lower/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0301_0400.s0374_guess_number_higher_or_lower;

// #Easy #Binary_Search #Interactive #Binary_Search_I_Day_1
// #Easy #Binary_Search #Interactive #LeetCode_75_Binary_Search #Binary_Search_I_Day_1
// #2022_07_12_Time_0_ms_(100.00%)_Space_40.4_MB_(74.20%)

/*
Expand Down
6 changes: 3 additions & 3 deletions src/main/java/g0301_0400/s0392_is_subsequence/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
package g0301_0400.s0392_is_subsequence;

// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19
// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers
// #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)
// #Easy #String #Dynamic_Programming #Two_Pointers #LeetCode_75_Two_Pointers
// #Dynamic_Programming_I_Day_19 #Level_1_Day_2_String #Udemy_Two_Pointers
// #Top_Interview_150_Two_Pointers #2025_03_09_Time_1_ms_(93.13%)_Space_41.65_MB_(37.86%)

public class Solution {
public boolean isSubsequence(String s, String t) {
Expand Down
5 changes: 3 additions & 2 deletions src/main/java/g0301_0400/s0394_decode_string/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
package g0301_0400.s0394_decode_string;

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

public class Solution {
private int i = 0;
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0301_0400/s0399_evaluate_division/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
package g0301_0400.s0399_evaluate_division;

// #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path
// #Top_Interview_150_Graph_General #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%)
// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General
// #2022_07_15_Time_1_ms_(99.52%)_Space_43_MB_(20.05%)

import java.util.HashMap;
import java.util.List;
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0401_0500/s0435_non_overlapping_intervals/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0401_0500.s0435_non_overlapping_intervals;

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

import java.util.Arrays;

Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0401_0500/s0437_path_sum_iii/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0401_0500.s0437_path_sum_iii;

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

import com_github_leetcode.TreeNode;
import java.util.HashMap;
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0401_0500/s0443_string_compression/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g0401_0500.s0443_string_compression;

// #Medium #String #Two_Pointers #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)
// #Medium #String #Two_Pointers #LeetCode_75_Array/String
// #2022_07_16_Time_2_ms_(65.35%)_Space_44.8_MB_(14.78%)

public class Solution {
/* This is breaking the rules, it's not in-place. */
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0401_0500/s0450_delete_node_in_a_bst/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0401_0500.s0450_delete_node_in_a_bst;

// #Medium #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_II_Day_16_Tree
// #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%)
// #Medium #Tree #Binary_Tree #Binary_Search_Tree #LeetCode_75_Binary_Search_Tree
// #Data_Structure_II_Day_16_Tree #2022_07_18_Time_0_ms_(100.00%)_Space_50.2_MB_(16.59%)

import com_github_leetcode.TreeNode;

Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons;

// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals
// #Medium #Array #Sorting #Greedy #LeetCode_75_Intervals #Top_Interview_150_Intervals
// #2025_03_09_Time_52_ms_(89.91%)_Space_68.86_MB_(77.92%)

import java.util.Arrays;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0501_0600/s0547_number_of_provinces/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0501_0600.s0547_number_of_provinces;

// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find
// #Medium #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #LeetCode_75_Graphs/DFS
// #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
// #Graph_Theory_I_Day_8_Standard_Traversal #Level_2_Day_19_Union_Find
// #2022_08_02_Time_2_ms_(69.51%)_Space_54.2_MB_(42.16%)
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0601_0700/s0605_can_place_flowers/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g0601_0700.s0605_can_place_flowers;

// #Easy #Array #Greedy #Udemy_Arrays #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%)
// #Easy #Array #Greedy #LeetCode_75_Array/String #Udemy_Arrays
// #2022_03_21_Time_1_ms_(96.77%)_Space_51.2_MB_(61.33%)

public class Solution {
public boolean canPlaceFlowers(int[] flowerbed, int n) {
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0601_0700/s0643_maximum_average_subarray_i/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g0601_0700.s0643_maximum_average_subarray_i;

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

public class Solution {
public double findMaxAverage(int[] nums, int k) {
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0601_0700/s0649_dota2_senate/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g0601_0700.s0649_dota2_senate;

// #Medium #String #Greedy #Queue #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%)
// #Medium #String #Greedy #Queue #LeetCode_75_Queue
// #2022_03_21_Time_4_ms_(95.00%)_Space_41.8_MB_(93.75%)

public class Solution {
public String predictPartyVictory(String senate) {
Expand Down
4 changes: 2 additions & 2 deletions src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0601_0700.s0700_search_in_a_binary_search_tree;

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

import com_github_leetcode.TreeNode;

Expand Down
4 changes: 2 additions & 2 deletions .../java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee;

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

public class Solution {
public int maxProfit(int[] prices, int fee) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0701_0800/s0724_find_pivot_index/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0701_0800.s0724_find_pivot_index;

// #Easy #Array #Prefix_Sum #Level_1_Day_1_Prefix_Sum
// #Easy #Array #Prefix_Sum #LeetCode_75_Prefix_Sum #Level_1_Day_1_Prefix_Sum
// #2022_03_24_Time_2_ms_(69.67%)_Space_52.1_MB_(59.19%)

public class Solution {
Expand Down
3 changes: 2 additions & 1 deletion src/main/java/g0701_0800/s0735_asteroid_collision/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
package g0701_0800.s0735_asteroid_collision;

// #Medium #Array #Stack #Level_2_Day_18_Stack #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%)
// #Medium #Array #Stack #LeetCode_75_Stack #Level_2_Day_18_Stack
// #2022_03_25_Time_2_ms_(99.59%)_Space_43.1_MB_(91.77%)

import java.util.Deque;
import java.util.LinkedList;
Expand Down
5 changes: 3 additions & 2 deletions src/main/java/g0701_0800/s0739_daily_temperatures/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
package g0701_0800.s0739_daily_temperatures;

// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
// #Big_O_Time_O(n)_Space_O(n) #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack
// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n)
// #2024_11_17_Time_8_ms_(96.83%)_Space_60.6_MB_(55.93%)

@SuppressWarnings("java:S135")
public class Solution {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0701_0800/s0746_min_cost_climbing_stairs/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
package g0701_0800.s0746_min_cost_climbing_stairs;

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

public class Solution {
Expand Down
Loading