Saumya Yadav

Crack complex problems with ease by mastering two powerful problem-solving techniques — Backtracking and Divide & Conquer. These notes cover essential concepts, classic algorithms, and interview-level questions that are frequently asked in coding rounds.

What’s Included:

• Core Concepts of Backtracking
• Standard Backtracking Problems (N-Queens, Sudoku Solver, etc.)
• Divide and Conquer Approach
• Merge Sort
• Quick Sort
• Recursion Tree and Time Complexity
• Important Interview & OA Questions from platforms like LeetCode, GFG, and more

Check the Full Problem Sheet Here:

cpp-dsa-sheet.vercel.app/sheet

Why These Notes?

These notes break down complex recursive problems into simple steps with clear logic. Many students have found them extremely helpful while preparing for product-based company interviews and online coding assessments.

Student Feedback:

"Boht hi badiya notes hai 👌"