My solutions to USACO contests. I'm currently in Gold. Being that I'm still learning, these solutions are not necessarily elegant.
Data structures comfortable with:
- Graphs (Adjacency Lists, Adjacency Matrices)
- Queues/Stacks/Priority Queues
- Heaps
- Linked Lists
- Binary Search Trees
- Hash Tables
- Sets/Maps
- Disjoint Set Union
Algorithms comfortable with:
- Binary Search
- Prefix Sums
- BFS/DFS
Currently learning:
- Dynamic Programming
- 1 Dimensional Range Queries (Segment Trees, Fenwick Trees)