-<!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/tree">Tree</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/depth-first-search">Depth-first Search</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/breadth-first-search">Breadth-first Search</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/union-find">Union Find</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/tag/graph">Graph</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>140</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/word-break-ii.html">Word Break II</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>145</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-tree-postorder-traversal.html">Binary Tree Postorder Traversal</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>146</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/lru-cache.html">LRU Cache</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>149</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/max-points-on-a-line.html">Max Points on a Line</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>154</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/find-minimum-in-rotated-sorted-array-ii.html">Find Minimum in Rotated Sorted Array II</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>164</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/maximum-gap.html">Maximum Gap</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>316</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/remove-duplicate-letters.html">Remove Duplicate Letters</a></td><td><span class="tag hard">Hard</span></td></tr><tr><td>823</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/split-array-with-same-average.html">Split Array With Same Average</a></td><td><span class="tag hard">Hard</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard"><</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">1</a></li><li class="selected"><a href="#">2</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