LeetCode implemented by Java.
-
Array
-
String
-
Linked List
- Add Two Numbers
- Remove Nth Node From End of List
- Merge Two Sorted Lists
- Merge k Sorted Lists (Time Limits Issue. Need [O = kLog(n)])
- Swap Nodes in Pairs
- Reverse Nodes in k-Group
- Merge Intervals
- Insert Interval
- Rotate List
- Remove Duplicates from Sorted List II
- Remove Duplicates from Sorted List
- Partition List
- Reverse Linked List II
- Reverse Integer
- Linked List Cycle
-
Binary Tree
- Same Tree
- Binary Tree Inorder Traversal
- Binary Tree Preorder Traversal
- Unique Binary Search Trees
- Unique Binary Search Trees II
- Validate Binary Search Tree
- Recover Binary Search Tree
- Same Tree
- Symmetric Tree
- Binary Tree Level Order Traversal
- Binary Tree Zigzag Level Order Traversal
- Maximum Depth of Binary Tree
- Construct Binary Tree from Preorder and Inorder Tr
- Construct Binary Tree from Inorder and Postorder T
- Binary Tree Level Order Traversal II
- Convert Sorted Array to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- Balanced Binary Tree
- Minimum Depth of Binary Tree
- Path Sum
- Path Sum II
- Flatten Binary Tree to Linked List
- Populating Next Right Pointers in Each Node
- Populating Next Right Pointers in Each Node II
- Binary Tree Maximum Path Sum
- Sum Root to Leaf Numbers
- Dynamic Programming
- Regular Expression Matching
- Longest Valid Parentheses
- Wildcard Matching
- Maximum Subarray
- Unique Paths
- Unique Paths II
- Minimum Path Sum
- Climbing Stairs
- Edit Distance
- Maximal Rectangle
- Scramble String
- Decode Ways
- Unique Binary Search Trees II
- Unique Binary Search Trees
- Interleaving String
- Distinct Subsequences
- Triangle
- Best Time to Buy and Sell Stock
- Best Time to Buy and Sell Stock II
- Best Time to Buy and Sell Stock III
- Palindrome Partitioning
- Palindrome Partitioning II
- Word Break
- Word Break II
- Jump Game
- Jump Game II
- Substring with Concatenation of All Words