Skip to content

Commit 11528a3

Browse files
javadevjavadev
authored
Updated tasks 104-215
1 parent 0f77520 commit 11528a3

File tree

27 files changed

+148
-144
lines changed

27 files changed

+148
-144
lines changed

‎LeetCodeNet/G0101_0200/S0104_maximum_depth_of_binary_tree/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ namespace LeetCodeNet.G0101_0200.S0104_maximum_depth_of_binary_tree {
44
// #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)
7-
// #2024_01_09_Time_65_ms_(93.31%)_Space_42.3_MB_(9.74%)
7+
// #2025_06_14_Time_0_ms_(100.00%)_Space_43.99_MB_(15.02%)
88

99
using LeetCodeNet.Com_github_leetcode;
1010

‎LeetCodeNet/G0101_0200/S0105_construct_binary_tree_from_preorder_and_inorder_traversal/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Tree #Binary_Tree
44
// #Divide_and_Conquer #Data_Structure_II_Day_15_Tree #Top_Interview_150_Binary_Tree_General
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_01_09_Time_53_ms_(99.83%)_Space_42.5_MB_(46.06%)
5+
// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_1_ms_(96.98%)_Space_44.75_MB_(46.98%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0114_flatten_binary_tree_to_linked_list/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Stack #Linked_List
44
// #Udemy_Linked_List #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(N)
5-
// #2024_01_09_Time_52_ms_(98.71%)_Space_41.3_MB_(6.68%)
5+
// #2025_06_14_Time_0_ms_(100.00%)_Space_43.08_MB_(22.09%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0121_best_time_to_buy_and_sell_stock/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0121_best_time_to_buy_and_sell_stock {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays
55
// #Top_Interview_150_Array/String #Big_O_Time_O(N)_Space_O(1)
6-
// #2024_01_09_Time_328_ms_(35.43%)_Space_58.2_MB_(5.29%)
6+
// #2025_06_14_Time_1_ms_(100.00%)_Space_58.91_MB_(55.50%)
77

88
public class Solution {
99
public int MaxProfit(int[] prices) {

‎LeetCodeNet/G0101_0200/S0124_binary_tree_maximum_path_sum/Solution.cs

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

33
// #Hard #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Depth_First_Search
44
// #Tree #Binary_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_01_09_Time_85_ms_(91.69%)_Space_47.6_MB_(23.52%)
5+
// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_0_ms_(100.00%)_Space_49.31_MB_(15.65%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0128_longest_consecutive_sequence/Solution.cs

Lines changed: 20 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -2,29 +2,33 @@ namespace LeetCodeNet.G0101_0200.S0128_longest_consecutive_sequence {
22

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Union_Find
44
// #Top_Interview_150_Hashmap #Big_O_Time_O(N_log_N)_Space_O(1)
5-
// #2024_01_09_Time_201_ms_(61.50%)_Space_61.2_MB_(52.89%)
5+
// #2025_06_14_Time_16_ms_(100.00%)_Space_75.12_MB_(14.84%)
66

77
public class Solution {
88
public int LongestConsecutive(int[] nums) {
9-
if (nums.Length == 0) {
10-
return 0;
11-
}
12-
Array.Sort(nums);
13-
int max = int.MinValue;
14-
int thsMax = 1;
15-
for (int i = 0; i < nums.Length - 1; i++) {
16-
if (nums[i + 1] == nums[i] + 1) {
17-
thsMax += 1;
9+
Dictionary<int, int> mapToHighest = new(nums.Length);
10+
int best = 0;
11+
for (int i = 0; i < nums.Length; i++) {
12+
int rangeLow = 0;
13+
int rangeHigh = 0;
14+
if (mapToHighest.ContainsKey(nums[i])) {
1815
continue;
1916
}
20-
if (nums[i + 1] == nums[i]) {
21-
continue;
17+
if (mapToHighest.TryGetValue(nums[i]-1, out var downCount)) {
18+
rangeLow = downCount;
19+
}
20+
if (mapToHighest.TryGetValue(nums[i]+1, out var upCount)) {
21+
rangeHigh = upCount;
22+
}
23+
int thisSum = rangeLow + rangeHigh + 1;
24+
mapToHighest[nums[i] - rangeLow] = thisSum;
25+
mapToHighest[nums[i] + rangeHigh] = thisSum;
26+
if (rangeLow != 0 && rangeHigh != 0) {
27+
mapToHighest[nums[i]] = 1;
2228
}
23-
// Start of a new Sequene
24-
max = Math.Max(max, thsMax);
25-
thsMax = 1;
29+
best = Math.Max(thisSum, best);
2630
}
27-
return Math.Max(max, thsMax);
31+
return best;
2832
}
2933
}
3034
}

‎LeetCodeNet/G0101_0200/S0131_palindrome_partitioning/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Dynamic_Programming
44
// #Backtracking #Big_O_Time_O(N*2^N)_Space_O(2^N*N)
5-
// #2024_01_09_Time_677_ms_(38.30%)_Space_148_MB_(5.53%)
5+
// #2025_06_14_Time_19_ms_(39.67%)_Space_84.16_MB_(63.28%)
66

77
public class Solution {
88
public IList<IList<string>> Partition(string s) {

‎LeetCodeNet/G0101_0200/S0136_single_number/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0136_single_number {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
44
// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
55
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
6-
// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_87_ms_(93.37%)_Space_45.1_MB_(38.04%)
6+
// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_46.90_MB_(50.83%)
77

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

‎LeetCodeNet/G0101_0200/S0138_copy_list_with_random_pointer/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Linked_List
44
// #Programming_Skills_II_Day_14 #Udemy_Linked_List #Top_Interview_150_Linked_List
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_01_09_Time_59_ms_(96.51%)_Space_41.4_MB_(18.90%)
5+
// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_77_ms_(48.03%)_Space_43.05_MB_(30.16%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0139_word_break/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0139_word_break {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table
44
// #Dynamic_Programming #Trie #Memoization #Algorithm_II_Day_15_Dynamic_Programming
55
// #Dynamic_Programming_I_Day_9 #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
6-
// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2024_01_09_Time_64_ms_(98.44%)_Space_49.2_MB_(10.24%)
6+
// #Big_O_Time_O(M+max*N)_Space_O(M+N+max) #2025_06_14_Time_6_ms_(55.14%)_Space_51.82_MB_(11.12%)
77

88
public class Solution {
99
private Dictionary<string, bool> visited = new();

‎LeetCodeNet/G0101_0200/S0141_linked_list_cycle/Solution.cs

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
44
// #Data_Structure_I_Day_7_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
5-
// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_76_ms_(99.02%)_Space_46.5_MB_(16.05%)
5+
// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_107_ms_(37.72%)_Space_47.78_MB_(44.58%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0142_linked_list_cycle_ii/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Hash_Table #Two_Pointers #Linked_List
44
// #Data_Structure_II_Day_10_Linked_List #Level_1_Day_4_Linked_List #Udemy_Linked_List
5-
// #Big_O_Time_O(N)_Space_O(1) #2024_01_09_Time_72_ms_(94.58%)_Space_43.8_MB_(18.67%)
5+
// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_95_ms_(48.82%)_Space_45.61_MB_(50.94%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0146_lru_cache/LRUCache.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Design #Linked_List
44
// #Doubly_Linked_List #Udemy_Linked_List #Top_Interview_150_Linked_List
5-
// #Big_O_Time_O(1)_Space_O(capacity) #2024_01_09_Time_780_ms_(34.57%)_Space_239.2_MB_(12.44%)
5+
// #Big_O_Time_O(1)_Space_O(capacity) #2025_06_14_Time_28_ms_(80.36%)_Space_174.73_MB_(41.35%)
66

77
public class LRUCache {
88
private readonly int capacity;

‎LeetCodeNet/G0101_0200/S0148_sort_list/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Sorting #Two_Pointers #Linked_List
44
// #Divide_and_Conquer #Merge_Sort #Level_2_Day_4_Linked_List #Top_Interview_150_Divide_and_Conquer
5-
// #Big_O_Time_O(log(N))_Space_O(log(N)) #2024_01_09_Time_141_ms_(45.08%)_Space_67.7_MB_(18.18%)
5+
// #Big_O_Time_O(log(N))_Space_O(log(N)) #2025_06_14_Time_37_ms_(40.62%)_Space_76.59_MB_(5.13%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0152_maximum_product_subarray/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #Dynamic_Programming_I_Day_6 #Level_2_Day_13_Dynamic_Programming #Udemy_Dynamic_Programming
5-
// #Big_O_Time_O(N)_Space_O(1) #2024_01_11_Time_71_ms_(90.35%)_Space_42.7_MB_(13.88%)
5+
// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_44.05_MB_(67.13%)
66

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

‎LeetCodeNet/G0101_0200/S0153_find_minimum_in_rotated_sorted_array/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
44
// #Binary_Search_I_Day_12 #Udemy_Binary_Search #Top_Interview_150_Binary_Search
5-
// #Big_O_Time_O(log_N)_Space_O(log_N) #2024_01_11_Time_64_ms_(88.59%)_Space_40.9_MB_(17.68%)
5+
// #Big_O_Time_O(log_N)_Space_O(log_N) #2025_06_14_Time_0_ms_(100.00%)_Space_42.21_MB_(58.48%)
66

77
public class Solution {
88
private int FindMinUtil(int[] nums, int l, int r) {

‎LeetCodeNet/G0101_0200/S0155_min_stack/MinStack.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0155_min_stack {
33
// #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 #Top_Interview_150_Stack #Big_O_Time_O(1)_Space_O(N)
6-
// #2024_01_11_Time_105_ms_(95.77%)_Space_55.6_MB_(13.78%)
6+
// #2025_06_14_Time_1_ms_(100.00%)_Space_54.77_MB_(33.45%)
77

88
public class MinStack {
99
private class Node {

‎LeetCodeNet/G0101_0200/S0160_intersection_of_two_linked_lists/Solution.cs

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

33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Hash_Table #Two_Pointers #Linked_List
44
// #Data_Structure_II_Day_11_Linked_List #Udemy_Linked_List #Big_O_Time_O(M+N)_Space_O(1)
5-
// #2024_01_11_Time_118_ms_(53.65%)_Space_54.6_MB_(23.25%)
5+
// #2025_06_14_Time_145_ms_(64.32%)_Space_56.64_MB_(43.98%)
66

77
using LeetCodeNet.Com_github_leetcode;
88

‎LeetCodeNet/G0101_0200/S0169_majority_element/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0169_majority_element {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table #Sorting #Counting
44
// #Divide_and_Conquer #Data_Structure_II_Day_1_Array #Udemy_Famous_Algorithm
55
// #Top_Interview_150_Array/String #Big_O_Time_O(n)_Space_O(1)
6-
// #2024_01_11_Time_98_ms_(66.71%)_Space_46.4_MB_(15.32%)
6+
// #2025_06_14_Time_1_ms_(66.60%)_Space_50.05_MB_(28.42%)
77

88
public class Solution {
99
public int MajorityElement(int[] arr) {

‎LeetCodeNet/G0101_0200/S0189_rotate_array/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Math #Two_Pointers
44
// #Algorithm_I_Day_2_Two_Pointers #Udemy_Arrays #Top_Interview_150_Array/String
5-
// #Big_O_Time_O(n)_Space_O(1) #2024_01_11_Time_143_ms_(94.32%)_Space_62.9_MB_(24.95%)
5+
// #Big_O_Time_O(n)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_66.44_MB_(15.51%)
66

77
public class Solution {
88
private void Reverse(int[] nums, int l, int r) {

‎LeetCodeNet/G0101_0200/S0198_house_robber/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0101_0200.S0198_house_robber {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
44
// #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
6-
// #Big_O_Time_O(n)_Space_O(n) #2024_01_11_Time_44_ms_(99.89%)_Space_39.8_MB_(13.60%)
6+
// #Big_O_Time_O(n)_Space_O(n) #2025_06_14_Time_0_ms_(100.00%)_Space_41.15_MB_(69.24%)
77

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

‎LeetCodeNet/G0101_0200/S0200_number_of_islands/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ namespace LeetCodeNet.G0101_0200.S0200_number_of_islands {
55
// #Algorithm_II_Day_6_Breadth_First_Search_Depth_First_Search
66
// #Graph_Theory_I_Day_1_Matrix_Related_Problems #Level_1_Day_9_Graph/BFS/DFS #Udemy_Graph
77
// #Top_Interview_150_Graph_General #Big_O_Time_O(M*N)_Space_O(M*N)
8-
// #2024_01_11_Time_119_ms_(51.45%)_Space_51_MB_(45.02%)
8+
// #2025_06_14_Time_131_ms_(65.99%)_Space_52.77_MB_(58.07%)
99

1010
public class Solution {
1111
public int NumIslands(char[][] grid) {

‎LeetCodeNet/G0201_0300/S0206_reverse_linked_list/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0206_reverse_linked_list {
33
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
44
// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List
55
// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
6-
// #Big_O_Time_O(N)_Space_O(1) #2024_01_10_Time_57_ms_(95.02%)_Space_40.9_MB_(19.99%)
6+
// #Big_O_Time_O(N)_Space_O(1) #2025_06_14_Time_0_ms_(100.00%)_Space_42.83_MB_(33.17%)
77

88
using LeetCodeNet.Com_github_leetcode;
99

‎LeetCodeNet/G0201_0300/S0207_course_schedule/Solution.cs

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

33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search
44
// #Breadth_First_Search #Graph #Topological_Sort #Top_Interview_150_Graph_General
5-
// #Big_O_Time_O(N)_Space_O(N) #2024_01_10_Time_95_ms_(91.94%)_Space_47.1_MB_(36.27%)
5+
// #Big_O_Time_O(N)_Space_O(N) #2025_06_14_Time_4_ms_(91.60%)_Space_50.04_MB_(65.44%)
66

77
using System.Collections.Generic;
88

‎LeetCodeNet/G0201_0300/S0208_implement_trie_prefix_tree/Trie.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0208_implement_trie_prefix_tree {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
44
// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
55
// #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
6-
// #2024_01_10_Time_178_ms_(88.12%)_Space_133.5_MB_(9.47%)
6+
// #2025_06_14_Time_7_ms_(100.00%)_Space_84.76_MB_(14.87%)
77

88
public class Trie {
99
private TrieNode root;

‎LeetCodeNet/G0201_0300/S0215_kth_largest_element_in_an_array/Solution.cs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ namespace LeetCodeNet.G0201_0300.S0215_kth_largest_element_in_an_array {
33
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
44
// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
55
// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
6-
// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2024_01_10_Time_252_ms_(46.14%)_Space_55_MB_(26.22%)
6+
// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2025_06_14_Time_85_ms_(88.50%)_Space_59.24_MB_(25.42%)
77

88
using System;
99

0 commit comments

Comments
 (0)