Skip to content

Commit b089562

Browse files
javadevjavadev
committed
Updated TypeScript tasks
1 parent 0f715e2 commit b089562

File tree

26 files changed

+26
-26
lines changed

26 files changed

+26
-26
lines changed

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Array #Dynamic_Programming #Matrix #Dynamic_Programming_I_Day_16
22
// #Top_Interview_150_Multidimensional_DP #Big_O_Time_O(m*n)_Space_O(m*n)
3-
// #2023_10_09_Time_83_ms_(79.70%)_Space_50.2_MB_(56.39%)
3+
// #2025_03_28_Time_18_ms_(59.02%)_Space_66.03_MB_(29.27%)
44

55
function maximalSquare(matrix: string[][]): number {
66
const m = matrix.length

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Easy #Top_100_Liked_Questions #Depth_First_Search #Breadth_First_Search #Tree #Binary_Tree
22
// #Data_Structure_I_Day_12_Tree #Level_2_Day_6_Tree #Udemy_Tree_Stack_Queue
33
// #Top_Interview_150_Binary_Tree_General #Big_O_Time_O(n)_Space_O(n)
4-
// #2023_10_09_Time_52_ms_(81.65%)_Space_44.2_MB_(79.49%)
4+
// #2025_03_28_Time_0_ms_(100.00%)_Space_55.85_MB_(47.98%)
55

66
function invertTree(root: TreeNode | null): TreeNode | null {
77
if (root === null) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
22
// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree
33
// #Top_Interview_150_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
4-
// #2023_10_09_Time_54_ms_(97.22%)_Space_47.7_MB_(99.80%)
4+
// #2025_03_28_Time_0_ms_(100.00%)_Space_61.27_MB_(52.69%)
55

66
/*
77
* Definition for a binary tree node.

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
22
// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
3-
// #2023_10_09_Time_96_ms_(95.67%)_Space_72.8_MB_(87.01%)
3+
// #2025_03_28_Time_3_ms_(92.85%)_Space_79.85_MB_(44.75%)
44

55
/*
66
* Definition for singly-linked list.

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree
22
// #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) #2023_10_09_Time_59_ms_(96.11%)_Space_52.8_MB_(24.18%)
3+
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_61_ms_(75.97%)_Space_65.98_MB_(36.62%)
44

55
/*
66
* Definition for a binary tree node.

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Array #Prefix_Sum #Data_Structure_II_Day_5_Array #Udemy_Arrays
22
// #Top_Interview_150_Array/String #Big_O_Time_O(n^2)_Space_O(n)
3-
// #2023_10_09_Time_89_ms_(64.48%)_Space_55.4_MB_(36.71%)
3+
// #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/s0239_sliding_window_maximum/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Hard #Top_100_Liked_Questions #Array #Heap_Priority_Queue #Sliding_Window #Queue
22
// #Monotonic_Queue #Udemy_Arrays #Big_O_Time_O(n*k)_Space_O(n+k)
3-
// #2023_10_06_Time_216_ms_(99.50%)_Space_71.4_MB_(89.85%)
3+
// #2025_03_28_Time_26_ms_(99.07%)_Space_86.22_MB_(58.38%)
44

55
function maxSlidingWindow(nums: number[], k: number): number[] {
66
const result: number[] = []

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Matrix #Divide_and_Conquer
22
// #Data_Structure_II_Day_4_Array #Binary_Search_II_Day_8 #Big_O_Time_O(n+m)_Space_O(1)
3-
// #2023_10_06_Time_58_ms_(64.44%)_Space_45.6_MB_(50.00%)
3+
// #2025_03_28_Time_42_ms_(94.61%)_Space_58.52_MB_(36.53%)
44

55
function searchMatrix(matrix: number[][], target: number): boolean {
66
let r: number = 0

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Easy #Top_100_Liked_Questions #Array #Two_Pointers #Algorithm_I_Day_3_Two_Pointers
22
// #Programming_Skills_I_Day_6_Array #Udemy_Arrays #Big_O_Time_O(n)_Space_O(1)
3-
// #2023_10_06_Time_71_ms_(91.63%)_Space_47.2_MB_(57.52%)
3+
// #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/g0201_0300/s0287_find_the_duplicate_number/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Array #Binary_Search #Two_Pointers #Bit_Manipulation
22
// #Binary_Search_II_Day_5 #Big_O_Time_O(n)_Space_O(n)
3-
// #2023_10_06_Time_60_ms_(98.11%)_Space_53.5_MB_(50.00%)
3+
// #2025_03_28_Time_5_ms_(88.65%)_Space_67.23_MB_(32.75%)
44

55
function findDuplicate(nums: number[]): number {
66
const arr: number[] = new Array(nums.length + 1).fill(0)

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Hard #Top_100_Liked_Questions #Sorting #Two_Pointers #Design #Heap_Priority_Queue #Data_Stream
22
// #Top_Interview_150_Heap #Big_O_Time_O(n*log_n)_Space_O(n)
3-
// #2023_10_13_Time_335_ms_(99.44%)_Space_96.8_MB_(69.49%)
3+
// #2025_03_28_Time_106_ms_(92.31%)_Space_94.21_MB_(5.43%)
44

55
class Heap {
66
private heap: number[]

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Binary_Search
22
// #Algorithm_II_Day_16_Dynamic_Programming #Binary_Search_II_Day_3 #Dynamic_Programming_I_Day_18
33
// #Udemy_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(n*log_n)_Space_O(n)
4-
// #2023_10_04_Time_57_ms_(93.75%)_Space_45_MB_(33.55%)
4+
// #2025_03_28_Time_6_ms_(84.68%)_Space_58.13_MB_(39.69%)
55

66
function lengthOfLIS(nums: number[]): number {
77
if (nums === null || nums.length === 0) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Breadth_First_Search
22
// #Algorithm_II_Day_18_Dynamic_Programming #Dynamic_Programming_I_Day_20
33
// #Level_2_Day_12_Dynamic_Programming #Top_Interview_150_1D_DP #Big_O_Time_O(m*n)_Space_O(amount)
4-
// #2023_10_04_Time_85_ms_(86.14%)_Space_47.7_MB_(84.40%)
4+
// #2025_03_28_Time_27_ms_(89.42%)_Space_61.11_MB_(55.40%)
55

66
function coinChange(coins: number[], amount: number): number {
77
const dp: number[] = new Array(amount + 1).fill(0)

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Easy #Dynamic_Programming #Bit_Manipulation #Udemy_Bit_Manipulation
2-
// #Big_O_Time_O(num)_Space_O(num) #2023_10_04_Time_69_ms_(86.81%)_Space_49_MB_(78.01%)
2+
// #Big_O_Time_O(num)_Space_O(num) #2025_03_28_Time_1_ms_(89.22%)_Space_62.26_MB_(53.31%)
33

44
function countBits(n: number): number[] {
55
const bits: number[] = [0]

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Sorting #Heap_Priority_Queue #Counting
22
// #Divide_and_Conquer #Quickselect #Bucket_Sort #Data_Structure_II_Day_20_Heap_Priority_Queue
3-
// #Big_O_Time_O(n*log(n))_Space_O(k) #2023_10_04_Time_62_ms_(87.48%)_Space_45.6_MB_(67.84%)
3+
// #Big_O_Time_O(n*log(n))_Space_O(k) #2025_03_28_Time_7_ms_(87.13%)_Space_59.57_MB_(56.27%)
44

55
function topKFrequent(nums: number[], k: number): number[] {
66
let elementCount = new Array<number[]>(nums.length)

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #String #Stack #Recursion #Level_1_Day_14_Stack #Udemy_Strings
2-
// #Big_O_Time_O(n)_Space_O(n) #2023_10_04_Time_51_ms_(81.02%)_Space_43_MB_(55.52%)
2+
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_0_ms_(100.00%)_Space_55.70_MB_(34.63%)
33

44
function decodeString(s: string): string {
55
let stack: string[] = []

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #Array #Dynamic_Programming #Level_2_Day_13_Dynamic_Programming
2-
// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2023_09_30_Time_91_ms_(74.38%)_Space_44.7_MB_(83.25%)
2+
// #Big_O_Time_O(n*sums)_Space_O(n*sums) #2025_03_28_Time_33_ms_(93.24%)_Space_59.12_MB_(71.50%)
33

44
function canPartition(nums: number[]): boolean {
55
let sums: number = 0

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree #Big_O_Time_O(n)_Space_O(n)
2-
// #2023_09_30_Time_68_ms_(86.71%)_Space_47.3_MB_(98.10%)
2+
// #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/s0438_find_all_anagrams_in_a_string/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #String #Hash_Table #Sliding_Window
22
// #Algorithm_II_Day_5_Sliding_Window #Programming_Skills_II_Day_12
33
// #Level_1_Day_12_Sliding_Window/Two_Pointer #Big_O_Time_O(n+m)_Space_O(1)
4-
// #2023_09_30_Time_69_ms_(96.69%)_Space_46.1_MB_(80.99%)
4+
// #2025_03_28_Time_8_ms_(97.80%)_Space_59.42_MB_(72.16%)
55

66
function findAnagrams(s: string, p: string): number[] {
77
const map: number[] = new Array(26).fill(0)

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Array #Dynamic_Programming #Backtracking #Big_O_Time_O(n*(sum+s))_Space_O(n*(sum+s))
2-
// #2023_09_30_Time_77_ms_(81.99%)_Space_48.3_MB_(62.73%)
2+
// #2025_03_28_Time_24_ms_(83.43%)_Space_63.15_MB_(21.89%)
33

44
function findTargetSumWays(nums: number[], s: number): number {
55
let sum: number = 0

‎src/main/ts/g0501_0600/s0543_diameter_of_binary_tree/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
// #Easy #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Level_2_Day_7_Tree
22
// #Udemy_Tree_Stack_Queue #Big_O_Time_O(n)_Space_O(n)
3-
// #2023_09_30_Time_61_ms_(80.89%)_Space_47.4_MB_(18.15%)
3+
// #2025_03_28_Time_1_ms_(87.16%)_Space_63.47_MB_(59.51%)
44

55
function diameterOfBinaryTree(root: TreeNode | null): number {
66
let ans = 0

‎src/main/ts/g0501_0600/s0560_subarray_sum_equals_k/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #Array #Hash_Table #Prefix_Sum #Data_Structure_II_Day_5_Array
2-
// #Big_O_Time_O(n)_Space_O(n) #2023_09_30_Time_70_ms_(92.45%)_Space_52.7_MB_(27.70%)
2+
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_14_ms_(87.34%)_Space_67.32_MB_(18.02%)
33

44
function subarraySum(nums: number[], k: number): number {
55
let tempSum: number = 0

‎src/main/ts/g0601_0700/s0647_palindromic_substrings/solution.ts

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #String #Dynamic_Programming #Big_O_Time_O(n^2)_Space_O(n)
2-
// #2023_09_30_Time_60_ms_(89.76%)_Space_43_MB_(93.98%)
2+
// #2025_03_28_Time_5_ms_(100.00%)_Space_56.80_MB_(51.20%)
33

44
function expand(a: string[], l: number, r: number, res: number[]): void {
55
while (l >= 0 && r < a.length) {

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #Top_100_Liked_Questions #Array #Stack #Monotonic_Stack #Programming_Skills_II_Day_6
2-
// #Big_O_Time_O(n)_Space_O(n) #2023_09_30_Time_194_ms_(97.36%)_Space_66.2_MB_(69.52%)
2+
// #Big_O_Time_O(n)_Space_O(n) #2025_03_28_Time_18_ms_(80.57%)_Space_78.12_MB_(62.08%)
33

44
function dailyTemperatures(temperatures: number[]): number[] {
55
let stack: number[] = []

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
// #Medium #String #Hash_Table #Greedy #Two_Pointers #Data_Structure_II_Day_7_String
2-
// #Big_O_Time_O(n)_Space_O(1) #2025_02_15_Time_3_ms_(97.96%)_Space_52.21_MB_(88.78%)
2+
// #Big_O_Time_O(n)_Space_O(1) #2025_03_28_Time_4_ms_(86.89%)_Space_58.06_MB_(34.43%)
33

44
function partitionLabels(s: string): number[] {
55
const map = new Map<string, [number, number]>()

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

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,7 @@
11
// #Medium #Top_100_Liked_Questions #String #Dynamic_Programming
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)
4-
// #2023_09_30_Time_94_ms_(80.56%)_Space_73.5_MB_(53.24%)
4+
// #2025_03_28_Time_50_ms_(69.40%)_Space_85.72_MB_(16.94%)
55

66
function longestCommonSubsequence(text1: string, text2: string): number {
77
const n: number = text1.length

0 commit comments

Comments
 (0)