Цели курса

* Научиться распознавать основные алгоритмические паттерны * Понимать, когда и почему применяется тот или иной алгоритм * Перестать решать задачи методом перебора и начать мыслить системно * Освоить техники, наиболее часто встречающиеся на технических интервью * Подготовиться к coding interview в Big Tech и сильных продуктовых компаниях

Curriculum

9 Chapters · 106 Lessons

  1. 1
    1. (Included in full purchase)

      Welcome to DSA 2

    2. (Included in full purchase)

      AI-assisted Interview Prep

    3. (Included in full purchase)

      AI Learning Mode

    4. (Included in full purchase)

      AI Interview Mode

  2. 2
    1. (Included in full purchase)

      Pointers Technique Intro Notebook LM

    2. (Included in full purchase)

      Introduction

    3. (Included in full purchase)

      Read-Write Pointers

    4. (Included in full purchase)

      Read-Write Pointers Practice

    5. (Included in full purchase)

      Left-Right Pointers

    6. (Included in full purchase)

      Left-Right Pointers Practice

    7. (Included in full purchase)

      Fast-Slow Pointers

    8. (Included in full purchase)

      Fast-Slow Pointers Practice

    9. (Included in full purchase)

      Multi Pointers

    10. (Included in full purchase)

      Multi Pointers Practice

    11. (Included in full purchase)

      AI Learning Quiz

    12. (Included in full purchase)

      Final note

  3. 3
    1. (Included in full purchase)

      Sliding Window Intro Notebook LM

    2. (Included in full purchase)

      Why Sliding Window?

    3. (Included in full purchase)

      What is Sliding Window?

    4. (Included in full purchase)

      Sliding Window Types

    5. (Included in full purchase)

      Sliding Window Code Template

    6. (Included in full purchase)

      AI Learning Quiz

    7. (Included in full purchase)

      LeetCode Problems

    8. (Included in full purchase)

      Final Note

  4. 4
    1. (Included in full purchase)

      Prefix Sum Intro NotebookLM

    2. (Included in full purchase)

      Introduction

    3. (Included in full purchase)

      Step 1. Prefix like State

    4. (Included in full purchase)

      Step 2: Difference in states = change

    5. (Included in full purchase)

      Step 3. State search in history

    6. (Included in full purchase)

      Step 4. Storing metadata in Map

    7. (Included in full purchase)

      AI Learning Quiz

    8. (Included in full purchase)

      LeetCode 560. Subarray Sum Equals K

    9. (Included in full purchase)

      LeetCode 525. Contiguous Array

    10. (Included in full purchase)

      LeetCode 325. Maximum Size Subarray Sum Equals k

    11. (Included in full purchase)

      LeetCode 930. Binary Subarrays With Sum

    12. (Included in full purchase)

      LeetCode 1248. Count Number of Nice Subarrays

    13. (Included in full purchase)

      Bonus Section. Modulo Prefix

  5. 5
    1. (Included in full purchase)

      Searching Algorithms Intro NotebookLM

    2. (Included in full purchase)

      Introduction to Searching Algorithms

    3. (Included in full purchase)

      Linear Search

    4. (Included in full purchase)

      Linear Search LeetCode Problems

    5. (Included in full purchase)

      Linear Search Common Mistakes

    6. (Included in full purchase)

      Binary Search

    7. (Included in full purchase)

      Binary Search Interactive Debugger

    8. (Included in full purchase)

      Inclusive vs Exclusive Boundaries in Binary Search

    9. (Included in full purchase)

      AI Learning Quiz

    10. (Included in full purchase)

      Binary Search LeetCode Problems

    11. (Included in full purchase)

      Binary Search Common Mistakes

  6. 6
    1. (Included in full purchase)

      Sorting Basics

    2. (Included in full purchase)

      Sorting Properties

    3. (Included in full purchase)

      Bubble Sort

    4. (Included in full purchase)

      Selection Sort

    5. (Included in full purchase)

      Insertion Sort

    6. (Included in full purchase)

      Merge Sort

    7. (Included in full purchase)

      Quick Sort

    8. (Included in full purchase)

      Heap Sort

    9. (Included in full purchase)

      Debugger for All Sorting Algorithms

    10. (Included in full purchase)

      LeetCode Problems

    11. (Included in full purchase)

      Sorting Comparison

  7. 7
    1. (Included in full purchase)

      Greedy Intro NotebookLM

    2. (Included in full purchase)

      Why Greedy?

    3. (Included in full purchase)

      What is Greedy Algorithm

    4. (Included in full purchase)

      Local vs Global Optimum

    5. (Included in full purchase)

      Why Greedy Sometimes Works

    6. (Included in full purchase)

      When Greedy Fails

    7. (Included in full purchase)

      Recognizing Greedy Problems

    8. (Included in full purchase)

      Designing a Greedy Rule

    9. (Included in full purchase)

      Proving a Greedy Algorithm is Correct

    10. (Included in full purchase)

      Why Greedy Starts with Sorting

    11. (Included in full purchase)

      Greedy Algorithm Template

    12. (Included in full purchase)

      Example LeetCode Greedy Solution

    13. (Included in full purchase)

      Common Greedy Patterns

    14. (Included in full purchase)

      How to recognize a Greedy Problem

    15. (Included in full purchase)

      How to solve any Greedy Problem

    16. (Included in full purchase)

      Greedy Algorithm Checklist

    17. (Included in full purchase)

      Greedy AI Learning Quiz

    18. (Included in full purchase)

      Greedy Algorithm LeetCode Roadmap

    19. (Included in full purchase)

      Common Greedy Mistakes

  8. 8
    1. (Included in full purchase)

      Backtracking Intro NotebookLM

    2. (Included in full purchase)

      What Is Backtracking?

    3. (Included in full purchase)

      When Should You Use Backtracking?

    4. (Included in full purchase)

      How Does Backtracking Work?

    5. (Included in full purchase)

      The Importance of Undo

    6. (Included in full purchase)

      The Universal Backtracking Template

    7. (Included in full purchase)

      Pruning: Optimizing Backtracking

    8. (Included in full purchase)

      Backtracking vs. Recursion, DFS, and Greedy

    9. (Included in full purchase)

      Sample Backtracking LeetCode Solution

    10. (Included in full purchase)

      Common Backtracking Patterns

    11. (Included in full purchase)

      Common Backtracking Mistakes

    12. (Included in full purchase)

      Time and Space Complexity of Backtracking

    13. (Included in full purchase)

      Backtracking AI Learning Quiz

    14. (Included in full purchase)

      Backtracking LeetCode Roadmap

    15. (Included in full purchase)

      Summary & Backtracking Cheat Sheet

  9. 9
    1. (Included in full purchase)

      DP Part 1 Intro NotebookLM

    2. (Included in full purchase)

      Why DP Exists

    3. (Included in full purchase)

      DP and Recursion

    4. (Included in full purchase)

      From Brute Force to DP

    5. (Included in full purchase)

      Memoization (Top-Down DP)

    6. (Included in full purchase)

      DP Foundations

    7. (Included in full purchase)

      Kadane's Algorithm

    8. (Included in full purchase)

      What is 1D DP

    9. (Included in full purchase)

      1D DP Patterns

    10. (Included in full purchase)

      Greedy vs Backtracking vs DP

    11. (Included in full purchase)

      DP AI Learning Quiz

    12. (Included in full purchase)

      DP LeetCode Roadmap

    13. (Included in full purchase)

      Common DP Mistakes

Начать DSA 2 →

Присоединяйтесь к потоку

[email protected] Opens email in new window