RADFolks
diff --git a/‎docs/difficulty/easy/page/2.html
Lines changed: 1 addition & 1 deletion b/‎docs/difficulty/easy/page/2.html
Lines changed: 1 addition & 1 deletion
@@ -1 +1 @@
-<!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="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Easy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">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>121</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock.html">Best Time to Buy and Sell Stock</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>122</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock-ii.html">Best Time to Buy and Sell Stock II</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>125</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-palindrome.html">Valid Palindrome</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>136</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/single-number.html">Single Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>141</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/linked-list-cycle.html">Linked List Cycle</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>155</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/min-stack.html">Min Stack</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>160</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/intersection-of-two-linked-lists.html">Intersection of Two Linked Lists</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>167</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/two-sum-ii-input-array-is-sorted.html">Two Sum II - Input array is sorted</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>168</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/excel-sheet-column-title.html">Excel Sheet Column Title</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>202</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/happy-number.html">Happy Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>258</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-digits.html">Add Digits</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>263</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/ugly-number.html">Ugly Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>292</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/nim-game.html">Nim Game</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>401</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-watch.html">Binary Watch</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>415</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-strings.html">Add Strings</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>557</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-words-in-a-string-iii.html">Reverse Words in a String III</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>617</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-two-binary-trees.html">Merge Two Binary Trees</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>669</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/trim-a-binary-search-tree.html">Trim a Binary Search Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>861</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/flipping-an-image.html">Flipping an Image</a></td><td><span class="tag easy">Easy</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">&lt;</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">1</a></li><li class="selected"><a href="#">2</a></li><li class="disabled"><a href="#">&gt;</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>
+<!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="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Easy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">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>121</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock.html">Best Time to Buy and Sell Stock</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>122</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock-ii.html">Best Time to Buy and Sell Stock II</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>125</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-palindrome.html">Valid Palindrome</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>136</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/single-number.html">Single Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>141</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/linked-list-cycle.html">Linked List Cycle</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>155</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/min-stack.html">Min Stack</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>160</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/intersection-of-two-linked-lists.html">Intersection of Two Linked Lists</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>167</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/two-sum-ii-input-array-is-sorted.html">Two Sum II - Input array is sorted</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>168</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/excel-sheet-column-title.html">Excel Sheet Column Title</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>169</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/majority-element.html">Majority Element</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>202</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/happy-number.html">Happy Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>258</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-digits.html">Add Digits</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>263</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/ugly-number.html">Ugly Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>292</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/nim-game.html">Nim Game</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>401</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-watch.html">Binary Watch</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>415</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-strings.html">Add Strings</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>557</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-words-in-a-string-iii.html">Reverse Words in a String III</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>617</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-two-binary-trees.html">Merge Two Binary Trees</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>669</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/trim-a-binary-search-tree.html">Trim a Binary Search Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>861</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/flipping-an-image.html">Flipping an Image</a></td><td><span class="tag easy">Easy</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">&lt;</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">1</a></li><li class="selected"><a href="#">2</a></li><li class="disabled"><a href="#">&gt;</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>
Original file line number	Diff line number	Diff line change
`@@ -1 +1 @@`
`1`		-<!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="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Easy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">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>121</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock.html">Best Time to Buy and Sell Stock</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>122</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock-ii.html">Best Time to Buy and Sell Stock II</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>125</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-palindrome.html">Valid Palindrome</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>136</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/single-number.html">Single Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>141</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/linked-list-cycle.html">Linked List Cycle</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>155</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/min-stack.html">Min Stack</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>160</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/intersection-of-two-linked-lists.html">Intersection of Two Linked Lists</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>167</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/two-sum-ii-input-array-is-sorted.html">Two Sum II - Input array is sorted</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>168</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/excel-sheet-column-title.html">Excel Sheet Column Title</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>202</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/happy-number.html">Happy Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>258</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-digits.html">Add Digits</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>263</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/ugly-number.html">Ugly Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>292</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/nim-game.html">Nim Game</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>401</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-watch.html">Binary Watch</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>415</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-strings.html">Add Strings</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>557</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-words-in-a-string-iii.html">Reverse Words in a String III</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>617</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-two-binary-trees.html">Merge Two Binary Trees</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>669</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/trim-a-binary-search-tree.html">Trim a Binary Search Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>861</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/flipping-an-image.html">Flipping an Image</a></td><td><span class="tag easy">Easy</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy"><</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">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>
	`1`	+<!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="selected"><a href="https://baffinlee.github.io/leetcode-javascript">Easy</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/hard">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>121</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock.html">Best Time to Buy and Sell Stock</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>122</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/best-time-to-buy-and-sell-stock-ii.html">Best Time to Buy and Sell Stock II</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>125</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/valid-palindrome.html">Valid Palindrome</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>136</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/single-number.html">Single Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>141</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/linked-list-cycle.html">Linked List Cycle</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>155</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/min-stack.html">Min Stack</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>160</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/intersection-of-two-linked-lists.html">Intersection of Two Linked Lists</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>167</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/two-sum-ii-input-array-is-sorted.html">Two Sum II - Input array is sorted</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>168</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/excel-sheet-column-title.html">Excel Sheet Column Title</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>169</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/majority-element.html">Majority Element</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>202</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/happy-number.html">Happy Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>258</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-digits.html">Add Digits</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>263</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/ugly-number.html">Ugly Number</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>292</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/nim-game.html">Nim Game</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>401</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/binary-watch.html">Binary Watch</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>415</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/add-strings.html">Add Strings</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>557</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/reverse-words-in-a-string-iii.html">Reverse Words in a String III</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>617</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/merge-two-binary-trees.html">Merge Two Binary Trees</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>669</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/trim-a-binary-search-tree.html">Trim a Binary Search Tree</a></td><td><span class="tag easy">Easy</span></td></tr><tr><td>861</td><td><a href="https://baffinlee.github.io/leetcode-javascript/problem/flipping-an-image.html">Flipping an Image</a></td><td><span class="tag easy">Easy</span></td></tr></tbody></table></main><section class="paging"><ul class="clearfix"><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy"><</a></li><li class=""><a href="https://baffinlee.github.io/leetcode-javascript/difficulty/easy">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>