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
| 517 |[Super Washing Machines](https://leetcode.com/problems/super-washing-machines/)||| Hard |
22
+
| 516 |[Longest Palindromic Subsequence](https://leetcode.com/problems/longest-palindromic-subsequence/)||| Medium |
23
+
| 515 |[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Find%20Largest%20Value%20in%20Each%20Tree%20Row/find-largest-value-in-each-tree-row.js)|| Medium |
24
+
| 513 |[Find Bottom Left Tree Value](https://leetcode.com/problems/find-bottom-left-tree-value/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Find%20Bottom%20Left%20Tree%20Value/find-bottom-left-tree-value.js)|| Medium |
| 503 |[Next Greater Element II](https://leetcode.com/problems/next-greater-element-ii/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Next%20Greater%20Element%20II/diagonal-traverse.js)|| Medium |
22
34
| 502 |[IPO](https://leetcode.com/problems/ipo/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/IPO/ipo.js)|| Hard |
23
35
| 501 |[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Find%20Mode%20in%20Binary%20Search%20Tree/find-mode-in-binary-search-tree.js)|| Easy |
@@ -27,6 +39,7 @@ If you are loving solving leetcode problems in JavaScript, please contact me to
27
39
| 496 |[Next Greater Element I](https://leetcode.com/problems/next-greater-element-i/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Next%20Greater%20Element%20I/next-greater-element-i.js)|| Easy |
28
40
| 495 |[Teemo Attacking](https://leetcode.com/problems/teemo-attacking/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Teemo%20Attacking/teemo-attacking.js)|| Medium |
29
41
| 494 |[Target Sum](https://leetcode.com/problems/target-sum/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Target%20Sum/dfs-solution.js)|[Explanation](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Target%20Sum/README.md)| Medium |
42
+
| 493 |[Reverse Pairs](https://leetcode.com/problems/reverse-pairs/)||| Hard |
30
43
| 492 |[Construct the Rectangle](https://leetcode.com/problems/construct-the-rectangle/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Construct%20the%20Rectangle/construct-the-rectangle.js)|| Easy |
31
44
| 491 |[Increasing Subsequences](https://leetcode.com/problems/increasing-subsequences/)|[JavaScript](https://github.com/hanzichi/leetcode/blob/master/Algorithms/Increasing%20Subsequences/use-set.js)|| Medium |
32
45
| 490 |[The Maze](https://leetcode.com/problems/the-maze/)|:blue_book:|| Medium |
0 commit comments