SUMMARY.md

Summary

• leetcode/lintcode题解/算法学习笔记
• Part I - Basics
• Data Structure
  • Linked List
  • Binary Tree
  • Binary Search Tree
  • Huffman Compression
  • Priority Queue
• Basics Sorting
  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort
  • Heap Sort
  • Bucket Sort
  • Counting Sort
  • Radix Sort
• Basics Misc
  • Bit Manipulation
• Part II - Coding
• String - 字符串
  • strStr
  • Two Strings Are Anagrams
  • Compare Strings
  • Anagrams
  • Longest Common Substring
  • Rotate String
  • Reverse Words in a String
  • Valid Palindrome
• Integer Array - 整型数组
  • Remove Element
  • Zero Sum Subarray
  • Subarray Sum K
  • Subarray Sum Closest
  • Product of Array Exclude Itself
  • Partition Array
  • First Missing Positive
  • 2 Sum
  • 3 Sum
  • 3 Sum Closest
  • Remove Duplicates from Sorted Array
  • Remove Duplicates from Sorted Array II
  • Merge Sorted Array
  • Merge Sorted Array II
  • Median
• Binary Search - 二分搜索
  • Binary Search
  • Search Insert Position
  • Search for a Range
  • First Bad Version
  • Search a 2D Matrix
  • Find Peak Element
  • Search in Rotated Sorted Array
  • Find Minimum in Rotated Sorted Array
  • Search a 2D Matrix II
  • Median of two Sorted Arrays
  • Sqrt x
  • Wood Cut
• Math and Bit Manipulation - 数学技巧与位运算
  • Single Number
  • Single Number II
  • Single Number III
  • O1 Check Power of 2
  • Convert Integer A to Integer B
  • Factorial Trailing Zeroes
  • Unique Binary Search Trees
  • Update Bits
  • Fast Power
• Linked List - 链表
  • Remove Duplicates from Sorted List
  • Remove Duplicates from Sorted List II
  • Remove Duplicates from Unsorted List
  • Partition List
  • Two Lists Sum
  • Two Lists Sum Advanced
  • Remove Nth Node From End of List
  • Linked List Cycle
  • Linked List Cycle II
  • Reverse Linked List
  • Reverse Linked List II
  • Merge Two Sorted Lists
  • Merge k Sorted Lists
  • Reorder List
  • Copy List with Random Pointer
  • Sort List
  • Insertion Sort List
  • Check if a singly linked list is palindrome
• Reverse - 翻转法
  • Recover Rotated Sorted Array
• Binary Tree - 二叉树
  • Binary Tree Preorder Traversal
  • Binary Tree Inorder Traversal
  • Binary Tree Postorder Traversal
  • Binary Tree Level Order Traversal
  • Maximum Depth of Binary Tree
  • Balanced Binary Tree
  • Binary Tree Maximum Path Sum
  • Lowest Common Ancestor
• Binary Search Tree - 二叉搜索树
  • Insert Node in a Binary Search Tree
  • Validate Binary Search Tree
  • Search Range in Binary Search Tree
  • Convert Sorted Array to Binary Search Tree
  • Convert Sorted List to Binary Search Tree
  • Binary Search Tree Iterator
• Exhaustive Search - 穷竭搜索
  • Subsets
  • Unique Subsets
  • Permutation
  • Unique Permutations
  • Next Permutation
  • Previous Permuation
  • Unique Binary Search Trees II
  • Permutation Index
  • Permutation Index II
  • Permutation Sequence
  • Palindrome Partitioning
• Dynamic Programming - 动态规划
  • Triangle
  • Knapsack - 背包问题
    • Backpack
  • Minimum Path Sum
  • Unique Paths
  • Unique Paths II
  • Sequence
    • Climbing Stairs
    • Jump Game
  • Word Break
  • Longest Increasing Subsequence
  • Palindrome Partitioning II
  • Longest Common Subsequence
  • Edit Distance
  • Jump Game II
  • Best Time to Buy and Sell Stock
  • Best Time to Buy and Sell Stock II
  • Best Time to Buy and Sell Stock III
  • Best Time to Buy and Sell Stock IV
  • Distinct Subsequences
  • Interleaving String
• Problem Misc
  • Nuts and Bolts Problem
• Appendix I Interview and Resume
  • Interview
  • Resume