Some interesting OJ Practices based on Java. Mainly from LeetCode, partly from LintCode and Google OJ.

-Add Binary

-Counting Bits
-Third Maximum Number

-Decode String
-Find Largest Value In Each Tree Row
-Min Stack

-Construct Binary Tree from Preorder and Inorder Traversal

-Power Of Four

-Maximum Depth Of Binary Tree
-Minimum Depth Of Binary Tree
-Balanced Binary Tree
-Lowest Common Ancestor Of A BST
-Lowest Common Ancestor Of A Binary Tree
-Binary Tree Maximum Path Sum
-Elimination Game

-Path Sum
-Path Sum II
-Path Sum III
-Validate Binary Search Tree
-Binary Tree Preorder Traversal
-Binary Tree Inorder Traversal
-Binary Tree Postorder Traversal
-Inorder Successor In Binary Search Tree
-Binary Search Tree Iterator
-Sum Root to Leaf Numbers

-Binary Tree Level Order Traversal
-Binary Tree Level Order Traversal II
-Binary Tree Zigzag Level Order Traversal
-Course Schedule
-Course Schedule II
-Number of Islands
-Pacific Atlantic Water Flow
-Surrounded Regions
-Symmetric Tree
-Clone Graphs
-Word Ladder
-Word Ladder II

-Combinations
-Combination Sum
-Combination Sum II
-Combination Sum III
-Subsets
-Subsets II
-Permutations
-Permutations II
-Permutation Sequence
-Binary Watch
-N Queens

-Triangle   -Minimum Path Sum
-Unique Paths
-Unique Paths II
-Climbing Stairs
-Jump Game
-Jump Game II
-Palindrome Partition II
-Word Break
-House Robber
-House Robber II
-House Robber III -Backpack i
-Backpack ii
-Partition Equal Subset Sum
-Arithmetic Slices
-Wiggle Subsequence
-Is Subsequence
-Integer Break
-Maximum Subarray
-K Sum