Algorithms Exercises

Intro

Source of exercises:

• Algorithms, 4th Edition
• LeetCode
• SPOJ
• Topcoder
• LintCode

Indexes

Sort

• LeetCode
  • 147 - Insertion Sort List [Link]
  • 148 - Sort List [Link]
  • 242 - Valid Anagram [Link]

Hash

• LeetCode
  • 349 - Intersection of Two Arrays [Link]
  • 350 - Intersection of Two Arrays II [Link]

Search

Binary Search

• LeetCode
  • 4 - Median of Two Sorted Arrays [Link]
  • 29 - Divide Two Integers [Link]
  • 33 - Search in Rotated Sorted Array [Link]
  • 34 - Search for a Range [Link]
  • 35 - Search Insert Position [Link]
  • 50 - Pow(x, n) [Link]
  • 69 - Sqrt(x) [Link]
  • 74 - Search a 2D Matrix [Link]
  • 81 - Search in Rotated Sorted Array II [Link]
  • 153 - Find Minimum in Rotated Sorted Array [Link]
  • 154 - Find Minimum in Rotated Sorted Array II [Link]
  • 162 - Find Peak Element [Link]
  • 167 - Two Sum II - Input array is sorted [Link]
  • 174 - Dungeon Game [Link] TODO
  • 278 - First Bad Version [Link]
  • 374 - Guess Number Higher or Lower [Linke]
  • 441 - Arranging Coins [Link]
  • 475 - Heaters [Link]

Two Pointers

• LeetCode
  • 75 - Sort Colors [Link]
  • 209 - Minimum Size Subarray Sum [Link]

Tree

• LeetCode

  • 222 - Count Complete Tree Nodes [Link]

• Chapter 1

  • Section 1.1
  • Exercise 1.4.14 4-Sum
  • Exercise 1.4.15-part1 2-Sum
  • Exercise 1.4.15-part2 3-Sum
  • Exercise 1.4.16 Closest Search
  • Exercise 1.4.17 Farthest Search
  • Exercise 1.4.18 Array Local Minimum Search
  • Exercise 1.4.19 Matrix Local Minimum Search
  • Exercise 1.4.20 Bitonic Search
  • Exercise 1.4.22 Fibonacci Search
  • Exercise 1.4.23 Fraction Binary Search

• Chapter 2

  • Section 2.1.2 Selection Sort
  • Section 2.1.3 Insertion Sort

• Chapter 3

  • Section 3.4.1.2 Mod Hash