Skip to content

Latest commit

 

History

History
105 lines (93 loc) · 3.13 KB

README.md

File metadata and controls

105 lines (93 loc) · 3.13 KB
Raw

Algorithms & Data Structures

alt text

This repository can serve as an educational tool for those who want to cone their skills in algorithms and data structures. To keep you from drowning in the ocean of information online, we have gathered some resources to use for reading in each topic and solved problems for you to practice. We recommend to try the problems on your own for at least 30-40 minutes before using the hints/solutions provided.

If you want to dive deeper in algorithms, we recommend the following books and courses:

For the topic structure we follow the Competitive Programming 3 book, which is a good choice if you are preparing for programming competitions ( IOI, ACM ICPC, etc. )

Contents

  • Data Structures
    • Linear DS ( Array, List, Stack, Queue, Bitmask )
    • Non-Linear DS ( Trees, Heaps, Hash Tables )
    • Advanced DS ( Binary Indexed Trees, Segment Trees )
  • Complete Search
  • Divide and Conquer
  • Greedy
  • Dynamic Programming
  • Graphs
    • Graph Traversal ( BFS, DFS, Flood fill, Topological Sort, Articulation points/Bridges, etc.)
    • Minimum Spanning Tree ( Prim, Kruskal )
    • Shortest Paths ( Dijkstra, Bellman-Ford, Floyd Warshall )
    • Network flow
    • Special Graphs ( DAG, Eulerian, Bipartite, etc. )
  • Mathematics for CS
  • String Processing
  • Computational Geometry
  • Advanced Topics
  • Rare and Interesting Algorithmic Problems

Structure

The problems in each topic are organized by subtopic or difficulty:

├── Topic1
|   |
|   ├── Resources.md
|   |                    
│   ├── Easy
│   │   ├── Problem1
│   │   ├── Problem2
│   │   └── Problem3
|   |
|   └── Medium
│       ├── Problem1
│       ├── Problem2
│       └── Problem3
├── Topic2
|   |
|   ├── Resources.md
|   |                    
│   ├── Sub-topic1
│   │   └── Problem1
|   |
|   └── Sub-topic2
│       ├── Problem1
│       └── Problem2
.
.
.

An example might look like this:

.
.
.
├── Dynamic Programming
|   |
|   ├── Resources.md
|   |                    
│   ├── Easy
│   │   ├── Problem1
│   │   ├── Problem2
│   │   └── Problem3
|   |
|   └── Medium
│       ├── Problem1
│       ├── Problem2
│       └── Problem3
├── Graphs
|   |
|   ├── Resources.md
|   |                    
│   ├── BFS
│   │   └── Problem1
|   |
|   └── DFS
│       ├── Problem1
│       └── Problem2
.
.
.

Contributing

Contributions are always welcome! Please check our contribution guidelines to get started.