cd155/algorithm-design-with-haskell

Using Haskell to Cracking the Code Interview

Using Haskell to Cracking the Code Interview

Haskell Practice for solving real code problems, including Sorting, Searching, Tree, Graph, Recursion, Dynamic Programming and more.

Sorting

• Bubble Sort

• Radix Sort

• Quick Sort

• Merge Sort

• Interview Questions - Sorting

  • 10.1 - Sort two sorted arrays into one sorted array
  • 10.2 - Write a method to group all the anagrams (eg: "ate","eat","tea")
  • 10.11 - Sort the array into an alternating sequence of Peaks and Valleys

• Heap

  • what this heap
  • view the Heap as an array
  • build a max heap

• Heap Sort

Searching

• linear search
• binary search
• binary search with no size
• bit-related structure
• Interview Questions - Binary Search
  • 10.3 - Sort a rotated array
  • 10.4 - Search in a sorted unknown size of array
  • 10.5 - Search in a sorted (but interspersed with empty strings) array
  • 10.7 - Generate a miss integer with large file but small memory
  • 10.8
  • 10.9 - Find the element in a sorted matrix

Tree

• Academic Term Definition of Tree
• Definition - Tree
• Traverse in BiTree
  • in-order traverse
  • pre-order traverse
  • post-order traverse
• Depth-first and Breadth-first search explain
• Depth-first search
• Breadth-first search
• Interview Questions
  • 4.2, 4.4, 4.5, 4.6, 4.8, 4.9, 4.12

Graph

• Definition
• Interview Questions
  • 4.1, 4.7

LinkedList

• Definition
• Interview Questions
  • 2.1, 4.3

Recursion and Dynamic Programming

• Definition
• Interview Questions
  • 8.1, 8.2, 8.3, 8.4, 8.6, 8.7, 8.8, 8.9, 8.10