45 free lesson minutes · Start now, no credit card needed
Shiur Prati

Private Algorithms (degree course) lessons with AI

Algorithms (degree course) with a live private lesson: the teacher talks with you out loud and explains on a shared board, moving at your pace through a clear plan, lesson after lesson.

Live 1:1 lesson with an AI teacherDegree course final exam

Teacher: Noa

  • Course updated 11/2026
  • Hebrew, and 5 more languages
  • 4 levels
  • 47 lessons · about 27 hours of lessons

Algorithms (degree course)

Algorithms (degree course) with a live private lesson: the teacher talks with you out loud and explains on a shared board, moving at your pace through a clear plan, lesson after lesson.

12 lessons · 3 modules · Live private lesson with the teacher on the board

What you'll learn

  • Algorithms, Correctness and Running Time
  • Recurrences
  • Divide and Conquer
  • Graph Traversal: BFS and DFS
  • Single-Source Shortest Paths
  • Minimum Spanning Trees
  • Greedy Algorithms and Their Correctness Proofs
  • Dynamic Programming
  • Network Flow
  • Exam Strategy and the Answer Template
  • Recurrences and Divide & Conquer Exam Questions
  • Graph Questions on the Exam
  • Greedy and Dynamic Programming on the Exam
  • Flow and Full Exam Simulation

What's included

  • Live 1:1 lessons with an AI tutor on a shared board
  • 27 hours of live one-on-one lessons
  • 47 lessons on a shared board, each with a clear goal
  • Practice and a understanding check in every lesson
  • A summary after every lesson, saved in the history
  • Preparation for the Degree course final exam
  • A completion certificate for each level
  • Computer, tablet or phone
  • Hebrew, plus 5 more languages

Course plan

4 levels · 14 modules · 47 lessons · 27 hr 20 min total

BeginnersBeginner: Complexity, Recurrences and Divide & Conquer3 modules • 12 lessons • 6 hr 55 min
  1. Algorithms, Correctness and Running Time4 lessons • 2 hr 15 min
    1. 1What Is an Algorithm: RAM Model and Insertion SortTrial lessonabout 30 min
    2. 2Proving Correctness: Loop Invariants and Inductionabout 35 min
    3. 3Asymptotic Notation: O, Omega, Thetaabout 35 min
    4. 4Comparing Growth Rates and Summationsabout 35 min
  2. Recurrences3 lessons • 1 hr 45 min
    1. 5From Recursive Code to Recurrence; Substitution Methodabout 35 min
    2. 6The Recursion Tree Methodabout 35 min
    3. 7The Master Theoremabout 35 min
  3. Divide and Conquer5 lessons • 2 hr 55 min
    1. 8Divide and Conquer: Merge Sort and Binary Searchabout 35 min
    2. 9Fast Multiplication: Karatsuba and Strassenabout 35 min
    3. 10Linear-Time Selection: Median of Mediansabout 40 min
    4. 11Closest Pair of Points in the Planeabout 35 min
    5. 12Lower Bound for Comparison Sortingabout 30 min
IntermediateIntermediate: Graph Algorithms3 modules • 12 lessons • 6 hr 45 min
  1. Graph Traversal: BFS and DFS5 lessons • 2 hr 45 min
    1. 1Graphs and Their Representationsabout 30 min
    2. 2BFS and Shortest Paths in Unweighted Graphsabout 35 min
    3. 3DFS: Discovery/Finish Times and the Parenthesis Theoremabout 35 min
    4. 4Topological Sort and Cycle Detectionabout 30 min
    5. 5Strongly Connected Componentsabout 35 min
  2. Single-Source Shortest Paths3 lessons • 1 hr 45 min
    1. 6Relaxation and Shortest Paths in a DAGabout 30 min
    2. 7Dijkstra's Algorithm: Proof and Running Timeabout 40 min
    3. 8Bellman-Ford and Negative Cyclesabout 35 min
  3. Minimum Spanning Trees4 lessons • 2 hr 15 min
    1. 9MST: The Cut and Cycle Propertiesabout 35 min
    2. 10Kruskal's Algorithm and Union-Findabout 35 min
    3. 11Prim's Algorithm and Comparison with Kruskalabout 30 min
    4. 12Modeling Problems as Graphsabout 35 min
AdvancedAdvanced Algorithms: Greedy, Dynamic Programming and Network Flow3 modules • 12 lessons • 7 hr 10 min

Mapped to exam: מבחן סופי באוניברסיטה

  1. Greedy Algorithms and Their Correctness Proofs3 lessons • 1 hr 45 min
    1. 1Interval Scheduling: Greedy Stays Aheadabout 35 min
    2. 2Exchange Argument: Scheduling to Minimize Latenessabout 35 min
    3. 3Huffman Codes: Optimal Prefix Compressionabout 35 min
  2. Dynamic Programming5 lessons • 2 hr 55 min
    1. 4From Recursion to DP: Weighted Interval Schedulingabout 35 min
    2. 5DP on Strings: LCS and Edit Distanceabout 35 min
    3. 60/1 Knapsack and Pseudo-Polynomial Timeabout 35 min
    4. 7Interval DP: Matrix Chain Multiplicationabout 35 min
    5. 8All-Pairs Shortest Paths: Floyd–Warshallabout 35 min
  3. Network Flow4 lessons • 2 hr 30 min
    1. 9Flow Networks and Ford–Fulkersonabout 35 min
    2. 10Max-Flow Min-Cut Theoremabout 40 min
    3. 11Edmonds–Karp and Flow Integralityabout 35 min
    4. 12Reductions to Flow: Matching and Disjoint Pathsabout 40 min
Test prepAlgorithms Final Exam Preparation5 modules • 11 lessons • 6 hr 30 min

Mapped to exam: מבחן סופי באוניברסיטה (מועד א) — קורס אלגוריתמים

  1. Exam Strategy and the Answer Template2 lessons • 1 hr 5 min
    1. 1Exam Anatomy and Time Managementabout 30 min
    2. 2The Answer Template: Algorithm, Correctness, Runtimeabout 35 min
  2. Recurrences and Divide & Conquer Exam Questions2 lessons • 1 hr 10 min
    1. 3Solving Recurrences: Every Exam Caseabout 35 min
    2. 4Divide & Conquer Design and Asymptotic True/Falseabout 35 min
  3. Graph Questions on the Exam3 lessons • 1 hr 45 min
    1. 5BFS/DFS Design: State Graphs and Layered Copiesabout 35 min
    2. 6Shortest Paths: Proofs and Counterexamplesabout 35 min
    3. 7Minimum Spanning Tree: Classic Proof Questionsabout 35 min
  4. Greedy and Dynamic Programming on the Exam2 lessons • 1 hr 15 min
    1. 8Greedy on the Exam: Exchange Argument and Counterexampleabout 35 min
    2. 9Dynamic Programming on the Exam: The Four-Step Templateabout 40 min
  5. Flow and Full Exam Simulation2 lessons • 1 hr 15 min
    1. 10Flow on the Exam: Reductions and Both Proof Directionsabout 35 min
    2. 11Exam Simulation and Error Reviewabout 40 min

What you need

  • No prior knowledge needed for beginner level: the teacher checks what you already know and starts from there
  • For higher levels: what you learned at the level before (you can skip it if you already know it)
  • A computer, tablet or phone with a microphone, and a browser

Who it's for

  • Adults: for work, study, an exam, or just curiosity
  • For anyone preparing for Degree course final exam

Exams and certifications

  • Degree course final exam
  • Advanced: מבחן סופי באוניברסיטה
  • Test prep: מבחן סופי באוניברסיטה (מועד א) — קורס אלגוריתמים
  • Calculus

    with Noam

    Live 1:1 lesson with an AI teacherabout 28 hours48 lessons4 levelsCalculus 1/2 exam
  • Linear Algebra

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsLinear Algebra exam
  • Discrete Math

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsDiscrete Math exam
  • Statistics and Probability

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsStatistics exam
  • Physics for students

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsPhysics 1/2 exam
  • General Chemistry

    with Noa

    Live 1:1 lesson with an AI teacher4 levelsGeneral Chemistry exam
  • Biology for students

    with Noam

    Live 1:1 lesson with an AI teacher4 levelsBiology exam
  • Intro to Economics

    with Noa

    Live 1:1 lesson with an AI teacher4 levelsIntro to Economics exam
See all courses in Courses for students

Your teacher

NoaNoaAI private tutor, in a live lesson on a shared board

A private AI teacher who teaches in a live conversation: asks, listens, draws on the board, and lets you solve it yourself with hints. Remembers what you've learned and starts each lesson where you left off.

What's a lesson like?

  • Your child talks with the teacher out loud, like a video call, and asks about anything unclear.

  • The teacher explains, writes and draws on a shared board, and your child solves along on the same board.

  • Snap a photo of a worksheet or homework and work through it, one problem at a time.

  • Parents get a report: study time, what went well and what needs more practice.

Lesson rules

  • Just Learning

FAQ

How does a private Algorithms (degree course) lesson work?
Pick Algorithms (degree course) and a level, then talk with the teacher out loud. The teacher asks what you already know, explains, writes and draws on the board, and lets you solve on your own with hints until it's clear.
How long does the Algorithms (degree course) course take?
12 lessons of about 35 minutes at the first level, at your own pace. You can pause, go back, or skip what you already know.
Do I need prior knowledge?
Not for beginner level. At the start of the first lesson the teacher checks what you already know and adjusts the level, and you can jump straight to an advanced level.
How do I start for free?
Sign in with Google or a code sent to your email, enter your child's name and grade, and the lesson starts right away. Every family gets 45 free lesson minutes in any subject, counted by actual lesson time, with no credit card. Then choose a paid plan and cancel anytime.
What device do I need?
Any computer, tablet or phone with a browser and a microphone. You can also install the site as an app on your home screen.

Want to try it?

Sign in, enter your child's name and grade, and the lesson begins. 45 free lesson minutes, no credit card.

Start for free

Shiur Prati with AI: what it is and how it works

Algorithms (degree course)The first 45 minutes are free

Private lessonStart free