This is a work-in-progress, solutions for Elements of Programming Interviews problems written in Golang.
| 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 |
| 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 |