Skip to content

Commit 18be57c

Browse files
javadevjavadev
authored
Revised tags "Difficulty", "Top 100 Liked Questions" and "Top Interview Questions"
1 parent 1ddc8ac commit 18be57c

File tree

68 files changed

+183
-197
lines changed

Some content is hidden

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

68 files changed

+183
-197
lines changed

‎README.md

+80-80

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

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0001_0100.s0010_regular_expression_matching;
22

3-
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming #Recursion
4-
// #Udemy_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2024_01_04_Time_1_ms_(100.00%)_Space_42.1_MB_(29.26%)
3+
// #Hard #Top_Interview_Questions #String #Dynamic_Programming #Recursion #Udemy_Dynamic_Programming
4+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_01_04_Time_1_ms_(100.00%)_Space_42.1_MB_(29.26%)
65

76
public class Solution {
87
private Boolean[][] cache;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0001_0100.s0013_roman_to_integer;
22

3-
// #Easy #Top_Interview_Questions #String #Hash_Table #Math
3+
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Math
44
// #2024_02_11_Time_2_ms_(100.00%)_Space_44.5_MB_(76.62%)
55

66
public class Solution {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0014_longest_common_prefix;
22

3-
// #Easy #Top_Interview_Questions #String #Level_2_Day_2_String #Udemy_Strings
4-
// #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%)
3+
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #String #Level_2_Day_2_String
4+
// #Udemy_Strings #2024_02_11_Time_0_ms_(100.00%)_Space_42_MB_(19.08%)
55

66
public class Solution {
77
public String longestCommonPrefix(String[] strs) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0001_0100.s0053_maximum_subarray;
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Divide_and_Conquer #Data_Structure_I_Day_1_Array #Dynamic_Programming_I_Day_5
55
// #Udemy_Famous_Algorithm #Big_O_Time_O(n)_Space_O(1)
66
// #2023_08_11_Time_1_ms_(100.00%)_Space_57.7_MB_(90.58%)

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0054_spiral_matrix;
22

3-
// #Medium #Top_Interview_Questions #Array #Matrix #Simulation #Programming_Skills_II_Day_8
4-
// #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
3+
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Simulation
4+
// #Programming_Skills_II_Day_8 #Level_2_Day_1_Implementation/Simulation #Udemy_2D_Arrays/Matrix
55
// #2023_08_11_Time_0_ms_(100.00%)_Space_41_MB_(9.67%)
66

77
import java.util.ArrayList;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0001_0100.s0072_edit_distance;
22

3-
// #Hard #Top_100_Liked_Questions #String #Dynamic_Programming
3+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
44
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
55
// #Udemy_Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n2)
66
// #2023_08_11_Time_4_ms_(90.13%)_Space_41.8_MB_(99.78%)

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0001_0100.s0096_unique_binary_search_trees;
22

3-
// #Medium #Top_100_Liked_Questions #Dynamic_Programming #Math #Tree #Binary_Tree
4-
// #Binary_Search_Tree #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
3+
// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
4+
// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
55
// #2022_06_21_Time_0_ms_(100.00%)_Space_40.4_MB_(72.43%)
66

77
public class Solution {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0101_0200.s0118_pascals_triangle;
22

3-
// #Easy #Top_Interview_Questions #Array #Dynamic_Programming #Data_Structure_I_Day_4_Array
4-
// #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
3+
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
4+
// #Data_Structure_I_Day_4_Array #Dynamic_Programming_I_Day_12 #Udemy_Dynamic_Programming
55
// #2022_06_23_Time_1_ms_(67.08%)_Space_42.4_MB_(5.58%)
66

77
import java.util.ArrayList;

‎src/main/java/g0101_0200/s0155_min_stack/MinStack.java

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0101_0200.s0155_min_stack;
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
3+
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Stack #Design
44
// #Data_Structure_II_Day_14_Stack_Queue #Programming_Skills_II_Day_18 #Level_2_Day_16_Design
55
// #Udemy_Design #Big_O_Time_O(1)_Space_O(N) #2022_06_25_Time_3_ms_(100.00%)_Space_44.3_MB_(85.39%)
66

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0101_0200.s0164_maximum_gap;
22

3-
// #Hard #Array #Sorting #Bucket_Sort #Radix_Sort
3+
// #Medium #Array #Sorting #Bucket_Sort #Radix_Sort
44
// #2022_06_25_Time_48_ms_(53.59%)_Space_84.1_MB_(20.66%)
55

66
import java.util.Arrays;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0101_0200.s0199_binary_tree_right_side_view;
22

3-
// #Medium #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
3+
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
44
// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
55
// #2022_06_28_Time_1_ms_(94.57%)_Space_42.9_MB_(41.09%)
66

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

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0201_0300.s0218_the_skyline_problem;
22

3-
// #Hard #Top_Interview_Questions #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer
4-
// #Segment_Tree #Binary_Indexed_Tree #Line_Sweep
5-
// #2022_07_02_Time_22_ms_(76.93%)_Space_52.3_MB_(45.14%)
3+
// #Hard #Array #Heap_Priority_Queue #Ordered_Set #Divide_and_Conquer #Segment_Tree
4+
// #Binary_Indexed_Tree #Line_Sweep #2022_07_02_Time_22_ms_(76.93%)_Space_52.3_MB_(45.14%)
65

76
import java.util.ArrayList;
87
import java.util.Arrays;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0220_contains_duplicate_iii;
22

3-
// #Medium #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort
3+
// #Hard #Array #Sorting #Sliding_Window #Ordered_Set #Bucket_Sort
44
// #2022_07_02_Time_38_ms_(80.90%)_Space_54.1_MB_(52.01%)
55

66
import java.util.HashMap;

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

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0201_0300.s0221_maximal_square;
22

3-
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
4-
// #Dynamic_Programming_I_Day_16 #Big_O_Time_O(m*n)_Space_O(m*n)
5-
// #2022_07_04_Time_7_ms_(72.35%)_Space_59.5_MB_(10.55%)
3+
// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
4+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2022_07_04_Time_7_ms_(72.35%)_Space_59.5_MB_(10.55%)
65

76
public class Solution {
87
public int maximalSquare(char[][] matrix) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0222_count_complete_tree_nodes;
22

3-
// #Medium #Depth_First_Search #Tree #Binary_Search #Binary_Tree #Binary_Search_II_Day_10
3+
// #Easy #Depth_First_Search #Tree #Binary_Search #Binary_Tree #Binary_Search_II_Day_10
44
// #2022_07_04_Time_0_ms_(100.00%)_Space_50_MB_(37.43%)
55

66
import com_github_leetcode.TreeNode;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0227_basic_calculator_ii;
22

3-
// #Medium #Top_Interview_Questions #String #Math #Stack #Level_2_Day_18_Stack
3+
// #Medium #String #Math #Stack #Level_2_Day_18_Stack
44
// #2022_07_04_Time_8_ms_(95.32%)_Space_43.6_MB_(79.36%)
55

66
public class Solution {

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0201_0300.s0230_kth_smallest_element_in_a_bst;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
4-
// #Binary_Search_Tree #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree
5-
// #Big_O_Time_O(n)_Space_O(n) #2022_07_04_Time_1_ms_(78.91%)_Space_45.3_MB_(58.87%)
3+
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
4+
// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
5+
// #2022_07_04_Time_1_ms_(78.91%)_Space_45.3_MB_(58.87%)
66

77
import com_github_leetcode.TreeNode;
88

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0234_palindrome_linked_list;
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Two_Pointers #Stack #Linked_List
4-
// #Recursion #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
3+
// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
4+
// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
55
// #2022_07_04_Time_6_ms_(76.07%)_Space_97.6_MB_(56.14%)
66

77
import com_github_leetcode.ListNode;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree;
22

3-
// #Easy #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree
3+
// #Medium #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree #Data_Structure_I_Day_14_Tree
44
// #Level_1_Day_8_Binary_Search_Tree #2022_07_04_Time_4_ms_(100.00%)_Space_43.2_MB_(90.56%)
55

66
import com_github_leetcode.TreeNode;

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
3+
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
44
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
55
// #2022_07_04_Time_10_ms_(56.51%)_Space_47.4_MB_(45.84%)
66

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

+1-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
package g0201_0300.s0237_delete_node_in_a_linked_list;
22

3-
// #Easy #Top_Interview_Questions #Linked_List
4-
// #2022_07_04_Time_0_ms_(100.00%)_Space_43.8_MB_(62.83%)
3+
// #Medium #Linked_List #2022_07_04_Time_0_ms_(100.00%)_Space_43.8_MB_(62.83%)
54

65
import com_github_leetcode.ListNode;
76

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

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0201_0300.s0238_product_of_array_except_self;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Prefix_Sum
4-
// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Big_O_Time_O(n^2)_Space_O(n)
5-
// #2022_07_04_Time_1_ms_(100.00%)_Space_50.8_MB_(85.60%)
3+
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
4+
// #Big_O_Time_O(n^2)_Space_O(n) #2022_07_04_Time_1_ms_(100.00%)_Space_50.8_MB_(85.60%)
65

76
public class Solution {
87
public int[] productExceptSelf(int[] nums) {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0239_sliding_window_maximum;
22

3-
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Heap_Priority_Queue
4-
// #Sliding_Window #Queue #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
3+
// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
4+
// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
55
// #2022_07_04_Time_58_ms_(52.28%)_Space_145_MB_(50.60%)
66

77
import java.util.LinkedList;

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0201_0300.s0240_search_a_2d_matrix_ii;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Matrix
4-
// #Divide_and_Conquer #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8
5-
// #Big_O_Time_O(n+m)_Space_O(1) #2022_07_04_Time_7_ms_(86.73%)_Space_58.4_MB_(9.95%)
3+
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
4+
// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
5+
// #2022_07_04_Time_7_ms_(86.73%)_Space_58.4_MB_(9.95%)
66

77
public class Solution {
88
public boolean searchMatrix(int[][] matrix, int target) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0242_valid_anagram;
22

3-
// #Easy #Top_Interview_Questions #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
3+
// #Easy #String #Hash_Table #Sorting #Data_Structure_I_Day_6_String
44
// #Programming_Skills_I_Day_11_Containers_and_Libraries #Udemy_Strings
55
// #2022_07_05_Time_2_ms_(99.01%)_Space_42.4_MB_(91.86%)
66

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0201_0300.s0268_missing_number;
22

3-
// #Easy #Top_Interview_Questions #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation
3+
// #Easy #Array #Hash_Table #Math #Sorting #Binary_Search #Bit_Manipulation
44
// #2022_07_05_Time_1_ms_(72.07%)_Space_50.6_MB_(76.88%)
55

66
public class Solution {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0279_perfect_squares;
22

3-
// #Medium #Top_Interview_Questions #Dynamic_Programming #Math #Breadth_First_Search
4-
// #Dynamic_Programming_I_Day_21 #2022_07_06_Time_1_ms_(100.00%)_Space_40.2_MB_(99.44%)
3+
// #Medium #Dynamic_Programming #Math #Breadth_First_Search #Dynamic_Programming_I_Day_21
4+
// #2022_07_06_Time_1_ms_(100.00%)_Space_40.2_MB_(99.44%)
55

66
public class Solution {
77
private boolean validSquare(int n) {

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0201_0300.s0283_move_zeroes;
22

3-
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #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) #2022_07_06_Time_2_ms_(79.54%)_Space_55.7_MB_(5.98%)
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+
// #2022_07_06_Time_2_ms_(79.54%)_Space_55.7_MB_(5.98%)
66

77
public class Solution {
88
public void moveZeroes(int[] nums) {

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0287_find_the_duplicate_number;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Binary_Search #Two_Pointers
4-
// #Bit_Manipulation #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
3+
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
4+
// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
55
// #2022_07_06_Time_2_ms_(99.82%)_Space_61.1_MB_(83.92%)
66

77
public class Solution {

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

+1-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
package g0201_0300.s0289_game_of_life;
22

3-
// #Medium #Top_Interview_Questions #Array #Matrix #Simulation
4-
// #2022_07_06_Time_0_ms_(100.00%)_Space_42.9_MB_(10.73%)
3+
// #Medium #Array #Matrix #Simulation #2022_07_06_Time_0_ms_(100.00%)_Space_42.9_MB_(10.73%)
54

65
public class Solution {
76
public void gameOfLife(int[][] board) {

‎src/main/java/g0201_0300/s0295_find_median_from_data_stream/MedianFinder.java

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0201_0300.s0295_find_median_from_data_stream;
22

3-
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Design
4-
// #Heap_Priority_Queue #Data_Stream #Big_O_Time_O(n*log_n)_Space_O(n)
5-
// #2022_07_06_Time_151_ms_(80.24%)_Space_125.2_MB_(44.11%)
3+
// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
4+
// #Big_O_Time_O(n*log_n)_Space_O(n) #2022_07_06_Time_151_ms_(80.24%)_Space_125.2_MB_(44.11%)
65

76
import java.util.PriorityQueue;
87

‎src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree/Codec.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0201_0300.s0297_serialize_and_deserialize_binary_tree;
22

3-
// #Hard #Top_Interview_Questions #String #Depth_First_Search #Breadth_First_Search #Tree
4-
// #Binary_Tree #Design #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
3+
// #Hard #String #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree #Design
4+
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
55
// #2022_07_06_Time_7_ms_(98.13%)_Space_51.1_MB_(74.13%)
66

77
import com_github_leetcode.TreeNode;

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

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,8 @@
11
package g0201_0300.s0300_longest_increasing_subsequence;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
4-
// #Binary_Search #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3
5-
// #Dynamic_Programming_I_Day_18 #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
3+
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
4+
// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
5+
// #Udemy_Dynamic_Programming #Big_O_Time_O(n*log_n)_Space_O(n)
66
// #2022_07_06_Time_3_ms_(98.63%)_Space_44.3_MB_(60.27%)
77

88
public class Solution {

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

+2-3
Original file line numberDiff line numberDiff line change
@@ -1,8 +1,7 @@
11
package g0301_0400.s0315_count_of_smaller_numbers_after_self;
22

3-
// #Hard #Top_Interview_Questions #Array #Binary_Search #Ordered_Set #Divide_and_Conquer
4-
// #Segment_Tree #Binary_Indexed_Tree #Merge_Sort
5-
// #2022_07_08_Time_36_ms_(98.63%)_Space_119_MB_(77.48%)
3+
// #Hard #Array #Binary_Search #Ordered_Set #Divide_and_Conquer #Segment_Tree #Binary_Indexed_Tree
4+
// #Merge_Sort #2022_07_08_Time_36_ms_(98.63%)_Space_119_MB_(77.48%)
65

76
import java.util.LinkedList;
87
import java.util.List;

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0301_0400.s0322_coin_change;
22

3-
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
4-
// #Breadth_First_Search #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
3+
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
4+
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
55
// #Level_2_Day_12_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(amount)
66
// #2022_07_09_Time_17_ms_(91.77%)_Space_41.8_MB_(95.50%)
77

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0301_0400.s0324_wiggle_sort_ii;
22

3-
// #Medium #Top_Interview_Questions #Array #Sorting #Divide_and_Conquer #Quickselect
3+
// #Medium #Array #Sorting #Divide_and_Conquer #Quickselect
44
// #2022_07_09_Time_4_ms_(93.22%)_Space_46.4_MB_(85.87%)
55

66
import java.util.Arrays;

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

+1-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,6 @@
11
package g0301_0400.s0326_power_of_three;
22

3-
// #Easy #Top_Interview_Questions #Math #Recursion
4-
// #2022_07_09_Time_18_ms_(85.35%)_Space_47.9_MB_(14.68%)
3+
// #Easy #Math #Recursion #2022_07_09_Time_18_ms_(85.35%)_Space_47.9_MB_(14.68%)
54

65
public class Solution {
76
// regular method that has a loop

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0301_0400.s0328_odd_even_linked_list;
22

3-
// #Medium #Top_Interview_Questions #Linked_List #Level_2_Day_4_Linked_List #Udemy_Linked_List
3+
// #Medium #Linked_List #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
import com_github_leetcode.ListNode;

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

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0301_0400.s0329_longest_increasing_path_in_a_matrix;
22

3-
// #Hard #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search #Breadth_First_Search
4-
// #Graph #Memoization #Topological_Sort #2022_07_09_Time_8_ms_(97.60%)_Space_54.7_MB_(19.13%)
3+
// #Hard #Dynamic_Programming #Depth_First_Search #Breadth_First_Search #Graph #Memoization
4+
// #Topological_Sort #2022_07_09_Time_8_ms_(97.60%)_Space_54.7_MB_(19.13%)
55

66
public class Solution {
77
public int longestIncreasingPath(int[][] matrix) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0301_0400.s0334_increasing_triplet_subsequence;
22

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

66
public class Solution {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
package g0301_0400.s0338_counting_bits;
22

3-
// #Easy #Top_100_Liked_Questions #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
3+
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
44
// #Big_O_Time_O(num)_Space_O(num) #2022_07_10_Time_2_ms_(86.73%)_Space_48.3_MB_(31.59%)
55

66
public class Solution {

‎src/main/java/g0301_0400/s0341_flatten_nested_list_iterator/NestedIterator.java

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
package g0301_0400.s0341_flatten_nested_list_iterator;
22

3-
// #Medium #Top_Interview_Questions #Depth_First_Search #Tree #Stack #Design #Queue #Iterator
4-
// #Programming_Skills_II_Day_18 #2022_07_10_Time_2_ms_(99.95%)_Space_43.2_MB_(94.14%)
3+
// #Medium #Depth_First_Search #Tree #Stack #Design #Queue #Iterator #Programming_Skills_II_Day_18
4+
// #2022_07_10_Time_2_ms_(99.95%)_Space_43.2_MB_(94.14%)
55

66
import com_github_leetcode.NestedInteger;
77
import java.util.ArrayDeque;

0 commit comments

Comments
 (0)