# Summary

* [簡介](README.md)
* [Algorithm](aritcles/Tech/Algorithm/README.md)
* [二元搜尋法定式](articles/Tech/Algorithm/intellisense_binary_search.md)
* [Kata](articles/Tech/Kata/README.md)
* [#1 Prime Factors](articles/Tech/Kata/1_Prime_Factors.md)
* [Leetcode - Easy](articles/Leetcode/README.md)
* [#543 Diameter of Binary Tree](articles/Leetcode/easy/543.md)
* [#541 Reverse String II](articles/Leetcode/easy/541.md)
* [#530 Minimum Absolute Difference in BST](articles/Leetcode/easy/530.md)
* [#521 Longest Uncommon Subsequence I](articles/Leetcode/easy/521.md)
* [#509 Fibonacci Number](articles/Leetcode/easy/509.md)
* [#507 Perfect Number](articles/Leetcode/easy/507.md)
* [#506 Relative Ranks](articles/Leetcode/easy/506.md)
* [#504 Base 7](articles/Leetcode/easy/504.md)
* [#501 Find Mode in Binary Search Tree](articles/Leetcode/easy/501.md)
* [#500 Keyboard Row](articles/Leetcode/easy/500.md)
* [#496 Next Greater Element I](articles/Leetcode/easy/496.md)
* [#495 Teemo Attacking](articles/Leetcode/easy/495.md)
* [#492 Construct the Rectangle](articles/Leetcode/easy/492.md)
* [#485 Max Consecutive Ones](articles/Leetcode/easy/485.md)
* [#482 License Key Formatting](articles/Leetcode/easy/482.md)
* [#476 Number Complement](articles/Leetcode/easy/476.md)
* [#463 Island Perimeter](articles/Leetcode/easy/463.md)
* [#461 Hamming Distance](articles/Leetcode/easy/461.md)
* [#459 Repeated Substring Pattern](articles/Leetcode/easy/459.md)
* [#455 Assign Cookies](articles/Leetcode/easy/455.md)
* [#453 Minimum Moves to Equal Array Elements](articles/Leetcode/easy/453.md)
* [#448 Find All Numbers Disappeared in an Array](articles/Leetcode/easy/448.md)
* [#441 Number of Arranging Coins](articles/Leetcode/easy/441.md)
* [#434 Number of Segments in a String](articles/Leetcode/easy/434.md)
* [#415 Add Strings](articles/Leetcode/easy/415.md)
* [#414 Third Maximum Number](articles/Leetcode/easy/414.md)
* [#412 Fizz Buzz](articles/Leetcode/easy/412.md)
* [#409 Longest Palindrome](articles/Leetcode/easy/409.md)
* [#405 Convert a Number to Hexadecimal](articles/Leetcode/easy/405.md)
* [#404 Sum of Left Leaves](articles/Leetcode/easy/404.md)
* [#401 Binary Watch](articles/Leetcode/easy/401.md)
* [#392 Is Subsequence](articles/Leetcode/easy/392.md)
* [#389 Find the Difference](articles/Leetcode/easy/389.md)
* [#387 First Unique Character in a String](articles/Leetcode/easy/387.md)
* [#383 Ransom Note](articles/Leetcode/easy/383.md)
* [#374 Guess Number Higher or Lower](articles/Leetcode/easy/374.md)
* [#367 Valid Perfect Square](articles/Leetcode/easy/367.md)
* [#350 Intersection of Two Arrays II](articles/Leetcode/easy/350.md)
* [#349 Intersection of Two Arrays](articles/Leetcode/easy/349.md)
* [#345 Reverse Vowels of a String](articles/Leetcode/easy/345.md)
* [#344 Reverse String](articles/Leetcode/easy/344.md)
* [#342 Power of Four](articles/Leetcode/easy/342.md)
* [#338 Counting Bits](articles/Leetcode/easy/338.md)
* [#326 Power of Three](articles/Leetcode/easy/326.md)
* [#303 Range Sum Query - Immutable](articles/Leetcode/easy/303.md)
* [#292 Nim Game](articles/Leetcode/easy/292.md)
* [#290 Word Pattern](articles/Leetcode/easy/290.md)
* [#283 Move Zeroes](articles/Leetcode/easy/283.md)
* [#278 First Bad Version](articles/Leetcode/easy/278.md)
* [#268 Missing Number](articles/Leetcode/easy/268.md)
* [#263 Ugly Number](articles/Leetcode/easy/263.md)
* [#258 Add Digits](articles/Leetcode/easy/258.md)
* [#257 Binary Tree Paths](articles/Leetcode/easy/257.md)
* [#242 Valid Anagram](articles/Leetcode/easy/242.md)
* [#237 Delete Node in a Linked List](articles/Leetcode/easy/237.md)
* [#235 Lowest Common Ancestor of a Binary Search Tree](articles/Leetcode/easy/235.md)
* [#234 Palindrome Linked List](articles/Leetcode/easy/232.md)
* [#232 Implement Queue using Stacks](articles/Leetcode/easy/232.md)
* [#231 Power of Two](articles/Leetcode/easy/231.md)
* [#228 Summary Ranges](articles/Leetcode/easy/228.md)
* [#226 Invert Binary Tree](articles/Leetcode/easy/226.md)
* [#225 Implement Stack using Queues](articles/Leetcode/easy/225.md)
* [#219 Contains Duplicate II](articles/Leetcode/easy/219.md)
* [#217 Contains Duplicate](articles/Leetcode/easy/217.md)
* [#207 Reverse Linked List](articles/Leetcode/easy/207.md)
* [#205 Isomorphic Strings](articles/Leetcode/easy/205.md)
* [#204 Count Primes](articles/Leetcode/easy/204.md)
* [#203 Remove Linked List Elements](articles/Leetcode/easy/203.md)
* [#202 Happy Number](articles/Leetcode/easy/202.md)
* [#197 Rising Temperature](articles/Leetcode/easy/197.md)
* [#196 Delete Duplicate Emails](articles/Leetcode/easy/196.md)
* [#191 Number of 1 Bits](articles/Leetcode/easy/191.md)
* [#190 Reverse Bits](articles/Leetcode/easy/190.md)
* [#183 Customers Who Never Order](articles/Leetcode/easy/183.md)
* [#182 Duplicate Emails](articles/Leetcode/easy/182.md)
* [#181 Employees Earning More Than Their Managers](articles/Leetcode/easy/181.md)
* [#176 Second Highest Salary](articles/Leetcode/easy/176.md)
* [#172 Factorial Trailing Zeroes](articles/Leetcode/easy/172.md)
* [#171 Sheet Column Number](articles/Leetcode/easy/171.md)
* [#169 Majority Element](articles/Leetcode/easy/169.md)
* [#168 Excel Sheet Column Title](articles/Leetcode/easy/168.md)
* [#167 Two Sum II - Input array is sorted](articles/Leetcode/easy/167.md)
* [#160 Intersection of Two Linked Lists](articles/Leetcode/easy/160.md)
* [#155 Min Stack](articles/Leetcode/easy/155.md)
* [#145 Binary Tree Postorder Traversal](articles/Leetcode/easy/145.md)
* [#144 Binary Tree Preorder Traversal](articles/Leetcode/easy/144.md)
* [#136 Single Number](articles/Leetcode/easy/136.md)
* [#121 Best Time to Buy and Sell Stock](articles/Leetcode/easy/121.md)
* [#94 Binary Tree Inorder Traversal](articles/Leetcode/easy/94.md)
* [#70 Climbing Stairs](articles/Leetcode/easy/70.md)
* [#58 Length of Last Word](articles/Leetcode/easy/58.md)
* [#28 Implement strStr()](articles/Leetcode/easy/28.md)
* [#7 Reverse Integer](articles/Leetcode/easy/7.md)
* [#1 Two Sum](articles/Leetcode/easy/1.md)
* [Reading](articles/Reading/README.md)
* [The Clean Coder](articles/Reading/TheCleanCoder/README.md)
* [t01](articles/Reading/TheCleanCoder/t01.md)
* [大話設計](articles/reading/大話設計/README.md)
* [物件導向基礎練習](articles/Reading/大話設計/附錄A-物件導向基礎練習.md)
* [Tech](articles/Tech/README.md)
* [建立gitbook並可在VSCode與HackMD編輯推送至GitHub](articles/Tech/Other/how_to_build_gitbook_and_edit_by_VSCode_and_HackMD.md)

###### tags: `summary`