A2Z DSA Sheet

This repository contains my solutions to the A2Z DSA Sheet created by Striver. I am following this structured guide to master Data Structures and Algorithms (DSA), providing solutions and updates for each step of the roadmap.

Table of Contents

1. Step 1: Basics
2. Step 2: Arrays
3. Step 3: Sorting and Searching
4. Step 4: Binary Search
5. Step 5: Strings
6. Step 6: Learn LinkedList
7. Step 7: Recursion
8. Step 8: Bit Manipulation
9. Step 9: Stack and Queues
10. Step 10: Sliding Window & Two Pointer Combined Problems
11. Step 11: Heaps
12. Step 12: Greedy Algorithms
13. Step 13: Binary Trees
14. Step 14: Binary Search Trees
15. Step 15: Graphs
16. Step 16: Dynamic Programming
17. Step 17: Tries
18. Step 18: Strings
19. Contributing
20. License

Step 1: Basics

Lec 1: Introduction to DSA

• Repo Link

Lec 2: Complexity Analysis

• Repo Link

---

Step 2: Arrays

Lec 1: Introduction to Arrays

• Repo Link

Lec 2: Easy Array Problems

• Repo Link

Lec 3: Medium Array Problems

• Repo Link

---

Step 3: Sorting and Searching

Lec 1: Sorting Algorithms

• Repo Link

Lec 2: Searching Algorithms

• Repo Link

Lec 3: Hard

• Repo Link

---

Step 4: Binary Search

Lec 1: BS on 1D Arrays

• Repo Link

Lec 2: BS on Answers

• Repo Link

Lec 3: BS on 2D Arrays

• Repo Link

---

Step 5: Strings

Lec 1: Basic and Easy String Problems

• Repo Link

Lec 2: Medium String Problems

• Repo Link

---

Step 6: Learn LinkedList

Lec 1: Learn 1D LinkedList

• Repo Link

Lec 2: Learn Doubly LinkedList

• Repo Link

Lec 3: Medium Problems of LL

• Repo Link

Lec 4: Medium Problems of DLL

• Repo Link

Lec 5: Hard Problems of LL

• Repo Link

---

Step 7: Recursion

Lec 1: Get a Strong Hold

• Repo Link

Lec 2: Subsequences Pattern

• Repo Link

Lec 3: Trying out all Combos

• Repo Link

---

Step 8: Bit Manipulation

Lec 1: Learn Bit Manipulation

• Repo Link

Lec 2: Interview Problems

• Repo Link

Lec 3: Advanced Maths

• Repo Link

---

Step 9: Stack and Queues

Lec 1: Learning

• Repo Link

Lec 2: Prefix, Infix, PostFix Conversion Problems

• Repo Link

Lec 3: Monotonic Stack/Queue Problems

• Repo Link

Lec 4: Implementation Problems

• Repo Link

---

Step 10: Sliding Window & Two Pointer Combined Problems

Lec 1: Medium Problems

• Repo Link

Lec 2: Hard Problems

• Repo Link

---

Step 11: Heaps

Lec 1: Learning

• Repo Link

Lec 2: Medium Problems

• Repo Link

Lec 3: Hard Problems

• Repo Link

---

Step 12: Greedy Algorithms

Lec 1: Easy Problems

• Repo Link

Lec 2: Medium/Hard Problems

• Repo Link

---

Step 13: Binary Trees

Lec 1: Traversals

• Repo Link

Lec 2: Medium Problems

• Repo Link

Lec 3: Hard Problems

• Repo Link

---

Step 14: Binary Search Trees

Lec 1: Concepts

• Repo Link

Lec 2: Practice Problems

• Repo Link

---

Step 15: Graphs

Lec 1: Learning

• Repo Link

Lec 2: Problems on BFS/DFS

• Repo Link

Lec 3: Topo Sort and Problems

• Repo Link

Lec 4: Shortest Path Algorithms and Problems

• Repo Link

Lec 5: Minimum Spanning Tree

• Repo Link

Lec 6: Other Algorithms

• Repo Link

---

Step 16: Dynamic Programming

Lec 1: Introduction to DP

• Repo Link

Lec 2: 1D DP

• Repo Link

Lec 3: 2D/3D DP and DP on Grids

• Repo Link

Lec 4: DP on Subsequences

• Repo Link

Lec 5: DP on Strings

• Repo Link

Lec 6: DP on Stocks

• Repo Link

Lec 7: DP on LIS

• Repo Link

Lec 8: MCM DP | Partition DP

• Repo Link

Lec 9: DP on Squares

• Repo Link

---

Step 17: Tries

Lec 1: Theory

• Repo Link

Lec 2: Problems

• Repo Link

---

Step 18: Strings

Lec 1: Hard Problems

• Repo Link

---

Contributing

We welcome contributions! If you'd like to contribute to any of the topics, feel free to fork the repo and submit a pull request.