Welcome to My Data Structures Gym!
This repository is a personal playground for learning, implementing, and experimenting with a variety of data structures and related algorithms. The goal is to strengthen understanding and skills in computer science fundamentals through hands-on practice.
- Implementations of classic data structures (arrays, linked lists, stacks, queues, trees, graphs, heaps, hash tables, etc.)
- Practice problems and solutions
- Well-documented code with explanations
- Unit tests for correctness and edge cases
- Notes and resources for further learning
.
├── src/ # Source code for data structures and algorithms
├── tests/ # Unit tests for each data structure
├── docs/ # Explanations, notes, and learning resources
├── examples/ # Example usage and small demos
└── README.md # This file
- Arrays & Dynamic Arrays
- Linked Lists (Singly, Doubly, Circular)
- Stacks & Queues
- Trees (Binary, AVL, BST, Trie, Heap)
- Graphs (Adjacency List/Matrix)
- Hash Tables
- (Add more as you expand!)
Feel free to clone this repo and experiment with the implementations:
git clone https://github.com/antoanetatanasova/my-data-structures-gym.git
cd my-data-structures-gym
# Explore and run the code!This is a personal learning project, but PRs and suggestions are welcome!
- Open an issue for ideas or questions
- Fork the repo and submit a pull request
Happy Coding!
Antoaneta Atanasova