Skip to content

Commit 7ffbbba

Browse files
ThanhNITThanhNIT
authored
Added tasks 121-146
1 parent 431ff0b commit 7ffbbba

File tree

32 files changed

+1015
-0
lines changed

32 files changed

+1015
-0
lines changed

‎README.md‎

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -101,6 +101,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
101101

102102
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
103103
|-|-|-|-|-|-
104+
| 0136 |[Single Number](src/main/js/g0101_0200/s0136_single_number/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
104105

105106
### Algorithm II
106107

@@ -192,6 +193,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
192193

193194
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
194195
|-|-|-|-|-|-
196+
| 0139 |[Word Break](src/main/js/g0101_0200/s0139_word_break/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 0 | 100.00
195197

196198
#### Day 16 Dynamic Programming
197199

@@ -432,6 +434,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
432434

433435
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
434436
|-|-|-|-|-|-
437+
| 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
435438

436439
#### Day 8
437440

@@ -442,6 +445,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
442445

443446
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
444447
|-|-|-|-|-|-
448+
| 0139 |[Word Break](src/main/js/g0101_0200/s0139_word_break/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 0 | 100.00
445449
| 0042 |[Trapping Rain Water](src/main/js/g0001_0100/s0042_trapping_rain_water/solution.js)| Hard | Top_100_Liked_Questions, Top_Interview_Questions, Array, Dynamic_Programming, Two_Pointers, Stack, Monotonic_Stack, Big_O_Time_O(n)_Space_O(1) | 0 | 100.00
446450

447451
#### Day 10
@@ -645,6 +649,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
645649

646650
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
647651
|-|-|-|-|-|-
652+
| 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
648653

649654
#### Day 15
650655

@@ -823,11 +828,13 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
823828

824829
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
825830
|-|-|-|-|-|-
831+
| 0142 |[Linked List Cycle II](src/main/js/g0101_0200/s0142_linked_list_cycle_ii/solution.js)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 92.76
826832

827833
#### Day 5 Greedy
828834

829835
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
830836
|-|-|-|-|-|-
837+
| 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
831838

832839
#### Day 6 Tree
833840

@@ -1001,6 +1008,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10011008

10021009
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10031010
|-|-|-|-|-|-
1011+
| 0136 |[Single Number](src/main/js/g0101_0200/s0136_single_number/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
10041012
| 0007 |[Reverse Integer](src/main/js/g0001_0100/s0007_reverse_integer/solution.js)| Medium | Top_Interview_Questions, Math | 67 | 85.38
10051013
| 0009 |[Palindrome Number](src/main/js/g0001_0100/s0009_palindrome_number/solution.js)| Easy | Math | 4 | 97.14
10061014

@@ -1023,6 +1031,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10231031

10241032
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10251033
|-|-|-|-|-|-
1034+
| 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
10261035
| 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
10271036
| 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
10281037
| 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
@@ -1061,8 +1070,12 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10611070
|-|-|-|-|-|-
10621071
| 0114 |[Flatten Binary Tree to Linked List](src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
10631072
| 0024 |[Swap Nodes in Pairs](src/main/js/g0001_0100/s0024_swap_nodes_in_pairs/solution.js)| Medium | Top_100_Liked_Questions, Linked_List, Recursion, Big_O_Time_O(n)_Space_O(1) | 1 | 100.00
1073+
| 0142 |[Linked List Cycle II](src/main/js/g0101_0200/s0142_linked_list_cycle_ii/solution.js)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 92.76
1074+
| 0141 |[Linked List Cycle](src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 49 | 99.06
10641075
| 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
1076+
| 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
10651077
| 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
1078+
| 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
10661079

10671080
#### Udemy Tree Stack Queue
10681081

@@ -1071,6 +1084,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10711084
| 0094 |[Binary Tree Inorder Traversal](src/main/js/g0001_0100/s0094_binary_tree_inorder_traversal/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Big_O_Time_O(n)_Space_O(n) | 0 | 100.00
10721085
| 0102 |[Binary Tree Level Order Traversal](src/main/js/g0101_0200/s0102_binary_tree_level_order_traversal/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Breadth_First_Search, Tree, Binary_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 87.97
10731086
| 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
1087+
| 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
10741088
| 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
10751089

10761090
#### Udemy Trie and Heap
@@ -1087,6 +1101,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
10871101

10881102
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
10891103
|-|-|-|-|-|-
1104+
| 0139 |[Word Break](src/main/js/g0101_0200/s0139_word_break/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 0 | 100.00
10901105
| 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
10911106
| 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
10921107
| 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
@@ -1130,6 +1145,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
11301145

11311146
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11321147
|-|-|-|-|-|-
1148+
| 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
11331149

11341150
#### Day 4 Array
11351151

@@ -1151,6 +1167,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
11511167

11521168
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
11531169
|-|-|-|-|-|-
1170+
| 0141 |[Linked List Cycle](src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 49 | 99.06
11541171
| 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
11551172

11561173
#### Day 8 Linked List
@@ -1200,6 +1217,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
12001217

12011218
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12021219
|-|-|-|-|-|-
1220+
| 0136 |[Single Number](src/main/js/g0101_0200/s0136_single_number/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
12031221
| 0015 |[3Sum](src/main/js/g0001_0100/s0015_3sum/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Sorting, Two_Pointers, Big_O_Time_O(n\*log(n))_Space_O(n^2) | 31 | 91.92
12041222

12051223
#### Day 2 Array
@@ -1252,6 +1270,7 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
12521270
| <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
12531271
|-|-|-|-|-|-
12541272
| 0002 |[Add Two Numbers](src/main/js/g0001_0100/s0002_add_two_numbers/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Math, Linked_List, Recursion, Big_O_Time_O(max(N,M))_Space_O(max(N,M)), AI_can_be_used_to_solve_the_task | 3 | 81.61
1273+
| 0142 |[Linked List Cycle II](src/main/js/g0101_0200/s0142_linked_list_cycle_ii/solution.js)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 92.76
12551274

12561275
#### Day 11 Linked List
12571276

@@ -1315,6 +1334,16 @@ JavaScript-based LeetCode algorithm problem solutions, regularly updated.
13151334

13161335
| # | Title | Difficulty | Tag | Time, ms | Time, %
13171336
|------|----------------|-------------|-------------|----------|---------
1337+
| 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, Udemy_Linked_List, Big_O_Time_O(1)_Space_O(capacity) | 91 | 96.82
1338+
| 0142 |[Linked List Cycle II](src/main/js/g0101_0200/s0142_linked_list_cycle_ii/solution.js)| Medium | Top_100_Liked_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_II_Day_10_Linked_List, Level_1_Day_4_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 58 | 92.76
1339+
| 0141 |[Linked List Cycle](src/main/js/g0101_0200/s0141_linked_list_cycle/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Hash_Table, Two_Pointers, Linked_List, Data_Structure_I_Day_7_Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(1) | 49 | 99.06
1340+
| 0139 |[Word Break](src/main/js/g0101_0200/s0139_word_break/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Hash_Table, Dynamic_Programming, Trie, Memoization, Algorithm_II_Day_15_Dynamic_Programming, Dynamic_Programming_I_Day_9, Udemy_Dynamic_Programming, Big_O_Time_O(M+max\*N)_Space_O(M+N+max) | 0 | 100.00
1341+
| 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, Programming_Skills_II_Day_14, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(N) | 43 | 97.07
1342+
| 0136 |[Single Number](src/main/js/g0101_0200/s0136_single_number/solution.js)| Easy | Top_100_Liked_Questions, Top_Interview_Questions, Array, Bit_Manipulation, Data_Structure_II_Day_1_Array, Algorithm_I_Day_14_Bit_Manipulation, Udemy_Integers, Big_O_Time_O(N)_Space_O(1) | 0 | 100.00
1343+
| 0131 |[Palindrome Partitioning](src/main/js/g0101_0200/s0131_palindrome_partitioning/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, String, Dynamic_Programming, Backtracking, Big_O_Time_O(N\*2^N)_Space_O(2^N\*N) | 21 | 89.90
1344+
| 0128 |[Longest Consecutive Sequence](src/main/js/g0101_0200/s0128_longest_consecutive_sequence/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Union_Find, Big_O_Time_O(N_log_N)_Space_O(1) | 31 | 93.87
1345+
| 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, Udemy_Tree_Stack_Queue, Big_O_Time_O(N)_Space_O(N) | 1 | 98.34
1346+
| 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, Data_Structure_I_Day_3_Array, Dynamic_Programming_I_Day_7, Level_1_Day_5_Greedy, Udemy_Arrays, Big_O_Time_O(N)_Space_O(1) | 1 | 97.34
13181347
| 0114 |[Flatten Binary Tree to Linked List](src/main/js/g0101_0200/s0114_flatten_binary_tree_to_linked_list/solution.js)| Medium | Top_100_Liked_Questions, Depth_First_Search, Tree, Binary_Tree, Stack, Linked_List, Udemy_Linked_List, Big_O_Time_O(N)_Space_O(N) | 0 | 100.00
13191348
| 0105 |[Construct Binary Tree from Preorder and Inorder Traversal](src/main/js/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal/solution.js)| Medium | Top_100_Liked_Questions, Top_Interview_Questions, Array, Hash_Table, Tree, Binary_Tree, Divide_and_Conquer, Data_Structure_II_Day_15_Tree, Big_O_Time_O(N)_Space_O(N) | 1 | 98.60
13201349
| 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, Data_Structure_I_Day_11_Tree, Programming_Skills_I_Day_10_Linked_List_and_Tree, Udemy_Tree_Stack_Queue, Big_O_Time_O(N)_Space_O(H) | 0 | 100.00

‎src/main/js/com_github_leetcode/node.js‎

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
class Node {
2+
constructor(val, next, random) {
3+
this.val = val ?? 0
4+
this.next = next ?? null
5+
this.random = random ?? null
6+
}
7+
8+
toString() {
9+
const result = []
10+
let curr = this
11+
while (curr !== null) {
12+
const result2 = []
13+
result2.push(String(curr.val))
14+
if (curr.random === null) {
15+
result2.push('null')
16+
} else {
17+
let randomIndex = 0
18+
let curr2 = this
19+
while (curr2?.next !== null && curr2 !== curr.random) {
20+
randomIndex++
21+
curr2 = curr2.next
22+
}
23+
result2.push(String(randomIndex))
24+
}
25+
result.push(`[${result2.join(',')}]`)
26+
curr = curr.next
27+
}
28+
return `[${result.join(',')}]`
29+
}
30+
};
31+
32+
export { Node }

‎src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/readme.md‎

Lines changed: 32 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,32 @@
1+
121\. Best Time to Buy and Sell Stock
2+
3+
Easy
4+
5+
You are given an array `prices` where `prices[i]` is the price of a given stock on the <code>i<sup>th</sup></code> day.
6+
7+
You want to maximize your profit by choosing a **single day** to buy one stock and choosing a **different day in the future** to sell that stock.
8+
9+
Return _the maximum profit you can achieve from this transaction_. If you cannot achieve any profit, return `0`.
10+
11+
**Example 1:**
12+
13+
**Input:** prices = [7,1,5,3,6,4]
14+
15+
**Output:** 5
16+
17+
**Explanation:** Buy on day 2 (price = 1) and sell on day 5 (price = 6), profit = 6-1 = 5.
18+
19+
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.
20+
21+
**Example 2:**
22+
23+
**Input:** prices = [7,6,4,3,1]
24+
25+
**Output:** 0
26+
27+
**Explanation:** In this case, no transactions are done and the max profit = 0.
28+
29+
**Constraints:**
30+
31+
* <code>1 <= prices.length <= 10<sup>5</sup></code>
32+
* <code>0 <= prices[i] <= 10<sup>4</sup></code>

‎src/main/js/g0101_0200/s0121_best_time_to_buy_and_sell_stock/solution.js‎

Lines changed: 24 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
// #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming
2+
// #Data_Structure_I_Day_3_Array #Dynamic_Programming_I_Day_7 #Level_1_Day_5_Greedy #Udemy_Arrays
3+
// #Big_O_Time_O(N)_Space_O(1) #2024_12_15_Time_1_ms_(97.34%)_Space_59.1_MB_(51.64%)
4+
5+
/**
6+
* @param {number[]} prices
7+
* @return {number}
8+
*/
9+
var maxProfit = function(prices) {
10+
let maxProfit = 0
11+
let min = prices[0]
12+
13+
for (let i = 1; i < prices.length; i++) {
14+
if (prices[i] > min) {
15+
maxProfit = Math.max(maxProfit, prices[i] - min)
16+
} else {
17+
min = prices[i]
18+
}
19+
}
20+
21+
return maxProfit
22+
};
23+
24+
export { maxProfit }

‎src/main/js/g0101_0200/s0124_binary_tree_maximum_path_sum/readme.md‎

Lines changed: 34 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,34 @@
1+
124\. Binary Tree Maximum Path Sum
2+
3+
Hard
4+
5+
A **path** in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence **at most once**. Note that the path does not need to pass through the root.
6+
7+
The **path sum** of a path is the sum of the node's values in the path.
8+
9+
Given the `root` of a binary tree, return _the maximum **path sum** of any **non-empty** path_.
10+
11+
**Example 1:**
12+
13+
![](https://assets.leetcode.com/uploads/2020/10/13/exx1.jpg)
14+
15+
**Input:** root = [1,2,3]
16+
17+
**Output:** 6
18+
19+
**Explanation:** The optimal path is 2 -> 1 -> 3 with a path sum of 2 + 1 + 3 = 6.
20+
21+
**Example 2:**
22+
23+
![](https://assets.leetcode.com/uploads/2020/10/13/exx2.jpg)
24+
25+
**Input:** root = [-10,9,20,null,null,15,7]
26+
27+
**Output:** 42
28+
29+
**Explanation:** The optimal path is 15 -> 20 -> 7 with a path sum of 15 + 20 + 7 = 42.
30+
31+
**Constraints:**
32+
33+
* The number of nodes in the tree is in the range <code>[1, 3 * 10<sup>4</sup>]</code>.
34+
* `-1000 <= Node.val <= 1000`

0 commit comments

Comments
 (0)