/syllabus

Syllabus

We developed a way to easily teach students the significant patterns to build upon and eventually practice independently without the mental heap required to understand these interview-level questions that our industry asks.

Every subject is explained through problem-solving and templating the significant pieces to develop speed and understanding.

This eight-week Immersive will cover the most common patterns and modifications on each topic weekly every Monday, Wednesday, and Friday from 5:30 PST to 8:30 PST / 8:30 pm EST to 11:30 pm EST.

We would review all the modifications and sub-patterns for each category and build a template from intuition.

How each class would work

DSA questions are like an art form. Once you master the common patterns, you build your catalog of templates; then it comes to the problem-solving part. This course will teach you each pattern and template and explain how to use it for problem-solving.

We would have 22 classes, and it will go as follows:

  • 5-minute introduction to the topic
  • 30-minute pattern review
  • 30-minute peer interview exchange
  • 10-minute break
  • 30-minute pattern review
  • 30-minute peer interview exchange
  • 5-minute wrap up of the day

Immersive breakdown

#1 First week

  • First class
    • Same Direction
    • Opposite Directions
  • Second class
    • Sliding Window
    • Prefix Sum
  • Third class
    • Cylce Finding
    • Composed Patterns with Pointer

#2 Second week

  • First class
    • Sorted Arrays
    • Rotated Sorted Arrays
  • Second class
    • Divide and Conquer
    • Binary Search on steroids with Divide and Conquer
  • Third class
    • Sequences
    • Grid

#3 Third week

  • First class
    • Subsequences
    • Partition
  • Second class
    • Interval
    • Two Sequences
  • Third class
    • 0/1 Knapsack
    • Bitmask
    • DP on Trees

#4 Forth week

  • First class
    • Combinatorial Search
    • Momoization
  • Second class
    • Prunning
    • Dedup
  • Third class
    • Subsets
    • Composed Patterns with Recursion

#5 Fifth week

  • First class
    • DFS Basics
    • DFS on Trees
  • Second class
    • DFS on BST
    • DFS on Graphs
  • Third class
    • Heap Basics
    • Top K

#6 Sixth week

  • First class
    • Moving Best
    • Multiple Heaps
  • Second class
    • BFS Basics
    • BFS on Trees
  • Third class
    • BFS on Graphs
    • Shortest Path

#7 Seveth week

  • First class
    • Matrix as graph's
    • Implicit Graphs
  • Second class
    • Topological Sort
    • Weighted Graph
  • Third class
    • Minimun Spanning Tree
    • Intervals

#8 Eigth week

  • First class
    • Greedy
    • OOP Data Structure Design