Skip to content

Commit b089562

Browse files
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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

Lines changed: 1 addition & 1 deletion
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)

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy