Skip to content

Updated tags for tasks 167-219 #1934

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
Mar 9, 2025
Merged

Updated tags for tasks 167-219 #1934

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
e1eaed3
Updated tags for tasks 167-219
ThanhNIT Mar 9, 2025
04902c4
Update Tree.java
javadev Mar 9, 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
72 changes: 36 additions & 36 deletions README.md
View file
Open in desktop

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Medium #Array #Binary_Search #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
// #Binary_Search_I_Day_7 #Top_Interview_150_Two_Pointers
// #2022_06_25_Time_1_ms_(99.21%)_Space_50.3_MB_(31.33%)
// #2025_03_09_Time_2_ms_(92.62%)_Space_47.15_MB_(64.95%)

public class Solution {
public int[] twoSum(int[] numbers, int target) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0172_factorial_trailing_zeroes/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0101_0200.s0172_factorial_trailing_zeroes;

// #Medium #Top_Interview_Questions #Math #Udemy_Integers #Top_Interview_150_Math
// #2022_06_26_Time_1_ms_(85.61%)_Space_42.1_MB_(7.61%)
// #2025_03_09_Time_0_ms_(100.00%)_Space_40.78_MB_(46.99%)

public class Solution {
public int trailingZeroes(int n) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0173_binary_search_tree_iterator/BSTIterator.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Medium #Tree #Binary_Tree #Stack #Design #Binary_Search_Tree #Iterator
// #Data_Structure_II_Day_17_Tree #Programming_Skills_II_Day_16 #Level_2_Day_9_Binary_Search_Tree
// #Top_Interview_150_Binary_Tree_General #2022_06_26_Time_18_ms_(84.18%)_Space_52.2_MB_(23.01%)
// #Top_Interview_150_Binary_Tree_General #2025_03_09_Time_15_ms_(100.00%)_Space_48.60_MB_(18.83%)

import com_github_leetcode.TreeNode;

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

// #Hard #Array #Dynamic_Programming #Top_Interview_150_Multidimensional_DP
// #2022_06_27_Time_1_ms_(100.00%)_Space_42.7_MB_(47.38%)
// #2025_03_09_Time_1_ms_(99.73%)_Space_41.76_MB_(82.48%)

public class Solution {
public int maxProfit(int k, int[] prices) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0190_reverse_bits/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Easy #Top_Interview_Questions #Bit_Manipulation #Divide_and_Conquer
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Bit_Manipulation #Top_Interview_150_Bit_Manipulation
// #2022_06_27_Time_1_ms_(98.66%)_Space_41.9_MB_(81.78%)
// #2025_03_09_Time_0_ms_(100.00%)_Space_41.94_MB_(43.56%)

public class Solution {
// you need treat n as an unsigned value
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0101_0200/s0191_number_of_1_bits/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Easy #Top_Interview_Questions #Bit_Manipulation #Algorithm_I_Day_13_Bit_Manipulation
// #Programming_Skills_I_Day_2_Operator #Udemy_Bit_Manipulation #Top_Interview_150_Bit_Manipulation
// #2022_06_28_Time_1_ms_(84.87%)_Space_41.8_MB_(10.40%)
// #2025_03_09_Time_0_ms_(100.00%)_Space_41.10_MB_(13.52%)

public class Solution {
public int hammingWeight(int n) {
Expand Down
2 changes: 1 addition & 1 deletion 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
Expand Up @@ -2,7 +2,7 @@

// #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
// #2022_06_28_Time_1_ms_(94.57%)_Space_42.9_MB_(41.09%)
// #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
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0201_bitwise_and_of_numbers_range;

// #Medium #Bit_Manipulation #Algorithm_II_Day_19_Bit_Manipulation
// #Top_Interview_150_Bit_Manipulation #2022_06_28_Time_8_ms_(74.15%)_Space_44.4_MB_(39.54%)
// #Top_Interview_150_Bit_Manipulation #2025_03_09_Time_3_ms_(100.00%)_Space_43.70_MB_(94.56%)

public class Solution {
private static final int[] MASKS =
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0202_happy_number/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Easy #Top_Interview_Questions #Hash_Table #Math #Two_Pointers #Algorithm_II_Day_21_Others
// #Programming_Skills_I_Day_4_Loop #Level_2_Day_1_Implementation/Simulation
// #Top_Interview_150_Hashmap #2022_06_28_Time_1_ms_(98.59%)_Space_41_MB_(64.25%)
// #Top_Interview_150_Hashmap #2025_03_09_Time_0_ms_(100.00%)_Space_40.92_MB_(38.98%)

public class Solution {
public boolean isHappy(int n) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0205_isomorphic_strings/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0205_isomorphic_strings;

// #Easy #String #Hash_Table #Level_1_Day_2_String #Top_Interview_150_Hashmap
// #2022_06_28_Time_2_ms_(99.97%)_Space_43.3_MB_(32.68%)
// #2025_03_09_Time_2_ms_(99.18%)_Space_42.83_MB_(16.73%)

public class Solution {
public boolean isIsomorphic(String s, String t) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0209_minimum_size_subarray_sum/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Medium #Array #Binary_Search #Prefix_Sum #Sliding_Window #Algorithm_II_Day_5_Sliding_Window
// #Binary_Search_II_Day_1 #Top_Interview_150_Sliding_Window
// #2022_06_28_Time_1_ms_(100.00%)_Space_50.1_MB_(11.60%)
// #2025_03_09_Time_1_ms_(99.76%)_Space_58.08_MB_(66.32%)

public class Solution {
public int minSubArrayLen(int target, int[] nums) {
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0210_course_schedule_ii/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Medium #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search #Graph
// #Topological_Sort #Level_2_Day_11_Graph/BFS/DFS #Top_Interview_150_Graph_General
// #2022_06_28_Time_13_ms_(35.17%)_Space_50.7_MB_(22.84%)
// #2025_03_09_Time_4_ms_(91.07%)_Space_45.55_MB_(91.17%)

import java.util.ArrayList;
import java.util.HashMap;
Expand Down
2 changes: 1 addition & 1 deletion ...main/java/g0201_0300/s0211_design_add_and_search_words_data_structure/WordDictionary.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0211_design_add_and_search_words_data_structure;

// #Medium #String #Depth_First_Search #Design #Trie #Top_Interview_150_Trie
// #2023_01_06_Time_308_ms_(99.46%)_Space_284.7_MB_(13.25%)
// #2025_03_09_Time_156_ms_(99.85%)_Space_100.34_MB_(44.69%)

public class WordDictionary {

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

// #Hard #Top_Interview_Questions #Array #String #Matrix #Backtracking #Trie #Top_Interview_150_Trie
// #2022_07_02_Time_21_ms_(99.42%)_Space_44.1_MB_(67.33%)
// #2025_03_09_Time_17_ms_(99.16%)_Space_45.08_MB_(67.05%)

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

// #Hard #Top_Interview_Questions #Array #String #Matrix #Backtracking #Trie #Top_Interview_150_Trie
// #2022_07_02_Time_21_ms_(99.42%)_Space_44.1_MB_(67.33%)

@SuppressWarnings("java:S1104")
public class Tree {
private Tree[] children;
Expand Down
2 changes: 1 addition & 1 deletion src/main/java/g0201_0300/s0219_contains_duplicate_ii/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
package g0201_0300.s0219_contains_duplicate_ii;

// #Easy #Array #Hash_Table #Sliding_Window #Top_Interview_150_Hashmap
// #2022_07_02_Time_15_ms_(99.09%)_Space_56_MB_(82.82%)
// #2025_03_09_Time_15_ms_(98.00%)_Space_57.98_MB_(48.14%)

import java.util.HashMap;
import java.util.Map;
Expand Down