Skip to content

aryanjsx/DSA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

2 Commits
Β 
Β 

Repository files navigation

DSA


Data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage. And algorithm is a set of steps used for accomplishing a particular task.

πŸ“Œ Topics to Cover for Data Structures πŸ“š

S.No. Topic Finished
1. Array
2. Stack
3. Queues
4. Linked Lists
5. Collections
6. Hash Tables
7. Recursion
8. Basic Trees & Graphs
9. Segment Trees & Fenwick Trees
10. Heap
11. Disjoint Set Union
12. Persistent Data Structures
13. Trie
14. Self-Balancing Trees
15. n-ary Trees
16. Multi dimensional Trees

πŸ“Œ Topics to Cover for Algorithms πŸ“š

S.No. Topic Finished
1. Algorithm Complexity Analysis
2. Sorting Algorithms
3. Searching Algorithms
4. Recursion
5. Greedy Algorithms
6. Prefix and Suffix
7. Hashing
8. Divide and Conquer
9. Primality Tests
10. Sieve of Eratosthenes
11. Segmented Sieve of Eratosthenes
12. Modular Arithmetics
13. Basic Dynamic Programming
14. Graph Algorithms
15. Shortest Distance Algorithms
16. Advanced String Matching
17. Decomposition Techniques
18. Game Theory
19. NP Completeness
20. Approximation Algorithms
21. Linear Programming
22. Computational Geometry
23. Advanced Dynamic Programming
24. Flow Algorithms
25. Generating Functions
26. Fast Fourier Transforms

πŸ“Œ Resources


πŸ“Œ Online Practice Platforms


We hope you now know the roadmap to become good at Data Structures and Algorithms ✌️. Have a look at our Beginners Guide for Competitive Coding and start competing in Online Contests.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published