This repository contains comprehensive notes and code implementations for the concepts covered in the Strivers DSA A to Z Course/Sheet.
- Step 1 : Learn the basics
- Step 2 : Learn Important Sorting Techniques
- Step 3 : Solve Problems on Arrays [Easy -> Medium -> Hard]
- Step 4 : Binary Search [1D, 2D Arrays, Search Space]
- Step 5 : Strings [Basic and Medium]
- Step 6 : Learn LinkedList [Single LL, Double LL, Medium, Hard, Problems]
- Step 7 : Recursion [PatternWise]
- Step 8 : Bit Manipulation [Concepts & Problems]
- Step 9 : Stack and Queues [Learning, Pre-In-Post-fix, Monotonic Stack, Implementation]
- Step 10 : Sliding Window & Two Pointer Combined Problems
- Step 11 : Heaps [Learning, Medium, Hard Problems]
- Step 12 : Greedy Algorithms [Easy, Medium/Hard]
- Step 13 : Binary Trees [Traversals, Medium and Hard Problems]
- Step 14 : Binary Search Trees [Concept and Problems]
- Step 15 : Graphs [Concepts & Problems]
- Step 16 : Dynamic Programming [Patterns and Problems]
- Step 17 : Tries
- Step 18 : Strings
source : https://takeuforward.org/strivers-a2z-dsa-course/strivers-a2z-dsa-course-sheet-2
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent