Skip to content

Commit bfd9bd1

Browse files
javadevjavadev
authored
Added tag LeetCode_75
1 parent 7f37c9e commit bfd9bd1

File tree

28 files changed

+155
-151
lines changed

28 files changed

+155
-151
lines changed

‎README.md

+98-98
Large diffs are not rendered by default.

‎src/main/ts/g0001_0100/s0011_container_with_most_water/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
2-
// #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers #Big_O_Time_O(n)_Space_O(1)
3-
// #2025_03_22_Time_2_ms_(80.13%)_Space_65.63_MB_(10.65%)
2+
// #LeetCode_75_Two_Pointers #Algorithm_II_Day_4_Two_Pointers #Top_Interview_150_Two_Pointers
3+
// #Big_O_Time_O(n)_Space_O(1) #2025_03_22_Time_2_ms_(80.13%)_Space_65.63_MB_(10.65%)
44

55
function maxArea(height: number[]): number {
66
let maxArea = -1

‎src/main/ts/g0001_0100/s0017_letter_combinations_of_a_phone_number/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Backtracking
2-
// #Algorithm_II_Day_11_Recursion_Backtracking #Udemy_Backtracking/Recursion
3-
// #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
2+
// #LeetCode_75_Backtracking #Algorithm_II_Day_11_Recursion_Backtracking
3+
// #Udemy_Backtracking/Recursion #Top_Interview_150_Backtracking #Big_O_Time_O(4^n)_Space_O(n)
44
// #2025_03_22_Time_0_ms_(100.00%)_Space_56.27_MB_(8.55%)
55

66
function letterCombinations(digits: string): string[] {

‎src/main/ts/g0001_0100/s0062_unique_paths/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Dynamic_Programming #Math
2-
// #Combinatorics #Algorithm_II_Day_13_Dynamic_Programming #Dynamic_Programming_I_Day_15
3-
// #Level_1_Day_11_Dynamic_Programming #Big_O_Time_O(m*n)_Space_O(m*n)
4-
// #2025_03_23_Time_0_ms_(100.00%)_Space_55.15_MB_(43.54%)
2+
// #Combinatorics #LeetCode_75_DP/Multidimensional #Algorithm_II_Day_13_Dynamic_Programming
3+
// #Dynamic_Programming_I_Day_15 #Level_1_Day_11_Dynamic_Programming
4+
// #Big_O_Time_O(m*n)_Space_O(m*n) #2025_03_23_Time_0_ms_(100.00%)_Space_55.15_MB_(43.54%)
55

66
function uniquePaths(m: number, n: number): number {
77
let aboveRow = Array(n).fill(1)

‎src/main/ts/g0001_0100/s0069_sqrtx/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
// #Hard #Array #String #Simulation #Top_Interview_150_Array/String
2-
// #2025_04_05_Time_0_ms_(100.00%)_Space_55.70_MB_(38.14%)
1+
// #Easy #Top_Interview_Questions #Math #Binary_Search #Binary_Search_I_Day_4
2+
// #Top_Interview_150_Math #2025_04_16_Time_1_ms_(74.84%)_Space_57.85_MB_(56.21%)
33

44
function mySqrt(x: number): number {
55
let low = 1

‎src/main/ts/g0001_0100/s0072_edit_distance/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
1+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
22
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_19
33
// #Udemy_Dynamic_Programming #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(n^2)_Space_O(n2)
44
// #2025_03_23_Time_6_ms_(93.83%)_Space_61.09_MB_(45.68%)

‎src/main/ts/g0001_0100/s0088_merge_sorted_array/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
// #Medium #Two_Pointers #Linked_List #Top_Interview_150_Linked_List
2-
// #2025_04_05_Time_0_ms_(100.00%)_Space_58.16_MB_(62.07%)
1+
// #Easy #Top_Interview_Questions #Array #Sorting #Two_Pointers #Data_Structure_I_Day_2_Array
2+
// #Top_Interview_150_Array/String #2025_04_05_Time_0_ms_(100.00%)_Space_58.16_MB_(62.07%)
33

44
/**
55
* Do not return anything, modify nums1 in-place instead.

‎src/main/ts/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Depth_First_Search #Breadth_First_Search
2-
// #Tree #Binary_Tree #Data_Structure_I_Day_11_Tree
2+
// #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Data_Structure_I_Day_11_Tree
33
// #Programming_Skills_I_Day_10_Linked_List_and_Tree #Udemy_Tree_Stack_Queue
44
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(N)_Space_O(H)
55
// #2025_03_26_Time_0_ms_(100.00%)_Space_59.10_MB_(43.48%)

‎src/main/ts/g0101_0200/s0136_single_number/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Bit_Manipulation
2-
// #Data_Structure_II_Day_1_Array #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers
3-
// #Top_Interview_150_Bit_Manipulation #Big_O_Time_O(N)_Space_O(1)
4-
// #2025_03_26_Time_1_ms_(78.27%)_Space_58.44_MB_(41.08%)
2+
// #LeetCode_75_Bit_Manipulation #Data_Structure_II_Day_1_Array
3+
// #Algorithm_I_Day_14_Bit_Manipulation #Udemy_Integers #Top_Interview_150_Bit_Manipulation
4+
// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_1_ms_(78.27%)_Space_58.44_MB_(41.08%)
55

66
function singleNumber(nums: number[]): number {
77
let ans = 0

‎src/main/ts/g0101_0200/s0151_reverse_words_in_a_string/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
// #Medium #String #Two_Pointers #Udemy_Strings #Top_Interview_150_Array/String
2-
// #2025_04_08_Time_0_ms_(100.00%)_Space_57.70_MB_(48.75%)
1+
// #Medium #String #Two_Pointers #LeetCode_75_Array/String #Udemy_Strings
2+
// #Top_Interview_150_Array/String #2025_04_08_Time_0_ms_(100.00%)_Space_57.70_MB_(48.75%)
33

44
function reverseWords(s: string): string {
55
return s

‎src/main/ts/g0101_0200/s0162_find_peak_element/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
// #Medium #Top_Interview_Questions #Array #Binary_Search #Algorithm_II_Day_2_Binary_Search
2-
// #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
1+
// #Medium #Top_Interview_Questions #Array #Binary_Search #LeetCode_75_Binary_Search
2+
// #Algorithm_II_Day_2_Binary_Search #Binary_Search_II_Day_12 #Top_Interview_150_Binary_Search
33
// #2025_04_08_Time_0_ms_(100.00%)_Space_55.40_MB_(60.85%)
44

55
function findPeakElement(nums: number[]): number {

‎src/main/ts/g0101_0200/s0198_house_robber/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
2-
// #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
2+
// #LeetCode_75_DP/1D #Algorithm_I_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_3
33
// #Level_2_Day_12_Dynamic_Programming #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP
44
// #Big_O_Time_O(n)_Space_O(n) #2025_03_26_Time_0_ms_(100.00%)_Space_55.74_MB_(28.06%)
55

‎src/main/ts/g0101_0200/s0199_binary_tree_right_side_view/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
2-
// #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree #Top_Interview_150_Binary_Tree_BFS
3-
// #2025_04_10_Time_0_ms_(100.00%)_Space_56.98_MB_(73.71%)
2+
// #LeetCode_75_Binary_Tree/BFS #Data_Structure_II_Day_16_Tree #Level_2_Day_15_Tree
3+
// #Top_Interview_150_Binary_Tree_BFS #2025_04_10_Time_0_ms_(100.00%)_Space_56.98_MB_(73.71%)
44

55
import { TreeNode } from '../../com_github_leetcode/treenode'
66

‎src/main/ts/g0201_0300/s0206_reverse_linked_list/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Linked_List #Recursion
2-
// #Data_Structure_I_Day_8_Linked_List #Algorithm_I_Day_10_Recursion_Backtracking
3-
// #Level_1_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(N)_Space_O(1)
4-
// #2025_03_26_Time_0_ms_(100.00%)_Space_58.92_MB_(16.01%)
2+
// #LeetCode_75_LinkedList #Data_Structure_I_Day_8_Linked_List
3+
// #Algorithm_I_Day_10_Recursion_Backtracking #Level_1_Day_3_Linked_List #Udemy_Linked_List
4+
// #Big_O_Time_O(N)_Space_O(1) #2025_03_26_Time_0_ms_(100.00%)_Space_58.92_MB_(16.01%)
55

66
import { ListNode } from '../../com_github_leetcode/listnode'
77

‎src/main/ts/g0201_0300/s0208_implement_trie_prefix_tree/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Design #Trie
2-
// #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
2+
// #LeetCode_75_Trie #Level_2_Day_16_Design #Udemy_Trie_and_Heap #Top_Interview_150_Trie
33
// #Big_O_Time_O(word.length())_or_O(prefix.length())_Space_O(N)
44
// #2025_03_26_Time_48_ms_(63.95%)_Space_81.97_MB_(12.22%)
55

‎src/main/ts/g0201_0300/s0215_kth_largest_element_in_an_array/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Sorting #Heap_Priority_Queue
2-
// #Divide_and_Conquer #Quickselect #Data_Structure_II_Day_20_Heap_Priority_Queue
3-
// #Top_Interview_150_Heap #Big_O_Time_O(n*log(n))_Space_O(log(n))
4-
// #2025_03_26_Time_4_ms_(99.64%)_Space_66.28_MB_(62.13%)
2+
// #Divide_and_Conquer #Quickselect #LeetCode_75_Heap/Priority_Queue
3+
// #Data_Structure_II_Day_20_Heap_Priority_Queue #Top_Interview_150_Heap
4+
// #Big_O_Time_O(n*log(n))_Space_O(log(n)) #2025_03_26_Time_4_ms_(99.64%)_Space_66.28_MB_(62.13%)
55

66
function findKthLargest(nums: number[], k: number): number {
77
const countingLen = 2e4 + 1

‎src/main/ts/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.ts

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
2-
// #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue #Top_Interview_150_Binary_Tree_General
3-
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_61_ms_(75.97%)_Space_65.98_MB_(36.62%)
2+
// #LeetCode_75_Binary_Tree/DFS #Data_Structure_II_Day_18_Tree #Udemy_Tree_Stack_Queue
3+
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
4+
// #2025_03_28_Time_61_ms_(75.97%)_Space_65.98_MB_(36.62%)
45

56
/*
67
* Definition for a binary tree node.

‎src/main/ts/g0201_0300/s0238_product_of_array_except_self/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
2-
// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
3-
// #2025_03_28_Time_3_ms_(92.81%)_Space_70.08_MB_(42.74%)
1+
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #LeetCode_75_Array/String
2+
// #Data_Structure_II_Day_5_Array #Udemy_Arrays #Top_Interview_150_Array/String
3+
// #Big_O_Time_O(n^2)_Space_O(n) #2025_03_28_Time_3_ms_(92.81%)_Space_70.08_MB_(42.74%)
44

55
function productExceptSelf(nums: number[]): number[] {
66
const n = nums.length

‎src/main/ts/g0201_0300/s0283_move_zeroes/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
2-
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
3-
// #2025_03_28_Time_1_ms_(82.86%)_Space_62.16_MB_(10.71%)
1+
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #LeetCode_75_Two_Pointers
2+
// #Algorithm_I_Day_3_Two_Pointers #Programming_Skills_I_Day_6_Array #Udemy_Arrays
3+
// #Big_O_Time_O(n)_Space_O(1) #2025_03_28_Time_1_ms_(82.86%)_Space_62.16_MB_(10.71%)
44

55
/*
66
Do not return anything, modify nums in-place instead.

‎src/main/ts/g0301_0400/s0338_counting_bits/solution.ts

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
1-
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
2-
// #Big_O_Time_O(num)_Space_O(num) #2025_03_28_Time_1_ms_(89.22%)_Space_62.26_MB_(53.31%)
1+
// #Easy #Dynamic_Programming #Bit_Manipulation #LeetCode_75_Bit_Manipulation
2+
// #Udemy_Bit_Manipulation #Big_O_Time_O(num)_Space_O(num)
3+
// #2025_03_28_Time_1_ms_(89.22%)_Space_62.26_MB_(53.31%)
34

45
function countBits(n: number): number[] {
56
const bits: number[] = [0]

‎src/main/ts/g0301_0400/s0392_is_subsequence/solution.ts

+3-3
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
// #Easy #String #Dynamic_Programming #Two_Pointers #Dynamic_Programming_I_Day_19
2-
// #Level_1_Day_2_String #Udemy_Two_Pointers #Top_Interview_150_Two_Pointers
3-
// #2025_04_14_Time_0_ms_(100.00%)_Space_56.51_MB_(36.22%)
1+
// #Easy #String #Dynamic_Programming #Two_Pointers #LeetCode_75_Two_Pointers
2+
// #Dynamic_Programming_I_Day_19 #Level_1_Day_2_String #Udemy_Two_Pointers
3+
// #Top_Interview_150_Two_Pointers #2025_04_14_Time_0_ms_(100.00%)_Space_56.51_MB_(36.22%)
44

55
function isSubsequence(s: string, t: string): boolean {
66
let i = 0

‎src/main/ts/g0301_0400/s0394_decode_string/solution.ts

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
1-
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
2-
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_0_ms_(100.00%)_Space_55.70_MB_(34.63%)
1+
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #LeetCode_75_Stack
2+
// #Level_1_Day_14_Stack #Udemy_Strings #Big_O_Time_O(n)_Space_O(n)
3+
// #2025_03_28_Time_0_ms_(100.00%)_Space_55.70_MB_(34.63%)
34

45
function decodeString(s: string): string {
56
let stack: string[] = []

‎src/main/ts/g0301_0400/s0399_evaluate_division/solution.ts

+2-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
11
// #Medium #Array #Depth_First_Search #Breadth_First_Search #Graph #Union_Find #Shortest_Path
2-
// #Top_Interview_150_Graph_General #2025_04_16_Time_0_ms_(100.00%)_Space_54.98_MB_(77.31%)
2+
// #LeetCode_75_Graphs/DFS #Top_Interview_150_Graph_General
3+
// #2025_04_16_Time_0_ms_(100.00%)_Space_54.98_MB_(77.31%)
34

45
type MapType = Map<string, string>
56
type RateType = Map<string, number>

‎src/main/ts/g0401_0500/s0437_path_sum_iii/solution.ts

+2-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
1-
// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
2-
// #2025_03_28_Time_3_ms_(86.41%)_Space_61.43_MB_(43.21%)
1+
// #Medium #Depth_First_Search #Tree #Binary_Tree #LeetCode_75_Binary_Tree/DFS #Level_2_Day_7_Tree
2+
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_3_ms_(86.41%)_Space_61.43_MB_(43.21%)
33

44
function pathSum(root: TreeNode | null, targetSum: number): number {
55
let count = 0

‎src/main/ts/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
// #Medium #Array #Sorting #Greedy #Top_Interview_150_Intervals
1+
// #Medium #Array #Sorting #Greedy #LeetCode_75_Intervals #Top_Interview_150_Intervals
22
// #2025_04_15_Time_75_ms_(98.54%)_Space_79.44_MB_(62.20%)
33

44
function findMinArrowShots(points: number[][]): number {

‎src/main/ts/g0701_0800/s0739_daily_temperatures/solution.ts

+3-2
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,6 @@
1-
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
2-
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_18_ms_(80.57%)_Space_78.12_MB_(62.08%)
1+
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #LeetCode_75_Monotonic_Stack
2+
// #Programming_Skills_II_Day_6 #Big_O_Time_O(n)_Space_O(n)
3+
// #2025_03_28_Time_18_ms_(80.57%)_Space_78.12_MB_(62.08%)
34

45
function dailyTemperatures(temperatures: number[]): number[] {
56
let stack: number[] = []

‎src/main/ts/g0901_1000/s0918_maximum_sum_circular_subarray/solution.ts

-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,4 @@
11
// #Medium #Array #Dynamic_Programming #Divide_and_Conquer #Queue #Monotonic_Queue
2-
// #Medium #Array #Dynamic_Programming #Divide_and_Conquer #Queue #Monotonic_Queue
32
// #Dynamic_Programming_I_Day_5 #Top_Interview_150_Kadane's_Algorithm
43
// #2025_04_15_Time_2_ms_(91.04%)_Space_61.54_MB_(85.07%)
54

‎src/main/ts/g1101_1200/s1143_longest_common_subsequence/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
1+
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming #LeetCode_75_DP/Multidimensional
22
// #Algorithm_II_Day_17_Dynamic_Programming #Dynamic_Programming_I_Day_19
33
// #Udemy_Dynamic_Programming #Big_O_Time_O(n*m)_Space_O(n*m)
44
// #2025_03_28_Time_50_ms_(69.40%)_Space_85.72_MB_(16.94%)

0 commit comments

Comments
 (0)