-<!DOCTYPE html><html lang="en"><head><meta charset="UTF-8"/><meta name="viewport" content="width=device-width, initial-scale=1.0"/><meta http-equiv="X-UA-Compatible" content="ie=edge"/><title>LeetCode javascript solutions</title><link rel="shortcut icon" href="https://baffinlee.github.io/leetcode-javascript/static/img/favicon.png" type="image/png"/><link rel="stylesheet" href="https://baffinlee.github.io/leetcode-javascript/static/css/app.css"/></head><body><header class="list-header"><div class="row"><div class="name">Difficulty:</div><div class="value"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">Easy</a></li><li class="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Hard</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/medium">Medium</a></li></ul></div></div><div class="row"><div class="name">Tag:</div><div class="value"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/array">Array</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/hash-table">Hash Table</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/string">String</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/dynamic-programming">Dynamic Programming</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/backtracking">Backtracking</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/two-pointers">Two Pointers</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/math">Math</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/linked-list">Linked List</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/stack">Stack</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/divide-and-conquer">Divide and Conquer</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/heap">Heap</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/binary-search">Binary Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/greedy">Greedy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/sort">Sort</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/bit-manipulation">Bit Manipulation</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/design">Design</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/brainteaser">Brainteaser</a></li></ul></div></div></header><main><table><thead><tr><th class="other">ID</th><th>Title</th><th class="other">Difficulty</th></tr></thead><tbody><tr><td>4</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/median-of-two-sorted-arrays.html">Median of Two Sorted Arrays</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>10</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/regular-expression-matching.html">Regular Expression Matching</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>23</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-k-sorted-lists.html">Merge k Sorted Lists</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>25</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-nodes-in-k-group.html">Reverse Nodes in k-Group</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>30</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/substring-with-concatenation-of-all-words.html">Substring with Concatenation of All Words</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>32</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/longest-valid-parentheses.html">Longest Valid Parentheses</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>37</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/sudoku-solver.html">Sudoku Solver</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>41</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/first-missing-positive.html">First Missing Positive</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>42</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/trapping-rain-water.html">Trapping Rain Water</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>44</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/wildcard-matching.html">Wildcard Matching</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>45</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/jump-game-ii.html">Jump Game II</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>51</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/n-queens.html">N-Queens</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>52</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/n-queens-ii.html">N-Queens II</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>57</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/insert-interval.html">Insert Interval</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>65</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-number.html">Valid Number</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>68</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/text-justification.html">Text Justification</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>72</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/edit-distance.html">Edit Distance</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>76</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/minimum-window-substring.html">Minimum Window Substring</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>84</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/largest-rectangle-in-histogram.html">Largest Rectangle in Histogram</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>85</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/maximal-rectangle.html">Maximal Rectangle</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>123</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock-iii.html">Best Time to Buy and Sell Stock III</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>132</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/palindrome-partitioning-ii.html">Palindrome Partitioning II</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>135</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/candy.html">Candy</a></td><td><span class="tag hard">Hard</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class="disabled"><a href="#"><</a></li><li class="selected"><a href="#">1</a></li><li class="disabled"><a href="#">></a></li></ul></section><footer><a href="https://github.com/BaffinLee/leetcode-javascript" target="_blank"><img src="https://baffinlee.github.io/leetcode-javascript/static/img/github.png" alt="github"/></a></footer></body></html>
0 commit comments