Skip to content

Commit 95493da

Browse files
ThanhNITThanhNIT
authored
Added tasks 230-300
1 parent 713d5f4 commit 95493da

File tree

31 files changed

+967
-0
lines changed

31 files changed

+967
-0
lines changed

‎README.md

+29
Original file line numberDiff line numberDiff line change
@@ -42,6 +42,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
4242

4343
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
4444
|-|-|-|-|-|-
45+
| 0283 |[Move Zeroes](src/main/js/g0201_0300/s0283_move_zeroes/solution.js)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
4546

4647
#### Day 4 Two Pointers
4748

@@ -204,6 +205,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
204205

205206
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
206207
|-|-|-|-|-|-
208+
| 0300 |[Longest Increasing Subsequence](src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 4 | 93.09
207209

208210
#### Day 17 Dynamic Programming
209211

@@ -314,6 +316,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
314316

315317
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
316318
|-|-|-|-|-|-
319+
| 0300 |[Longest Increasing Subsequence](src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 4 | 93.09
317320

318321
#### Day 4
319322

@@ -324,6 +327,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
324327

325328
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
326329
|-|-|-|-|-|-
330+
| 0287 |[Find the Duplicate Number](src/main/js/g0201_0300/s0287_find_the_duplicate_number/solution.js)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Big_O_Time_O(n)_Space_O(n) | 1 | 99.54
327331

328332
#### Day 6
329333

@@ -339,6 +343,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
339343

340344
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
341345
|-|-|-|-|-|-
346+
| 0240 |[Search a 2D Matrix II](src/main/js/g0201_0300/s0240_search_a_2d_matrix_ii/solution.js)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 279 | 94.52
342347

343348
#### Day 9
344349

@@ -505,6 +510,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
505510

506511
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
507512
|-|-|-|-|-|-
513+
| 0300 |[Longest Increasing Subsequence](src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 4 | 93.09
508514

509515
#### Day 19
510516

@@ -553,6 +559,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
553559

554560
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
555561
|-|-|-|-|-|-
562+
| 0283 |[Move Zeroes](src/main/js/g0201_0300/s0283_move_zeroes/solution.js)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
556563

557564
#### Day 7 Array
558565

@@ -921,6 +928,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
921928
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
922929
|-|-|-|-|-|-
923930
| 0019 |[Remove Nth Node From End of List](src/main/js/g0001_0100/s0019_remove_nth_node_from_end_of_list/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Two_Pointers, Linked_List, Big_O_Time_O(L)_Space_O(L) | 0 | 100.00
931+
| 0234 |[Palindrome Linked List](src/main/js/g0201_0300/s0234_palindrome_linked_list/solution.js)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 3 | 93.71
924932

925933
#### Day 4 Linked List
926934

@@ -955,6 +963,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
955963

956964
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
957965
|-|-|-|-|-|-
966+
| 0230 |[Kth Smallest Element in a BST](src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
958967

959968
#### Day 10 Graph/BFS/DFS
960969

@@ -1052,11 +1061,14 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10521061
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10531062
|-|-|-|-|-|-
10541063
| 0121 |[Best Time to Buy and Sell Stock](src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(N)_Space_O(1) | 1 | 97.34
1064+
| 0283 |[Move Zeroes](src/main/js/g0201_0300/s0283_move_zeroes/solution.js)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
10551065
| 0001 |[Two Sum](src/main/js/g0001_0100/s0001_two_sum/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n), AI_can_be_used_to_solve_the_task | 1 | 89.15
10561066
| 0189 |[Rotate Array](src/main/js/g0101_0200/s0189_rotate_array/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Math, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
10571067
| 0055 |[Jump Game](src/main/js/g0001_0100/s0055_jump_game/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Greedy, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
10581068
| 0075 |[Sort Colors](src/main/js/g0001_0100/s0075_sort_colors/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
1069+
| 0238 |[Product of Array Except Self](src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 3 | 93.60
10591070
| 0041 |[First Missing Positive](src/main/js/g0001_0100/s0041_first_missing_positive/solution.js)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Big_O_Time_O(n)_Space_O(n) | 1 | 98.86
1071+
| 0239 |[Sliding Window Maximum](src/main/js/g0201_0300/s0239_sliding_window_maximum/solution.js)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Big_O_Time_O(n\*k)_Space_O(n+k) | 28 | 98.27
10601072

10611073
#### Udemy Two Pointers
10621074

@@ -1097,6 +1109,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10971109
| 0206 |[Reverse Linked List](src/main/js/g0201_0300/s0206_reverse_linked_list/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
10981110
| 0021 |[Merge Two Sorted Lists](src/main/js/g0001_0100/s0021_merge_two_sorted_lists/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Linked_List, Recursion, Big_O_Time_O(m+n)_Space_O(m+n) | 0 | 100.00
10991111
| 0160 |[Intersection of Two Linked Lists](src/main/js/g0101_0200/s0160_intersection_of_two_linked_lists/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(M+N)_Space_O(1) | 68 | 93.67
1112+
| 0234 |[Palindrome Linked List](src/main/js/g0201_0300/s0234_palindrome_linked_list/solution.js)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 3 | 93.71
11001113
| 0138 |[Copy List with Random Pointer](src/main/js/g0101_0200/s0138_copy_list_with_random_pointer/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Linked_List, Big_O_Time_O(N)_Space_O(N) | 43 | 97.07
11011114
| 0025 |[Reverse Nodes in k-Group](src/main/js/g0001_0100/s0025_reverse_nodes_in_k_group/solution.js)| Hard | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(k) | 0 | 100.00
11021115
| 0146 |[LRU Cache](src/main/js/g0101_0200/s0146_lru_cache/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Design, Linked_List, Doubly_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 91 | 96.82
@@ -1111,6 +1124,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
11111124
| 0104 |[Maximum Depth of Binary Tree](src/main/js/g0101_0200/s0104_maximum_depth_of_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00
11121125
| 0124 |[Binary Tree Maximum Path Sum](src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/solution.js)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 98.34
11131126
| 0098 |[Validate Binary Search Tree](src/main/js/g0001_0100/s0098_validate_binary_search_tree/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(N)_Space_O(log(N)) | 0 | 100.00
1127+
| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 53 | 98.59
11141128

11151129
#### Udemy Trie and Heap
11161130

@@ -1133,6 +1147,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
11331147
| 0198 |[House Robber](src/main/js/g0101_0200/s0198_house_robber/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
11341148
| 0070 |[Climbing Stairs](src/main/js/g0001_0100/s0070_climbing_stairs/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Dynamic_Programming, Math, Memoization, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
11351149
| 0064 |[Minimum Path Sum](src/main/js/g0001_0100/s0064_minimum_path_sum/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Matrix, Big_O_Time_O(m\*n)_Space_O(m\*n) | 3 | 83.07
1150+
| 0300 |[Longest Increasing Subsequence](src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Big_O_Time_O(n\*log_n)_Space_O(n) | 4 | 93.09
11361151
| 0072 |[Edit Distance](src/main/js/g0001_0100/s0072_edit_distance/solution.js)| Medium | Top_100_Liked_Questions, String, Dynamic_Programming, Big_O_Time_O(n^2)_Space_O(n2) | 5 | 99.01
11371152
| 0010 |[Regular Expression Matching](src/main/js/g0001_0100/s0010_regular_expression_matching/solution.js)| Hard | Top_Interview_Questions, String, Dynamic_Programming, Recursion, Big_O_Time_O(m\*n)_Space_O(m\*n) | 4 | 95.52
11381153

@@ -1270,11 +1285,13 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
12701285

12711286
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12721287
|-|-|-|-|-|-
1288+
| 0240 |[Search a 2D Matrix II](src/main/js/g0201_0300/s0240_search_a_2d_matrix_ii/solution.js)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Big_O_Time_O(n+m)_Space_O(1) | 279 | 94.52
12731289

12741290
#### Day 5 Array
12751291

12761292
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12771293
|-|-|-|-|-|-
1294+
| 0238 |[Product of Array Except Self](src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Big_O_Time_O(n^2)_Space_O(n) | 3 | 93.60
12781295

12791296
#### Day 6 String
12801297

@@ -1344,11 +1361,13 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
13441361

13451362
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13461363
|-|-|-|-|-|-
1364+
| 0230 |[Kth Smallest Element in a BST](src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
13471365

13481366
#### Day 18 Tree
13491367

13501368
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
13511369
|-|-|-|-|-|-
1370+
| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Big_O_Time_O(n)_Space_O(n) | 53 | 98.59
13521371

13531372
#### Day 19 Graph
13541373

@@ -1370,6 +1389,16 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
13701389

13711390
| # | Title | Difficulty | Tag | Time, ms | Time, %
13721391
|------|----------------|-------------|-------------|----------|---------
1392+
| 0300 |[Longest Increasing Subsequence](src/main/js/g0201_0300/s0300_longest_increasing_subsequence/solution.js)| Medium | Top_100_Liked_Questions, Array, Dynamic_Programming, Binary_Search, Algorithm_II_Day_16_Dynamic_Programming, Binary_Search_II_Day_3, Dynamic_Programming_I_Day_18, Udemy_Dynamic_Programming, Big_O_Time_O(n\*log_n)_Space_O(n) | 4 | 93.09
1393+
| 0295 |[Find Median from Data Stream](src/main/js/g0201_0300/s0295_find_median_from_data_stream/solution.js)| Hard | Top_100_Liked_Questions, Sorting, Two_Pointers, Design, Heap_Priority_Queue, Data_Stream, Big_O_Time_O(n\*log_n)_Space_O(n) | 97 | 98.11
1394+
| 0287 |[Find the Duplicate Number](src/main/js/g0201_0300/s0287_find_the_duplicate_number/solution.js)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Two_Pointers, Bit_Manipulation, Binary_Search_II_Day_5, Big_O_Time_O(n)_Space_O(n) | 1 | 99.54
1395+
| 0283 |[Move Zeroes](src/main/js/g0201_0300/s0283_move_zeroes/solution.js)| Easy | Top_100_Liked_Questions, Array, Two_Pointers, Algorithm_I_Day_3_Two_Pointers, Programming_Skills_I_Day_6_Array, Udemy_Arrays, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
1396+
| 0240 |[Search a 2D Matrix II](src/main/js/g0201_0300/s0240_search_a_2d_matrix_ii/solution.js)| Medium | Top_100_Liked_Questions, Array, Binary_Search, Matrix, Divide_and_Conquer, Data_Structure_II_Day_4_Array, Binary_Search_II_Day_8, Big_O_Time_O(n+m)_Space_O(1) | 279 | 94.52
1397+
| 0239 |[Sliding Window Maximum](src/main/js/g0201_0300/s0239_sliding_window_maximum/solution.js)| Hard | Top_100_Liked_Questions, Array, Heap_Priority_Queue, Sliding_Window, Queue, Monotonic_Queue, Udemy_Arrays, Big_O_Time_O(n\*k)_Space_O(n+k) | 28 | 98.27
1398+
| 0238 |[Product of Array Except Self](src/main/js/g0201_0300/s0238_product_of_array_except_self/solution.js)| Medium | Top_100_Liked_Questions, Array, Prefix_Sum, Data_Structure_II_Day_5_Array, Udemy_Arrays, Big_O_Time_O(n^2)_Space_O(n) | 3 | 93.60
1399+
| 0236 |[Lowest Common Ancestor of a Binary Tree](src/main/js/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Data_Structure_II_Day_18_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 53 | 98.59
1400+
| 0234 |[Palindrome Linked List](src/main/js/g0201_0300/s0234_palindrome_linked_list/solution.js)| Easy | Top_100_Liked_Questions, Two_Pointers, Stack, Linked_List, Recursion, Level_2_Day_3_Linked_List, Udemy_Linked_List, Big_O_Time_O(n)_Space_O(1) | 3 | 93.71
1401+
| 0230 |[Kth Smallest Element in a BST](src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Binary_Search_Tree, Data_Structure_II_Day_17_Tree, Level_2_Day_9_Binary_Search_Tree, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
13731402
| 0226 |[Invert Binary Tree](src/main/js/g0201_0300/s0226_invert_binary_tree/solution.js)| Easy | Top_100_Liked_Questions, Depth_First_Search, Breadth_First_Search, Tree, Binary_Tree, Data_Structure_I_Day_12_Tree, Level_2_Day_6_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
13741403
| 0221 |[Maximal Square](src/main/js/g0201_0300/s0221_maximal_square/solution.js)| Medium | Array, Dynamic_Programming, Matrix, Dynamic_Programming_I_Day_16, Big_O_Time_O(m\*n)_Space_O(m\*n) | 12 | 87.32
13751404
| 0215 |[Kth Largest Element in an Array](src/main/js/g0201_0300/s0215_kth_largest_element_in_an_array/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Heap_Priority_Queue, Divide_and_Conquer, Quickselect, Data_Structure_II_Day_20_Heap_Priority_Queue, Big_O_Time_O(n\*log(n))_Space_O(log(n)) | 9 | 97.67

‎src/main/js/g0201_0300/s0230_kth_smallest_element_in_a_bst/readme.md

+29
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
230\. Kth Smallest Element in a BST
2+
3+
Medium
4+
5+
Given the `root` of a binary search tree, and an integer `k`, return _the_ <code>k<sup>th</sup></code> _smallest value (**1-indexed**) of all the values of the nodes in the tree_.
6+
7+
**Example 1:**
8+
9+
![](https://assets.leetcode.com/uploads/2021/01/28/kthtree1.jpg)
10+
11+
**Input:** root = [3,1,4,null,2], k = 1
12+
13+
**Output:** 1
14+
15+
**Example 2:**
16+
17+
![](https://assets.leetcode.com/uploads/2021/01/28/kthtree2.jpg)
18+
19+
**Input:** root = [5,3,6,2,4,null,null,1], k = 3
20+
21+
**Output:** 3
22+
23+
**Constraints:**
24+
25+
* The number of nodes in the tree is `n`.
26+
* <code>1 <= k <= n <= 10<sup>4</sup></code>
27+
* <code>0 <= Node.val <= 10<sup>4</sup></code>
28+
29+
**Follow up:** If the BST is modified often (i.e., we can do insert and delete operations) and you need to find the kth smallest frequently, how would you optimize?

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

+39
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,39 @@
1+
// #Medium #Top_100_Liked_Questions #Depth_First_Search #Tree #Binary_Tree #Binary_Search_Tree
2+
// #Data_Structure_II_Day_17_Tree #Level_2_Day_9_Binary_Search_Tree #Big_O_Time_O(n)_Space_O(n)
3+
// #2024_12_21_Time_0_ms_(100.00%)_Space_55.4_MB_(48.16%)
4+
5+
/**
6+
* Definition for a binary tree node.
7+
* function TreeNode(val, left, right) {
8+
* this.val = (val===undefined ? 0 : val)
9+
* this.left = (left===undefined ? null : left)
10+
* this.right = (right===undefined ? null : right)
11+
* }
12+
*/
13+
/**
14+
* @param {TreeNode} root
15+
* @param {number} k
16+
* @return {number}
17+
*/
18+
var kthSmallest = function(root, k) {
19+
let count = 0
20+
let result = null
21+
22+
const calculate = (node) => {
23+
if (!node) return
24+
if (node.left) calculate(node.left)
25+
26+
count++
27+
if (count === k) {
28+
result = node.val
29+
return
30+
}
31+
32+
if (node.right) calculate(node.right)
33+
}
34+
35+
calculate(root)
36+
return result
37+
};
38+
39+
export { kthSmallest }

‎src/main/js/g0201_0300/s0234_palindrome_linked_list/readme.md

+28
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
234\. Palindrome Linked List
2+
3+
Easy
4+
5+
Given the `head` of a singly linked list, return `true` _if it is a palindrome or_ `false` _otherwise_.
6+
7+
**Example 1:**
8+
9+
![](https://assets.leetcode.com/uploads/2021/03/03/pal1linked-list.jpg)
10+
11+
**Input:** head = [1,2,2,1]
12+
13+
**Output:** true
14+
15+
**Example 2:**
16+
17+
![](https://assets.leetcode.com/uploads/2021/03/03/pal2linked-list.jpg)
18+
19+
**Input:** head = [1,2]
20+
21+
**Output:** false
22+
23+
**Constraints:**
24+
25+
* The number of nodes in the list is in the range <code>[1, 10<sup>5</sup>]</code>.
26+
* `0 <= Node.val <= 9`
27+
28+
**Follow up:** Could you do it in `O(n)` time and `O(1)` space?

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

+54
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,54 @@
1+
// #Easy #Top_100_Liked_Questions #Two_Pointers #Stack #Linked_List #Recursion
2+
// #Level_2_Day_3_Linked_List #Udemy_Linked_List #Big_O_Time_O(n)_Space_O(1)
3+
// #2024_12_21_Time_3_ms_(93.71%)_Space_69.8_MB_(76.50%)
4+
5+
/**
6+
* Definition for singly-linked list.
7+
* function ListNode(val, next) {
8+
* this.val = (val===undefined ? 0 : val)
9+
* this.next = (next===undefined ? null : next)
10+
* }
11+
*/
12+
/**
13+
* @param {ListNode} head
14+
* @return {boolean}
15+
*/
16+
var isPalindrome = function(head) {
17+
let len = 0
18+
let right = head
19+
20+
// Calculate the length of the linked list
21+
while (right !== null) {
22+
right = right.next
23+
len++
24+
}
25+
26+
// Move to the start of the second half of the list
27+
len = Math.floor(len / 2)
28+
right = head
29+
for (let i = 0; i < len; i++) {
30+
right = right.next
31+
}
32+
33+
// Reverse the right half of the list
34+
let prev = null
35+
while (right !== null) {
36+
let next = right.next
37+
right.next = prev
38+
prev = right
39+
right = next
40+
}
41+
42+
// Compare the left half and the reversed right half
43+
for (let i = 0; i < len; i++) {
44+
if (prev !== null && head.val === prev.val) {
45+
head = head.next
46+
prev = prev.next
47+
} else {
48+
return false
49+
}
50+
}
51+
return true
52+
};
53+
54+
export { isPalindrome }

0 commit comments

Comments
 (0)