Skip to content

Commit 2d73cbf

Browse files
javadevjavadev
authored
Added tag LeetCode_75
1 parent 04723b5 commit 2d73cbf

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
package g0001_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
public class Solution {
88
public int maxArea(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
package g0001_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
import java.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
package g0001_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
public class Solution {
99
public int uniquePaths(int m, int n) {

‎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
package g0001_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
package g0101_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
package g0101_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
public class Solution {
99
public int singleNumber(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
package g0101_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
public class Solution {
77
public String reverseWords(String s) {

‎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
package g0101_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
public class Solution {

‎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
package g0101_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

0 commit comments

Comments
 (0)