Computer Science Interview Algorithms
This is created so I could implement from scratch a handfull of computer science standard interview algoritms and data structures. Hopefully to save time in interviews so can actually talk about intereasting stuff like large search space and Genetic Algorithms or something related to my experience. Maybe even more day to day pros and cons of X technology or Y technology. Plus it would be a lot more fun doing it here than in an interview setting which I find very unrealistic. However I will be the first to admit after over a decade of school I could use a refresher. Thus time to work on a good implementation (with tests even!). Implementation: I choose to implement these in Go to help increase my proficiency in the language. Mainly on a chromebook instead of reading I figured I would write these to get me to sleep at night.
Data Types:
- Tree
- Linked Lists (single, double)
- Graph
- Stack
- Heap
- Queue
- Priority Queue
Algorithms
- Binary Search
- Tree Traversal (pre, in, post)
- Sorting algorithms (merge, quick)
- Graph Search
- Breadth First / Depth first Search
- Hashtable