Tags

Two Pointers

• Implement strStr
• Valid Palindrome
• Remove Element

String

• Implement strStr
• Two Strings Are Anagrams
• Compare Strings
• Group Anagrams
• Longest Common Substring
• Rotate String
• Reverse Words in a String
• Valid Palindrome
• Longest Palindromic Substring
• Space Replacement
• Length of Last Word
• Count and Say
• Distinct Subsequences

Easy

• Implement strStr
• Two Strings Are Anagrams
• Compare Strings
• Rotate String
• Valid Palindrome
• Space Replacement
• Length of Last Word
• Count and Say
• Remove Element
• 2 Sum
• Median
• Single Number
• Happy Number
• Remove Duplicates from Sorted List
• Minimum Absolute Difference in BST

Cracking The Coding Interview

• Two Strings Are Anagrams
• Space Replacement

Basic Implementation

• Compare Strings

LintCode Copyright

• Compare Strings
• Longest Common Substring
• Median

Hash Table

• Group Anagrams
• 2 Sum
• Single Number
• Happy Number
• Binary Tree Inorder Traversal

Medium

• Group Anagrams
• Longest Common Substring
• Reverse Words in a String
• Longest Palindromic Substring
• Kth Largest Element
• Sqrt x
• Single Number II
• Binary Tree Preorder Traversal
• Binary Tree Inorder Traversal
• Subsets

Array

• Remove Element
• First Missing Positive
• 2 Sum
• Median
• Subsets

Hard

• First Missing Positive
• Binary Tree Postorder Traversal
• Distinct Subsequences

Quick Sort

• Median

Heap

• Kth Largest Element

Divide and Conquer

• Kth Largest Element

Binary Search

• Sqrt x

Math

• Sqrt x
• Happy Number

Bit Manipulation

• Single Number
• Single Number II
• Subsets

Linked List

• Remove Duplicates from Sorted List

Tree

• Binary Tree Preorder Traversal
• Binary Tree Inorder Traversal
• Binary Tree Postorder Traversal

Stack

• Binary Tree Preorder Traversal
• Binary Tree Inorder Traversal
• Binary Tree Postorder Traversal

Binary Search Tree

• Minimum Absolute Difference in BST

Backtracking

• Subsets

Dynamic Programming

• Distinct Subsequences