Mindful Data

Data Strcuture and Algorithms Repo
Explore the code »

Table of Contents

1. About The Project
2. RoadMap
3. Usage
4. Contact
5. Acknowledgments

About The Project

This repo is created for education and practice Data Structure and Algorithms in Kotlin. The implementation you find in this repo was created by some resources that I will leave in the reference section but the main source was Data Structures & Algorithms in Kotlin Book by Irina Galata and Matei Suica.

In each package of the project there will be a README file that contain explanation of the algorithm or the data structure of the package.

Each README file will be provided with Gifs, Photos, Videos, Resources, to help you understand the concept and the logic of the implementation before you dive into the code it self.

(back to top)

RoadMap

To get started with this correctly in order you must follow this Roadmap:

1. Linked List
2. Stack
3. Queues
4. Trees
5. BinaryTrees
6. Binary Search Tree
7. AVL Trees
8. Tries
9. Binary Search
10. Heap
11. Priority Queue
12. O(n2) Sorting
13. Merge sort
14. Radix Sort
15. Heap sort
16. Quick sort
17. Graphs
18. BreadthFirst Search
19. DepthFirst Search
20. Dijkstra Algorithm
21. Prim Algorithm

21 Chapter you can finish in 21 day maybe few days more if you're lazy like me.🙂

Usage

If you looking for a place to start studying DSA, then this repo is the best for you to begin with. I will also include some flashcards in order for you to memorize the important information and for the implementation you can always came back to see.

(back to top)

Contact

Linkedin/Email - Ibrahim Ezzat - [email protected]

Project Link: https://github.com/IbrahimEzzatSaad/MindfulData

Linkedin Profile isn't fully prepared yet🙄

(back to top)

Acknowledgments

The main resource for this repo was DSA book By Matei Suica, Kelvin Lau, Vincent Ngo and Irina Galata. There is some other resources that was really helpful I will put down there.

There gonna be more sources for information in each package with links provided of the topic, but those are main ones for now.

• Data Structures & Algorithms in Kotlin
• GeekForGeeks

(back to top)

Conclusion

That might seems overwhelming with all that Data strcutures and Algorithms and all its key points and when to use each one.

The best solution to wrap all that is to memorize all that stuff with flashcards and also problem solve in order to be able to work with that stuff more in real life situations.

I will leave some useful flashcards decks also a good books for interview questions that I think might be really helpful too.

BrainScape - DSA Deck - 408 Card
Teivah - Repo for DSA
Anki - Coding Interview: Data Structures and Algorithms - 95 Note
Cracking Coding Interview Programming Questions book
StudySmarter - DSA - 188 Card