id,title,slug,link,category_id,tags,type_id,image,provider_id,publisher_id,university_id,institution_id,duration,cost_id,certificate,difficulty,description,syllabus,pages,added_date,published_date,bad_link,popular 79819,"Strivers A2Z DSA Course/Sheet",strivers-a2z-dsa-course-sheet-79819,https://takeuforward.org/strivers-a2z-dsa-course/strivers-a2z-dsa-course-sheet-2/,7,138,3,https://www.moocable.com/uploads/files/e2o7s3w_lzc4nfb.png,18,,,,"5 weeks",1,,Intermediate,"

Strivers A2Z DSA Course is a comprehensive course designed for individuals who want to learn Data Structures and Algorithms (DSA) from basic to advanced levels in a well-organized and structured manner. This course is available for free and offers high-quality lectures that are comparable to paid courses. While the course does not provide doubt support, the community engagement through YouTube video comments helps resolve queries effectively. Here are some key highlights of the Strivers A2Z DSA Course:

Teaches problem-solving skills by delving deep into DSA with over 450 modules.
Provides in-depth video solutions covering brute force, better, and optimal solutions.
Offers well-structured articles and notes for quick revision.
Includes coding examples in C++, Java, Python, and Javascript.
Associates company tags with each problem for practical relevance.
Features a notes section for saving personal notes for quick revision.
Used by over 1.5 million people worldwide in the last year.
All lectures are recorded in 4K resolution.
Contains a vast number of modules not found in other paid or unpaid courses.

","

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

Step 19: Request from Striver

",,2024-06-24,,no,yes