epi
May 13, 2016 · View on GitHub
This is a work-in-progress, solutions for Elements of Programming Interviews problems written in Golang.
Solutions
Primitive Types
Arrays
Strings
Linked List
Stacks and Queues
Stacks
Queues
| Problem | Test | Solved |
|---|---|---|
| Compute binary tree nodes in order of increasing depth | tests | ✓ |
| Implement a circular queue | tests | ✓ |
| Implement a queue using stacks | tests | ✓ |
| Implement a queue with max API | tests |
Binary Trees
Heaps
Searching
Binary Search
Generalized Search
Hash Tables
Sorting
Binary Search Trees
Recursion
Dynamic Programming
Greedy Algorithms and Invariants
Greedy Algorithms
| Problem | Test | Solved |
|---|---|---|
| Implement Huffman coding | tests | ✓ |
| Compute an optimum assignment of tasks | tests | ✓ |
| Implement a schedule which minimizes waiting time | tests | ✓ |
| The interval covering problem | tests |