algorithm & data structure
Introduction
Linked list
Sort list
Merge two sorted array
Reverse a linked list
Reverse linked list in k-Group
LRU cache
Add Two numbers
Array
Find number which only appears once - I
Find number which appears only once - II
Missing first integer
Cyclic rotation
Remove element
Two sum closet
Hash
N - sum
Two sum
3 sum
Longest Substring Without Repeating Characters
Heap
Ugly Number I & II
Heapify
Top K largest Numbers I & II
Sliding window maximum
Sort
merge sort
heap sort
quick sort
insertion sort
Sorting algorithm comparison
Topological sort
Stack
Expression expand
Flatten nested list iterator
Min Stack
Implement Stack using Queue
Tree
Trie
Binary tree basic
Heap
Tree Traversal
Preorder traversal non-recursion
In-order traversal non-recursion
Postorder traversal non-recursion
Level-order traversal
Binary tree to linked list
Convert BST to Double-linked list in in-order traversal
Binary Tree paths
Maximum binary tree depth
Minimum subtree
Subtree with minimum average
Flatten a binary tree
Balanced binary tree
Lowest common ancestor
Validate binary search tree
Search range in a BST
Lowest common ancestor of a BST
Bit operation
Decimal to binary
Binary gap
Shortest Binarian
String
Anagrams
StrStr
Longest substring without repeating characters
Recursion
letter combination
Subset
Combination sum
Permutation
Palindrome partitioning
Dynamic Programming
Triangle
Minimum path sum
Word break
paint fence
House Robber
Mininum Swap to make dequence increasing
Edit Distance
OS
General
Integer to Rome
Powered by
GitBook
Subtree with minimum average
多想想這題吧.....這篇思路很不錯：
http://blog.leanote.com/post/westcode/53751fcb4502
results matching "
"
No results matching "
"