You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[JavaScript](./src/add-two-numbers/res.js)|Medium|
13
-
|3|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[JavaScript](./src/longest-substring-without-repeating-characters/res.js)|Medium|
14
-
|4|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[JavaScript](./src/median-of-two-sorted-arrays/res.js)|Hard|
|17|[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[JavaScript](./src/letter-combinations-of-a-phone-number/res.js)|Medium|
25
-
|19|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[JavaScript](./src/remove-nth-node-from-end-of-list/res.js)|Medium|
|26|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[JavaScript](./src/remove-duplicates-from-sorted-array/res.js)|Easy|
|29|[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[JavaScript](./src/divide-two-integers/res.js)|Medium|
31
-
|33|[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[JavaScript](./src/search-in-rotated-sorted-array/res.js)|Medium|
32
-
|34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[JavaScript](./src/search-for-a-range/res.js)|Medium|
|102|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|[JavaScript](./src/binary-tree-level-order-traversal/res.js)|Medium|
64
-
|104|[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[JavaScript](./src/maximum-depth-of-binary-tree/res.js)|Easy|
65
-
|107|[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)|[JavaScript](./src/binary-tree-level-order-traversal-ii/res.js)|Easy|
66
-
|108|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)|[JavaScript](./src/convert-sorted-array-to-binary-search-tree/res.js)|Easy|
67
-
|111|[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)|[JavaScript](./src/minimum-depth-of-binary-tree/res.js)|Easy|
|121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|[JavaScript](./src/best-time-to-buy-and-sell-stock/res.js)|Easy|
70
-
|122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-ii/res.js)|Easy|
71
-
|123|[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) <sup>*</sup> |[JavaScript](./src/best-time-to-buy-and-sell-stock-iii/res.js)|Hard|
|137|[Single Number II](https://leetcode.com/problems/single-number-ii/)|[JavaScript](./src/single-number-ii/res.js)|Medium|
80
-
|151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)|[JavaScript](./src/reverse-words-in-a-string/res.js)|Medium|
|181|[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)|[SQL](./src/employees-earning-more-than-their-managers/res.txt)|Easy|
|188|[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-iv/res.txt)|Hard|
|215|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)|[JavaScript](./src/kth-largest-element-in-an-array/res.js)|Medium|
|238|[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/solution/)|[JavaScript](./src/product-of-array-except-self/res.js)|Medium|
|287|[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)|[JavaScript](./src/find-the-duplicate-number/res.js)|Medium|
117
-
|289|[Game of Life](https://leetcode.com/problems/game-of-life/)|[JavaScript](./src/game-of-life/res.js)|Medium|
118
-
|295|[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)|[JavaScript](./src/find-median-from-data-stream/res.js)|Hard|
119
-
|299|[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)|[JavaScript](./src/bulls-and-cows/res.js)|Medium|
|307|[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)|[JavaScript](./src/range-sum-query-mutable/res.js)|Medium|
122
-
|309|[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-with-cooldown/res.js)|Medium|
|315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) <sup>*</sup> |[JavaScript](./src/count-of-smaller-numbers-after-self/res.js)|Hard|
|340|[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)|[JavaScript](./src/longest-substring-with-at-most-k-distinct-characters/res.js)|Hard|
129
-
|342|[Power of Four](https://leetcode.com/problems/power-of-four/)|[JavaScript](./src/power-of-four/res.js)|Easy|
|349|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[JavaScript](./src/intersection-of-two-arrays/res.js)|Easy|
132
-
|350|[Intersection of Two Arrays ii](https://leetcode.com/problems/intersection-of-two-arrays-ii/)|[JavaScript](./src/intersection-of-two-arrays-ii/res.js)|Easy|
133
-
|371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)|[JavaScript](./src/sum-of-two-integers/res.js)|Easy|
134
-
|374|[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)|[JavaScript](./src/guess-number-higher-or-lower/res.py)|Easy|
|384|[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)|[JavaScript](./src/shuffle-an-array/res.js)|Medium|
137
-
|395|[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)|[JavaScript](./src/longest-substring-with-at-least-k-repeating-characters/res.js)|Medium|
138
-
|404|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[JavaScript](./src/sum-of-left-leaves/res.js)|Easy|
|424|[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)|[JavaScript](./src/longest-repeating-character-replacement/res.js)|Medium|
142
-
|434|[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)|[JavaScript](./src/number-of-segments-in-a-string/res.js)|Easy|
143
-
|486|[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)|[JavaScript](./src/predict-the-winner/res.js)|Medium|
| 2 |[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[JavaScript](./src/add-two-numbers/res.js)| Medium |
13
+
| 3 |[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)|[JavaScript](./src/longest-substring-without-repeating-characters/res.js)| Medium |
14
+
| 4 |[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/)|[JavaScript](./src/median-of-two-sorted-arrays/res.js)| Hard |
15
+
| 5 |[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/)|[JavaScript](./src/longest-palindromic-substring/res.js)| Medium |
16
+
| 6 |[ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion/)|[JavaScript](./src/zigzag-conversion/res.js)| Medium |
| 8 |[String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)|[JavaScript](./src/string-to-integer-atoi/res.js)| Medium |
19
+
| 11 |[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|[JavaScript](./src/container-with-most-water/res.js)| Medium |
20
+
| 13 |[Roman to Integer](https://leetcode.com/problems/roman-to-integer/)|[JavaScript](./src/roman-to-integer/res.js)| Easy |
21
+
| 14 |[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)|[JavaScript](./src/longest-common-prefix/res.js)| Easy |
22
+
| 15 |[3Sum](https://leetcode.com/problems/3sum/)|[JavaScript](./src/3sum/res.js)| Medium |
23
+
| 16 |[3Sum Closest](https://leetcode.com/problems/3sum-closest/)|[JavaScript](./src/3sum-closest/res.js)| Medium |
24
+
| 17 |[Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number/)|[JavaScript](./src/letter-combinations-of-a-phone-number/res.js)| Medium |
25
+
| 19 |[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)|[JavaScript](./src/remove-nth-node-from-end-of-list/res.js)| Medium |
26
+
| 22 |[Generate Parentheses](https://leetcode.com/problems/generate-parentheses/)|[JavaScript](./src/generate-parentheses/res.js)| Medium |
27
+
| 26 |[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[JavaScript](./src/remove-duplicates-from-sorted-array/res.js)| Easy |
| 29 |[Divide Two Integers](https://leetcode.com/problems/divide-two-integers/)|[JavaScript](./src/divide-two-integers/res.js)| Medium |
31
+
| 33 |[Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/)|[JavaScript](./src/search-in-rotated-sorted-array/res.js)| Medium |
32
+
| 34 |[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[JavaScript](./src/search-for-a-range/res.js)| Medium |
| 71 |[Simplify Path](https://leetcode.com/problems/simplify-path/)|[JavaScript](./src/simplify-path/res.js)| Medium |
53
+
| 73 |[Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)|[JavaScript](./src/set-matrix-zeroes/res.js)| Medium |
54
+
| 75 |[Sort Colors](https://leetcode.com/problems/sort-colors/)|[JavaScript](./src/sort-colors/res.js)| Medium |
55
+
| 80 |[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)|[JavaScript](./src/remove-duplicates-from-sorted-array-ii/res.js)| Medium |
56
+
| 81 |[Search in Rotated Sorted Array II](https://leetcode.com/problems/search-in-rotated-sorted-array-ii/)|[JavaScript](./src/search-in-rotated-sorted-array-ii/res.js)| Medium |
57
+
| 88 |[ Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[JavaScript](./src/merge-sorted-array/res.js)| Medium |
58
+
| 91 |[Decode Ways](https://leetcode.com/problems/decode-ways/)|[JavaScript](./src/decode-ways/res.js)| Medium |
59
+
| 93 |[Restore IP Addresses](https://leetcode.com/problems/restore-ip-addresses/)|[JavaScript](./src/restore-ip-addresses/res.js)| Medium |
60
+
| 94 |[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)|[TypeScript](./src/binary-tree-inorder-traversal/res.ts)| Easy |
61
+
| 98 |[Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/)|[JavaScript](./src/validate-binary-search-tree/res.js)| Medium |
| 102 |[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|[JavaScript](./src/binary-tree-level-order-traversal/res.js)| Medium |
65
+
| 104 |[Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/)|[JavaScript](./src/maximum-depth-of-binary-tree/res.js)| Easy |
66
+
| 107 |[Binary Tree Level Order Traversal II](https://leetcode.com/problems/binary-tree-level-order-traversal-ii/)|[JavaScript](./src/binary-tree-level-order-traversal-ii/res.js)| Easy |
| 111 |[Minimum Depth of Binary Tree](https://leetcode.com/problems/minimum-depth-of-binary-tree/)|[JavaScript](./src/minimum-depth-of-binary-tree/res.js)| Easy |
69
+
| 120 |[Triangle](https://leetcode.com/problems/triangle/)|[JavaScript](./src/triangle/res.js)| Medium |
70
+
| 121 |[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|[JavaScript](./src/best-time-to-buy-and-sell-stock/res.js)| Easy |
71
+
| 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-ii/res.js)| Easy |
72
+
| 123 |[Best Time to Buy and Sell Stock III](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/) <sup>*</sup> |[JavaScript](./src/best-time-to-buy-and-sell-stock-iii/res.js)| Hard |
73
+
| 127 |[Word Ladder](https://leetcode.com/problems/word-ladder/)|[JavaScript](./src/word-ladder/res.js)| Medium |
74
+
| 128 |[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/)|[JavaScript](./src/longest-consecutive-sequence/res.js)| Medium |
75
+
| 130 |[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)|[JavaScript](./src/surrounded-regions/res.js)| Medium |
76
+
| 133 |[Clone Graph](https://leetcode.com/problems/clone-graph/)|[JavaScript](./src/clone-graph/res.js)| Medium |
77
+
| 134 |[Gas Station](https://leetcode.com/problems/gas-station/)|[JavaScript](./src/gas-station/res.js)| Medium |
78
+
| 135 |[Candy](https://leetcode.com/problems/candy/)|[JavaScript](./src/candy/res.js)| Hard |
| 137 |[Single Number II](https://leetcode.com/problems/single-number-ii/)|[JavaScript](./src/single-number-ii/res.js)| Medium |
81
+
| 151 |[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string/)|[JavaScript](./src/reverse-words-in-a-string/res.js)| Medium |
82
+
| 152 |[Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/)|[JavaScript](./src/maximum-product-subarray/res.js)| Medium |
83
+
| 153 |[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/)|[JavaScript](./src/find-minimum-in-rotated-sorted-array/res.js)| Medium |
84
+
| 154 |[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/)|[JavaScript](./src/find-minimum-in-rotated-sorted-array-ii/res.js)| Medium |
85
+
| 162 |[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[JavaScript](./src/find-peak-element/res.js)| Medium |
86
+
| 164 |[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[JavaScript](./src/maximum-gap/res.js)| Hard |
87
+
| 165 |[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)|[JavaScript](./src/compare-version-numbers/res.js)| Medium |
| 177 |[Nth Highest Salary](https://leetcode.com/problems/nth-highest-salary/)|[SQL](./src/nth-highest-salary/res.txt)| Medium |
92
+
| 181 |[Employees Earning More Than Their Managers](https://leetcode.com/problems/employees-earning-more-than-their-managers/)|[SQL](./src/employees-earning-more-than-their-managers/res.txt)| Easy |
| 183 |[Customers Who Never Order](https://leetcode.com/problems/customers-who-never-order/)|[SQL](./src/customers-who-never-order/res.txt)| Easy |
95
+
| 184 |[Department Highest Salary](https://leetcode.com/problems/department-highest-salary/)|[SQL](./src/department-highest-salary/res.txt)| Medium |
96
+
| 188 |[Best Time to Buy and Sell Stock IV](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-iv/res.txt)| Hard |
| 207 |[Course Schedule](https://leetcode.com/problems/course-schedule/)|[JavaScript](./src/course-schedule/res.js)| Medium |
103
+
| 209 |[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)|[JavaScript](./src/minimum-size-subarray-sum/res.js)| Medium |
104
+
| 210 |[Course Schedule II](https://leetcode.com/problems/course-schedule-ii/)|[JavaScript](./src/course-schedule-ii/res.js)| Medium |
105
+
| 215 |[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)|[JavaScript](./src/kth-largest-element-in-an-array/res.js)| Medium |
| 220 |[Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/)|[JavaScript](./src/contains-duplicate-iii/res.js)| Medium |
109
+
| 228 |[Summary Ranges](https://leetcode.com/problems/summary-ranges/solution/)|[JavaScript](./src/summary-ranges/res.js)| Medium |
110
+
| 238 |[Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/solution/)|[JavaScript](./src/product-of-array-except-self/res.js)| Medium |
111
+
| 239 |[Sliding Window Maximum](https://leetcode.com/problems/sliding-window-maximum/description/)|[JavaScript](./src/sliding-window-maximum/description/res.js)| Hard |
112
+
| 240 |[Search a 2D Matrix II](https://leetcode.com/problems/search-a-2d-matrix-ii/)|[JavaScript](./src/search-a-2d-matrix-ii/res.js)| Medium |
113
+
| 274 |[H-Index](https://leetcode.com/problems/h-index/)|[JavaScript](./src/h-index/res.js)| Medium |
114
+
| 275 |[H-Index II](https://leetcode.com/problems/h-index-ii/)|[JavaScript](./src/h-index-ii/res.js)| Medium |
115
+
| 278 |[First Bad Version](https://leetcode.com/problems/first-bad-version/)|[JavaScript](./src/first-bad-version/res.js)| Easy |
| 287 |[Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)|[JavaScript](./src/find-the-duplicate-number/res.js)| Medium |
118
+
| 289 |[Game of Life](https://leetcode.com/problems/game-of-life/)|[JavaScript](./src/game-of-life/res.js)| Medium |
119
+
| 295 |[Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/)|[JavaScript](./src/find-median-from-data-stream/res.js)| Hard |
120
+
| 299 |[Bulls and Cows](https://leetcode.com/problems/bulls-and-cows/)|[JavaScript](./src/bulls-and-cows/res.js)| Medium |
121
+
| 300 |[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)|[JavaScript](./src/longest-increasing-subsequence/res.js)| Medium |
122
+
| 307 |[Range Sum Query - Mutable](https://leetcode.com/problems/range-sum-query-mutable/)|[JavaScript](./src/range-sum-query-mutable/res.js)| Medium |
123
+
| 309 |[Best Time to Buy and Sell Stock with Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/)|[JavaScript](./src/best-time-to-buy-and-sell-stock-with-cooldown/res.js)| Medium |
124
+
| 310 |[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)|[JavaScript](./src/minimum-height-trees/res.js)| Medium |
125
+
| 315 |[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/) <sup>*</sup> |[JavaScript](./src/count-of-smaller-numbers-after-self/res.js)| Hard |
126
+
| 322 |[Coin Change](https://leetcode.com/problems/coin-change/)|[JavaScript](./src/coin-change/res.js)| Medium |
127
+
| 327 |[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[JavaScript](./src/count-of-range-sum/res.js)| Hard |
128
+
| 334 |[Increasing Triplet Subsequence](https://leetcode.com/problems/increasing-triplet-subsequence/)|[JavaScript](./src/increasing-triplet-subsequence/res.js)| Medium |
129
+
| 340 |[Longest Substring with At Most K Distinct Characters](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters/)|[JavaScript](./src/longest-substring-with-at-most-k-distinct-characters/res.js)| Hard |
130
+
| 342 |[Power of Four](https://leetcode.com/problems/power-of-four/)|[JavaScript](./src/power-of-four/res.js)| Easy |
| 349 |[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[JavaScript](./src/intersection-of-two-arrays/res.js)| Easy |
133
+
| 350 |[Intersection of Two Arrays ii](https://leetcode.com/problems/intersection-of-two-arrays-ii/)|[JavaScript](./src/intersection-of-two-arrays-ii/res.js)| Easy |
134
+
| 371 |[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)|[JavaScript](./src/sum-of-two-integers/res.js)| Easy |
135
+
| 374 |[Guess Number Higher or Lower](https://leetcode.com/problems/guess-number-higher-or-lower/)|[JavaScript](./src/guess-number-higher-or-lower/res.py)| Easy |
136
+
| 376 |[Wiggle Subsequence](https://leetcode.com/problems/wiggle-subsequence/)|[JavaScript](./src/wiggle-subsequence/res.js)| Medium |
137
+
| 384 |[Shuffle an Array](https://leetcode.com/problems/shuffle-an-array/)|[JavaScript](./src/shuffle-an-array/res.js)| Medium |
138
+
| 395 |[Longest Substring with At Least K Repeating Characters](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/)|[JavaScript](./src/longest-substring-with-at-least-k-repeating-characters/res.js)| Medium |
139
+
| 404 |[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[JavaScript](./src/sum-of-left-leaves/res.js)| Easy |
140
+
| 413 |[Arithmetic Slices](https://leetcode.com/problems/arithmetic-slices/)|[JavaScript](./src/arithmetic-slices/res.js)| Medium |
141
+
| 416 |[Partition Equal Subset Sum](https://leetcode.com/problems/partition-equal-subset-sum/)|[JavaScript](./src/partition-equal-subset-sum/res.js)| Medium |
142
+
| 424 |[Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/)|[JavaScript](./src/longest-repeating-character-replacement/res.js)| Medium |
143
+
| 434 |[Number of Segments in a String](https://leetcode.com/problems/number-of-segments-in-a-string/)|[JavaScript](./src/number-of-segments-in-a-string/res.js)| Easy |
144
+
| 486 |[Predict the Winner](https://leetcode.com/problems/predict-the-winner/)|[JavaScript](./src/predict-the-winner/res.js)| Medium |
145
+
| 494 |[Target Sum](https://leetcode.com/problems/target-sum/)|[JavaScript](./src/target-sum/res.js)| Medium |
146
+
| 516 |[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)|[JavaScript](./src/longest-palindromic-subsequence/res.js)| Medium |
147
+
| 523 |[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)|[JavaScript](./src/continuous-subarray-sum/res.js)| Medium |
148
+
| 539 |[Minimum Time Difference](https://leetcode.com/problems/minimum-time-difference/)|[JavaScript](./src/minimum-time-difference/res.js)| Medium |
0 commit comments