Skip to content

Latest commit

 

History

History
475 lines (369 loc) · 36.3 KB

File metadata and controls

475 lines (369 loc) · 36.3 KB

📝 DSA[Zero To Hero]

1. Learn Basics

Basic Maths

Basic Recursion

Basic Hashing

2. Sorting Techniques

Sorting-1

Sorting-2

3.Arrays

1.Easy

2.Medium

3.Hard

4.Binary Search

1.BS on 1D Arrays

2.BS on Answers

3.BS on 2d Arrays

5.Strings

1. Easy

2. Medium

6.Linked List

1. 1D Linked List

2. Doubly Linked List

3.Medium Problems of LL

4.Medium Problems of DLL

5.Hard Problems of LL

7.Bit Manipulation

1. Learn Bit Manipulation

2. Interview Problems

3. Advance Math

8.Stack and Queue

1. Learning

2.Monotonic Stack/Queue

3.Implementation problems

9. Sliding window and Two Pointers Method Problems

1. Medium Problems

1. Hard Problems

10.Greedy Algorithm

1.Easy Problems

2.Medium/Hard

11.Binary Trees

1. Easy

2.Medium

3.Hard

12.Binary Search Trees

1.Easy

2.Medium

13.Graphs

1.Intro

2.Problems on BFS & DFS

3. Topo Sort

4. Shortest Path Algorithms and Problems

5.Minimum Spanning Tree(MST) and Disjoint Set Problems

14.Dynamic Programming

1.1D DP

1.2D/3D DP and DP on Grids

3.DP on Subsequences/Subsets

4.DP on Strings

5.DP on Stocks

6.DP on LIS

7.Partition DP

7.DP On Squares