Two Pointers 17 problems
- Three Sum
- Three Sum closest
- Four Sum
- Remove Elements
- Remove Duplicates From Sorted Array
- Remove Duplicates From Sorted Array 2
- Longest Substring Without Repeating Characters
- Container With Most Water
- Trapping Rain Water
- Trapping Rain Water 2
- Sort Colors
- Merge Sorted Array (Easy) ->link
- Valid Palindrome (Easy) ->link
- Minimum Window Substring(Hard) ->link
- Find the Duplicate Number(Medium) ->link
- K-diff Pairs in an Array(Easy)->link
- Permutation in String(Medium)->link
Linked List 19 problems
- Linked List Cycle(Easy)->link
- Linked List Cycle II(Medium)->link
- Merge Two Sorted Lists(Easy)->link
- Merge k Sorted Lists(Hard)->link
- Remove Duplicates from Sorted List(Easy)->link
- Remove Duplicates from Sorted List II(Medium)->link
- Remove Linked List Elements(Easy)->link
- Reverse Linked List(Easy)->link
- Reverse Linked List II(Medium)->link
- Reverse Nodes in k-Group(Hard)->link
- Rotate List(Medium)->link
- Sort List(Medium)->link
- Swap Nodes in Pairs(Medium)->link
- Partition List(Medium)->link
- Add Two Numbers(Medium)->link
- Add Two Numbers II(Medium)->link
- Reorder List(Medium)->link
- Remove Nth Node From End of List(Medium)->link
- Copy List with Random Pointer(Medium)->link
- Minimum Depth of Binary Tree(Easy)->link
- Maximum Depth of Binary Tree(Easy)->link
- Lowest Common Ancestor of a Binary Search Tree(Easy)->link
- Balanced Binary Tree(Easy)->link
- Path Sum(Easy)->link
- Convert Sorted Array to Binary Search Tree(Easy)->link
- Same Tree(Easy)->link
- Symmetric Tree(Easy)->link
- Binary Tree Level Order Traversal II(Easy)->link
- Invert Binary Tree(Easy)->link
- Binary Tree Paths(Easy)->link
- Path Sum III(Easy)->link
- Sum of Left Leaves(Easy)->link
- Convert BST to Greater Tree(Easy)->link
- Subtree of Another Tree(Easy)->link
- Binary Tree Tilt(Easy)->link
- Average of Levels in Binary Tree(Easy)->link
- Merge Two Binary Trees(Easy)->link
- Two Sum IV - Input is a BST(Easy)->link
- Diameter of Binary Tree(Easy)->link
- Binary Tree Inorder Traversal(Medium)->link
- Unique Binary Search Trees(Medium)->link
- Unique Binary Search Trees II(Medium)->link
- Validate Binary Search Tree(Medium)->link
- Binary Tree Zigzag Level Order Traversal(Medium)->link
- Construct Binary Tree from Preorder and Inorder Traversal(Medium)->link
- Construct Binary Tree from Inorder and Postorder Traversal(Medium)->link
- Path Sum II(Medium)->link
- Flatten Binary Tree to Linked List(Medium)->link
- Populating Next Right Pointers in Each Node(Medium)->link
- Populating Next Right Pointers in Each Node II(Medium)->link
- Sum Root to Leaf Numbers(Medium)->link
- Binary Tree Preorder Traversal(Medium)->link
- Binary Tree Postorder Traversal(Medium)->link
- Binary Search Tree Iterator(Medium)->link
- Binary Tree Right Side View(Medium)->link
- Count Complete Tree Nodes(Medium)->link
- Kth Smallest Element in a BST(Medium)->link
- Lowest Common Ancestor of a Binary Tree(Medium)->link
- Delete Node in a BST(Medium)->link
- House Robber III(Medium)->link
- Serialize and Deserialize BST(Medium)->link
- Recover Binary Search Tree(Hard)->link
- Binary Tree Maximum Path Sum(Hard)->link
- Trim a Binary Search Tree(Easy)->link
- Jump Game(Medium)->link
- Merge Intervals(Medium)->link
- Two Sum(Easy)->link
- Search for a Range(Medium)->link
- Search in Rotated Sorted Array(Medium)->link
- Search Insert Position(Easy)->link
- Next Permutation(Medium)->link
- Pascal's Triangle(Easy)->link
- Combination Sum(Medium)->link
- Combination Sum II(Medium)->link
- Permutations(Medium)->link
- Permutations II(Medium)->link
- Combinations(Medium)->link
- Permutation Sequence(Medium)->link
- Subsets(Medium)->link
- Subsets II(Medium)->link
- Letter Combinations of a Phone Number(Medium)->link
- Generate Parentheses(Medium)->link
- Palindrome Partitioning(Medium)->link
- Word Search(Medium)->link
- Gray Code(Medium)->link
- Combination Sum III(Medium)->link
- Sudoku Solver(Hard)->link
- N-Queens(Hard)->link
- N-Queens II(Hard)->link
- Word Ladder II(Hard)->link
- Maximum Subarray(Easy)->link
- Climbing Stairs(Easy)->link
- Best Time to Buy and Sell Stock(Easy)->
- House Robber(Easy)->link
- Unique Paths(Medium)->link
- Unique Paths II(Medium)->link
- Minimum Path Sum(Medium)->link
- Decode Ways(Medium)->link
- Count Numbers with Unique Digits(Medium)->link
- Single Number(Easy)->link
- Single Number2(Medium)->link
- Majority Element(Easy)->link
- Reverse Bits(Easy)->link