This repository contains my solutions to popular algorithms and data structures.
My plan is to implement each solution in Go and Ruby. However, some problems might only have one implementation.
Some problems include variations. These are kept in the same folder.
Set of rules to solve a given problem. Commonly, they work hand in hand with data structures.
- Binary Search | wiki
- Bubble Sort | wiki
- Merge Sort | wiki
- Selection Sort | wiki
- Insertion Sort | wiki
- Quicksort | wiki
- Quickselect | wiki
Depending on the actual problem, using different data structures bring efficiency (speed/memory) to our solution. Understanding their trade-offs and where to use them is as important as understanding how they work.
- Linked list | wiki
- Doubly linked list | wiki
- Queue | wiki
- Stack | wiki
- Binary Search Tree | wiki
- Hash Table | wiki - WIP: implement linked-list collision handling for both