Skip to content

Commit 0f77520

Browse files
javadevjavadev
authored
Updated tasks 41-102
1 parent 6e5bbb8 commit 0f77520

File tree

27 files changed

+135
-140
lines changed

27 files changed

+135
-140
lines changed

‎LeetCodeNet/G0001_0100/S0041_first_missing_positive/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespace LeetCodeNet.G0001_0100.S0041_first_missing_positive {
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Udemy_Arrays
4-
// #Big_O_Time_O(n)_Space_O(n) #2024_01_11_Time_178_ms_(36.64%)_Space_57.6_MB_(32.67%)
4+
// #Big_O_Time_O(n)_Space_O(n) #2025_06_13_Time_2_ms_(75.71%)_Space_64.37_MB_(37.65%)
55

66
public class Solution {
77
public int FirstMissingPositive(int[] nums) {

‎LeetCodeNet/G0001_0100/S0042_trapping_rain_water/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0042_trapping_rain_water {
33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Two_Pointers
44
// #Stack #Monotonic_Stack #Dynamic_Programming_I_Day_9 #Udemy_Two_Pointers
55
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6-
// #2023_12_28_Time_81_ms_(89.96%)_Space_44.5_MB_(13.62%)
6+
// #2025_06_13_Time_1_ms_(63.59%)_Space_47.29_MB_(68.13%)
77

88
public class Solution {
99
public int Trap(int[] height) {

‎LeetCodeNet/G0001_0100/S0045_jump_game_ii/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0045_jump_game_ii {
33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_4
55
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_01_11_Time_85_ms_(88.80%)_Space_44.1_MB_(33.81%)
6+
// #2025_06_13_Time_0_ms_(100.00%)_Space_45.96_MB_(59.61%)
77

88
public class Solution {
99
public int Jump(int[] nums) {

‎LeetCodeNet/G0001_0100/S0046_permutations/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0046_permutations {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Backtracking
44
// #Algorithm_I_Day_11_Recursion_Backtracking #Level_2_Day_20_Brute_Force/Backtracking
55
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(n*n!)_Space_O(n+n!)
6-
// #2024_01_11_Time_96_ms_(96.56%)_Space_46.4_MB_(12.40%)
6+
// #2025_06_13_Time_1_ms_(85.02%)_Space_47.83_MB_(33.15%)
77

88
using System.Collections.Generic;
99

‎LeetCodeNet/G0001_0100/S0048_rotate_image/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0048_rotate_image {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Matrix
44
// #Data_Structure_II_Day_3_Array #Programming_Skills_II_Day_7 #Udemy_2D_Arrays/Matrix
55
// #Top_Interview_150_Matrix #Big_O_Time_O(n^2)_Space_O(1)
6-
// #2024_01_04_Time_92_ms_(97.78%)_Space_45.7_MB_(9.23%)
6+
// #2025_06_13_Time_0_ms_(100.00%)_Space_46.67_MB_(84.34%)
77

88
public class Solution {
99
public void Rotate(int[][] matrix) {

‎LeetCodeNet/G0001_0100/S0049_group_anagrams/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0049_group_anagrams {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #String #Hash_Table #Sorting
44
// #Data_Structure_II_Day_8_String #Programming_Skills_II_Day_11 #Udemy_Strings
55
// #Top_Interview_150_Hashmap #Big_O_Time_O(n*k_log_k)_Space_O(n)
6-
// #2024_01_04_Time_145_ms_(96.20%)_Space_80.2_MB_(38.80%)
6+
// #2025_06_13_Time_17_ms_(83.74%)_Space_66.82_MB_(51.04%)
77

88
public class Solution {
99
public IList<IList<string>> GroupAnagrams(string[] strs) {

‎LeetCodeNet/G0001_0100/S0051_n_queens/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
namespace LeetCodeNet.G0001_0100.S0051_n_queens {
22

33
// #Hard #Top_100_Liked_Questions #Array #Backtracking #Big_O_Time_O(N!)_Space_O(N)
4-
// #2024_01_04_Time_106_ms_(96.34%)_Space_54.6_MB_(5.79%)
4+
// #2025_06_13_Time_14_ms_(47.20%)_Space_56.24_MB_(10.62%)
55

66
public class Solution {
77
public IList<IList<string>> SolveNQueens(int n) {

‎LeetCodeNet/G0001_0100/S0053_maximum_subarray/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0053_maximum_subarray {
33
// #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 #Top_Interview_150_Kadane's_Algorithm #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_01_11_Time_270_ms_(38.35%)_Space_62.7_MB_(7.88%)
6+
// #2025_06_13_Time_1_ms_(100.00%)_Space_63.72_MB_(62.67%)
77

88
public class Solution {
99
public int MaxSubArray(int[] nums) {

‎LeetCodeNet/G0001_0100/S0055_jump_game/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0055_jump_game {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
44
// #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
55
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_01_04_Time_189_ms_(38.02%)_Space_61.6_MB_(81.87%)
6+
// #2025_06_13_Time_1_ms_(99.82%)_Space_61.18_MB_(41.64%)
77

88
public class Solution {
99
public bool CanJump(int[] nums) {

‎LeetCodeNet/G0001_0100/S0056_merge_intervals/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0056_merge_intervals {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting
44
// #Data_Structure_II_Day_2_Array #Level_2_Day_17_Interval #Udemy_2D_Arrays/Matrix
55
// #Top_Interview_150_Intervals #Big_O_Time_O(n_log_n)_Space_O(n)
6-
// #2024_01_05_Time_149_ms_(89.48%)_Space_55.6_MB_(11.71%)
6+
// #2025_06_13_Time_6_ms_(39.00%)_Space_56.11_MB_(92.27%)
77

88
public class Solution {
99
public int[][] Merge(int[][] intervals) {

‎LeetCodeNet/G0001_0100/S0062_unique_paths/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0062_unique_paths {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
44
// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
55
// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
6-
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_01_05_Time_16_ms_(93.42%)_Space_26.2_MB_(96.08%)
6+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_06_13_Time_0_ms_(100.00%)_Space_28.91_MB_(75.80%)
77

88
public class Solution {
99
public int UniquePaths(int m, int n) {

‎LeetCodeNet/G0001_0100/S0064_minimum_path_sum/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0064_minimum_path_sum {
22

33
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Matrix
44
// #Dynamic_Programming_I_Day_16 #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP
5-
// #Big_O_Time_O(m*n)_Space_O(m*n) #2024_01_05_Time_74_ms_(94.37%)_Space_42.6_MB_(18.50%)
5+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_06_13_Time_1_ms_(100.00%)_Space_46.72_MB_(52.77%)
66

77
public class Solution {
88
public int MinPathSum(int[][] grid) {

‎LeetCodeNet/G0001_0100/S0070_climbing_stairs/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0070_climbing_stairs {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math #Memoization
44
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_2
55
// #Level_1_Day_10_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
6-
// #Big_O_Time_O(n)_Space_O(n) #2024_01_05_Time_15_ms_(94.90%)_Space_26.2_MB_(96.48%)
6+
// #Big_O_Time_O(n)_Space_O(n) #2025_06_13_Time_0_ms_(100.00%)_Space_29.08_MB_(56.18%)
77

88
public class Solution {
99
public int ClimbStairs(int n) {

‎LeetCodeNet/G0001_0100/S0072_edit_distance/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0072_edit_distance {
33
// #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)
6-
// #2024_01_05_Time_51_ms_(95.38%)_Space_44.5_MB_(20.65%)
6+
// #2025_06_13_Time_4_ms_(89.69%)_Space_46.23_MB_(62.11%)
77

88
public class Solution {
99
public int MinDistance(string word1, string word2) {

‎LeetCodeNet/G0001_0100/S0073_set_matrix_zeroes/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0073_set_matrix_zeroes {
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Matrix
44
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Matrix #Big_O_Time_O(m*n)_Space_O(1)
5-
// #2024_01_05_Time_124_ms_(96.92%)_Space_52_MB_(9.38%)
5+
// #2025_06_13_Time_2_ms_(73.03%)_Space_53.69_MB_(33.71%)
66

77
public class Solution {
88
// Approach: Use first row and first column for storing whether in future

‎LeetCodeNet/G0001_0100/S0074_search_a_2d_matrix/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0074_search_a_2d_matrix {
33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Data_Structure_I_Day_5_Array
44
// #Algorithm_II_Day_1_Binary_Search #Binary_Search_I_Day_8 #Level_2_Day_8_Binary_Search
55
// #Udemy_2D_Arrays/Matrix #Top_Interview_150_Binary_Search #Big_O_Time_O(endRow+endCol)_Space_O(1)
6-
// #2024_01_05_Time_76_ms_(90.98%)_Space_43.2_MB_(9.93%)
6+
// #2025_06_13_Time_0_ms_(100.00%)_Space_44.41_MB_(51.93%)
77

88
public class Solution {
99
public bool SearchMatrix(int[][] matrix, int target) {

‎LeetCodeNet/G0001_0100/S0075_sort_colors/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0075_sort_colors {
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Two_Pointers
44
// #Data_Structure_II_Day_2_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_01_05_Time_98_ms_(93.59%)_Space_45.3_MB_(5.46%)
5+
// #2025_06_13_Time_0_ms_(100.00%)_Space_46.46_MB_(73.50%)
66

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

‎LeetCodeNet/G0001_0100/S0076_minimum_window_substring/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0076_minimum_window_substring {
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
44
// #Level_2_Day_14_Sliding_Window/Two_Pointer #Top_Interview_150_Sliding_Window
5-
// #Big_O_Time_O(s.length())_Space_O(1) #2024_01_05_Time_56_ms_(98.72%)_Space_42.6_MB_(42.02%)
5+
// #Big_O_Time_O(s.length())_Space_O(1) #2025_06_13_Time_3_ms_(99.36%)_Space_44.55_MB_(73.13%)
66

77
public class Solution {
88
public string MinWindow(string s, string t) {

‎LeetCodeNet/G0001_0100/S0078_subsets/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0078_subsets {
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation #Backtracking
44
// #Algorithm_II_Day_9_Recursion_Backtracking #Udemy_Backtracking/Recursion
5-
// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2024_01_05_Time_101_ms_(94.29%)_Space_45.7_MB_(8.93%)
5+
// #Big_O_Time_O(2^n)_Space_O(n*2^n) #2025_06_13_Time_0_ms_(100.00%)_Space_46.76_MB_(82.95%)
66

77
using System.Collections.Generic;
88

‎LeetCodeNet/G0001_0100/S0079_word_search/Solution.cs

Lines changed: 1 addition & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0079_word_search {
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Matrix #Backtracking
44
// #Algorithm_II_Day_11_Recursion_Backtracking #Top_Interview_150_Backtracking
5-
// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2024_01_05_Time_152_ms_(99.69%)_Space_42.3_MB_(26.96%)
5+
// #Big_O_Time_O(4^(m*n))_Space_O(m*n) #2025_06_13_Time_100_ms_(95.52%)_Space_42.99_MB_(98.44%)
66

77
public class Solution {
88
public bool Exist(char[][] board, string word) {
@@ -26,7 +26,6 @@ private bool helper(int r, int c, char[][] board, string word, int count) {
2626
char currChar = board[r][c];
2727
board[r][c] = '!';
2828
char nextChar = word[count];
29-
3029
if (r > 0 && board[r - 1][c] == nextChar) {
3130
if (helper(r - 1, c, board, word, count + 1)) return true;
3231
}

‎LeetCodeNet/G0001_0100/S0084_largest_rectangle_in_histogram/Solution.cs

Lines changed: 8 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,24 +1,20 @@
11
namespace LeetCodeNet.G0001_0100.S0084_largest_rectangle_in_histogram {
22

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Array #Stack #Monotonic_Stack
4-
// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2024_01_08_Time_304_ms_(30.92%)_Space_52.4_MB_(29.92%)
4+
// #Big_O_Time_O(n_log_n)_Space_O(log_n) #2025_06_13_Time_5_ms_(100.00%)_Space_57.76_MB_(41.84%)
55

66
public class Solution {
77
public int LargestRectangleArea(int[] heights) {
8-
int maxArea = 0, i = 0;
8+
int len = heights.Length;
9+
int maxArea = 0;
910
Stack<int> stack = new Stack<int>();
10-
while (i <= heights.Length) {
11-
var currHeight = i == heights.Length ? 0 : heights[i];
12-
if (!stack.Any() || currHeight >= heights[stack.Peek()]) {
13-
stack.Push(i);
14-
i++;
15-
}
16-
else {
17-
int index = stack.Pop();
18-
int height = heights[index];
19-
int width = (!stack.Any()) ? i : (i - 1) - stack.Peek();
11+
for (int i = 0; i <= len; i++) {
12+
while (stack.Count > 0 && (i == len || heights[stack.Peek()] >= (i < len ? heights[i] : 0))) {
13+
int height = heights[stack.Pop()];
14+
int width = stack.Count == 0 ? i : i - stack.Peek() - 1;
2015
maxArea = Math.Max(maxArea, height * width);
2116
}
17+
stack.Push(i);
2218
}
2319
return maxArea;
2420
}

‎LeetCodeNet/G0001_0100/S0094_binary_tree_inorder_traversal/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0094_binary_tree_inorder_traversal {
22

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
44
// #Stack #Data_Structure_I_Day_10_Tree #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
5-
// #2024_01_08_Time_90_ms_(99.30%)_Space_45.5_MB_(6.37%)
5+
// #2025_06_13_Time_0_ms_(100.00%)_Space_46.64_MB_(63.38%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0001_0100/S0096_unique_binary_search_trees/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@ namespace LeetCodeNet.G0001_0100.S0096_unique_binary_search_trees {
22

33
// #Medium #Dynamic_Programming #Math #Tree #Binary_Tree #Binary_Search_Tree
44
// #Dynamic_Programming_I_Day_11 #Big_O_Time_O(n)_Space_O(1)
5-
// #2024_01_08_Time_13_ms_(98.48%)_Space_26.2_MB_(88.64%)
5+
// #2025_06_13_Time_0_ms_(100.00%)_Space_28.70_MB_(95.42%)
66

77
public class Solution {
88
public int NumTrees(int n) {

‎LeetCodeNet/G0001_0100/S0098_validate_binary_search_tree/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0001_0100.S0098_validate_binary_search_tree {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Tree #Binary_Tree
44
// #Binary_Search_Tree #Data_Structure_I_Day_14_Tree #Level_1_Day_8_Binary_Search_Tree
55
// #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(N)_Space_O(log(N))
6-
// #2024_01_08_Time_75_ms_(97.31%)_Space_45.3_MB_(19.73%)
6+
// #2025_06_13_Time_0_ms_(100.00%)_Space_46.68_MB_(61.87%)
77

88
using LeetCodeNet.Com_github_leetcode;
99

‎LeetCodeNet/G0101_0200/S0101_symmetric_tree/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0101_symmetric_tree {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
44
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_2_Day_15_Tree
55
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(log(N))
6-
// #2024_01_08_Time_64_ms_(97.79%)_Space_42.9_MB_(23.56%)
6+
// #2025_06_13_Time_0_ms_(100.00%)_Space_44.58_MB_(38.09%)
77

88
using LeetCodeNet.Com_github_leetcode;
99

‎LeetCodeNet/G0101_0200/S0102_binary_tree_level_order_traversal/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0102_binary_tree_level_order_traversal {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Breadth_First_Search #Tree
44
// #Binary_Tree #Data_Structure_I_Day_11_Tree #Level_1_Day_6_Tree #Udemy_Tree_Stack_Queue
55
// #Top_Interview_150_Binary_Tree_BFS #Big_O_Time_O(N)_Space_O(N)
6-
// #2024_01_09_Time_97_ms_(98.14%)_Space_47.4_MB_(12.94%)
6+
// #2025_06_13_Time_0_ms_(100.00%)_Space_48.60_MB_(46.34%)
77

88
using LeetCodeNet.Com_github_leetcode;
99

0 commit comments

Comments
 (0)