Welcome to your ultimate companion for conquering ICS121 (Data Structures 1) at IIITK! This repository is packed with everything you need to not only survive but thrive in your data structures journey.
- Fully-implemented Data Structures - Ready to use, thoroughly tested, and extensively documented
- Algorithm Masterclass - Step-by-step implementations with complexity analysis
- Previous Year Question Papers - Because knowing your enemy is half the battle won!
- Solutions with Explanations - Not just what to do, but why and how
-
Clone it - Make it yours!
git clone https://github.com/manvith12/DSA-1.git
-
Star it - If this helps you, a star is the best thank you! ⭐
-
Contribute - Found a bug? Have a better solution? Create a pull request!
- 📚 Arrays & Strings
- 🔗 Linked Lists (Singly, Doubly, Circular)
- 📚 Stacks & Queues
- 🌳 Trees (Binary, BST, AVL)
- 🗺️ Graphs (Adjacency Matrix/List)
- 📊 Hash Tables
- 🔍 And more!
| Data Structure | Access | Search | Insertion | Deletion |
|---|---|---|---|---|
| Array | O(1) | O(n) | O(n) | O(n) |
| Linked List | O(n) | O(n) | O(1) | O(1) |
| Stack | O(n) | O(n) | O(1) | O(1) |
| Queue | O(n) | O(n) | O(1) | O(1) |
| Binary Tree | O(n) | O(n) | O(n) | O(n) |
| BST (avg) | O(log n) | O(log n) | O(log n) | O(log n) |
| BST (worst) | O(n) | O(n) | O(n) | O(n) |
| Hash Table | N/A | O(1) | O(1) | O(1) |
Because nothing says "I'm crushing my data structures assignment" like the right background music! Check out our Spotify playlist designed to get you in the right mindset for coding.
Having trouble with a concept? Found a bug? Just want to say hi?
- Create an issue
- Reach out on Discord
- Send a pull request
This repository is available under the MIT License - because knowledge should be free!
Remember: Arrays start at 0, and so does your journey to becoming a data structures wizard!
Happy coding! 💻✨