LeetCode & Algorithms Course

LeetCode & Algorithms Course

Learn the patterns behind each problem type with step-by-step visualizations, multiple solutions and practice exams.

You haven't completed anything yet. Start with the first section and your progress will show up here.Start the course →

Sections

  1. 00Available

    Start here

    What LeetCode is, why learning patterns matters, and how to use this course (try → learn).

    The world of LeetCodeHow to read a problemHow to study
    0/2 lessons0%
  2. 01Available

    Fundamentals: Big-O

    Before any pattern: how to measure and justify the efficiency of any code.

    Growth classesAnalysis rulesSpace complexity
    0/3 lessons0%
  3. 02Available

    Array

    The foundation of everything: the patterns here reappear in almost every other section.

    Hash mapTwo pointersSliding windowPrefix/suffix productKadane
    0/7 lessons · exam: 0/30%
  4. 03Available

    String

    Consolidates two pointers and sliding window in another context; introduces the stack.

    Sliding window with frequencyAnagramsStackExpand from the center
    0/7 lessons · exam: 0/30%
  5. 04Available

    Binary

    Binary search as a natural continuation of arrays; bits as an independent module.

    Binary searchRotated arrayXORShifts and masks
    0/7 lessons · exam: 0/30%
  6. 05Available

    Linked List

    First contact with chained structures and pointer manipulation.

    Slow/fastIn-place reversalDummy nodeCycle (Floyd)
    0/7 lessons · exam: 0/30%
  7. 06Available

    Matrix

    2D arrays; your first concrete DFS/backtracking, setting up for graphs.

    Spiral traversalIn-placeDFS on a gridBacktracking
    0/7 lessons · exam: 0/30%
  8. 07Available

    Intervals

    Sorting + greedy reasoning — a breather before the recursion block.

    Sort + scanMergeOverlap
    0/6 lessons · exam: 0/30%
  9. 08Available

    Trees

    A deep dive into recursion; the gateway to heap and graph.

    Recursive DFSLevel-order BFSBSTTrie
    0/7 lessons · exam: 0/30%
  10. 09Available

    Heap

    A tree on the inside; revisits earlier problems with the new tool.

    Min/max heapTop-KTwo heaps
    0/5 lessons · exam: 0/30%
  11. 10Available

    Graphs

    Generalizes the DFS/BFS already practiced in matrix and tree to the most general structure.

    DFSBFSTopological sortUnion-find
    0/6 lessons · exam: 0/30%
  12. 11Available

    Dynamic Programming

    The hardest type: memoization is born from mastered recursion. Closes the course.

    Memoization vs tabulation1D DPInclude/excludeDP on strings
    0/7 lessons · exam: 0/30%