/*
Rough Category of the Leetcode problems
Ref:  http://blog.csdn.net/fightforyourdream/article/details/12705509

I am doing problems following the order.
This is also a place I wanna mark for the second round.

mark
(1c) complete in 1st round
(1c - m) has special comment need to pay attention
*/

Dynamic Programming

(1c) Edit Distance
(1c) Maximum Subarray
(1c) Minimum Path Sum
(1c) Unique Paths
(1c) Unique Paths II
(1c) Longest Palindromic Substring
(1c) Interleaving String
(1c) Triangle
(1c) Distinct Subsequences
(1c) Decode Ways
(1c) Palindrome Partitioning II
(1c) Maximal Rectangle

 Recursion

(1c) N-Queens
(1c) N-Queens II
(1c) Balanced Binary Tree
(1c) Binary Tree Inorder Traversal
(1c) Binary Tree Maximum Path Sum
(1c) Convert Sorted Array to Binary Search Tree
(1c) Convert Sorted List to Binary Search Tree
(1c) Flatten Binary Tree to Linked List
(1c) Maximum Depth of Binary Tree
(1c) Minimum Depth of Binary Tree
(1c) Path Sum
(1c) Permutations
(1c) Permutations II
(1c) Populating Next Right Pointers in Each Node
(1c) Pow(x, n) 
(1c) Same Tree 
(1c) Subsets
(1c) Sum Root to Leaf Numbers
(1c) Swap Nodes in Pairs
(1c) Symmetric Tree
(1c) Valid Palindrome
(1c) Validate Binary Search Tree
(1c) Restore IP Addresses
(1c) Combinations
(1c) Interleaving String (dp is the best)
(1c) Combination Sum II
(1c) Letter Combinations of a Phone Numbers
(1c) Word Search
(1c) Construct Binary Tree from Inorder and Postorder Traversal
(1c) Construct Binary Tree from Preorder and Inorder Traversal
(1c) Generate Parentheses
(1c) Surrounded Regions (runtime error)
(1c) Palindrome Partitioning
(1c) Combination Sum
(1c) Sudoku Solver
(1c) Unique Binary Search Trees II
 
 Binary Search
 
(1c) Search Insert Position
(1c) Search a 2D Matrix
(1c) Search for a Range
(1c) Search in Rotated Sorted Array
(1c - m) Sqrt(x)  -- need think about methods except Binary Search. Many options
 
 Sequence
 
(1c) Container With Most Water
(1c) Count and Say
(1c - m) First Missing Positive -- need more practice and understanding
(unfinisheg skipped)Implement strStr() -- KMP took me too many time... next time maybe my mind could be clearer...
(1c)Jump Game
(1c)Jump Game II
(1c)Length of Last Word
(1c)Longest Common Prefix
(1c)Longest Substring Without Repeating Characters
(1c)Merge Sorted Array
(1c)Palindrome Number
(1c)Plus One
(1c)Remove Duplicates from Sorted Array
(1c)Remove Duplicates from Sorted Array II
(1c)Remove Element
(1c)Reverse Integer
(1c)Search in Rotated Sorted Array II
(1c)Sort Colors
(1c -m)Two Sum know Arrays.sort() in Java using dual pivot quicksort. review quicksort and dual quicksort in utility package
3Sum
( -m)3Sum Closest Binary Search only can garuantee that it find the index, if there are duplicates, it's not necesarrily which one among it. To find the range, try to do Binary search twice, find the first and the last one. That also means it's possible to find the first one by keep checking whether its left value is equals to target 
(1c)4Sum
(1c)Add Binary
(1c)Longest Palindromic Substring
(1c)Next Permutation
(1c)Longest Valid Parentheses
(1c)Climbing Stairs
(1c -m )Permutation Sequence Need to do independently next time!! improve your sense of numbers!
(1c)Simplify Path
(1c)String to Integer (atoi)
(1c)Minimum Window Substring
(1c)Longest Consecutive Sequence
(1c)Trapping Rain Water
( -m)Valid Number (spent too much time... give up... next time)

Linked List

(1c)Add Two Numbers
(1c)Convert Sorted List to Binary Search Tree
(1c)Merge Two Sorted Lists
(1c -m)Partition List Need more practice. Donna how to get accepted. 
(1c)Remove Duplicates from Sorted List
(1c)Remove Duplicates from Sorted List II
(1c)Remove Nth Node From End of List
(1c)Reverse Linked List II
(1c -m)Reverse Nodes in k-Group Check other's solution. Need to review againi
(1c)Rotate List
(1c)Swap Nodes in Pairs

Stack

(1c)Binary Tree Inorder Traversal
(1c)Binary Tree Level Order Traversal II
(1c)Valid Parentheses

Queue

(1c)Binary Tree Level Order Traversal
(1c)Binary Tree Level Order Traversal II
(1c)Populating Next Right Pointers in Each Node II
(1c)Symmetric Tree
(1c)Surrounded Regions
(1c)Word Ladder
( -m)Word Ladder too difficult for me right now. Should come back later

Tree

Balanced Binary Tree
Binary Tree Inorder Traversal
Binary Tree Level Order Traversal
Binary Tree Level Order Traversal II
Binary Tree Maximum Path Sum
Convert Sorted Array to Binary Search Tree
Convert Sorted List to Binary Search Tree
Flatten Binary Tree to Linked List
Maximum Depth of Binary Tree
Minimum Depth of Binary Tree
Path Sum
Same Tree
Sum Root to Leaf Numbers
Symmetric Tree
Validate Binary Search Tree


Others Added
(1c -m)Gray Code need more practice!!! bit manipulation!!