Private Algorithms & Data Structures lessons with AI
Algorithms & Data Structures 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.
Teacher: Noam
- Course updated 11/2026
- Hebrew, and 5 more languages
- 4 levels: Beginners · Intermediate · Advanced · Test prep
- 48 lessons · about 27 hours of lessons
Algorithms & Data Structures
Algorithms & Data Structures 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 · 4 modules · Live private lesson with the teacher on the board
What you'll learn
- Algorithmic Thinking and Complexity
- Arrays and Lists
- Recursion
- Searching and Sorting
- Stacks and Queues
- Hash Tables
- Trees and Binary Search Trees
- Heaps and Priority Queues
- Choosing and Combining Structures
- Graphs: Representation and Traversal
- Weighted Shortest Paths
- Dynamic Programming
- Greedy Algorithms
- Interview Method: Thinking Out Loud
- Array and String Patterns
- Advanced Patterns: Search, Graphs, Intervals
- Interview Simulation
Related topics
What's included
- Live 1:1 lessons with an AI tutor on a shared board
- 27 hours of live one-on-one lessons
- 48 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 Tech Job Interviews
- A completion certificate for each level
- Computer, tablet or phone
- Hebrew, plus 5 more languages
Course plan
4 levels · 17 modules · 48 lessons · 26 hr 50 min total
BeginnersBeginner: Complexity, Arrays, Recursion, Searching and Sorting4 modules • 12 lessons • 6 hr 45 min
Algorithmic Thinking and Complexity3 lessons • 1 hr 40 min
- 1What an Algorithm Is and Counting StepsTrial lessonabout 30 min
- 2Big O: Rates of Growthabout 35 min
- 3Analysing Code: Loops, Space and Casesabout 35 min
Arrays and Lists3 lessons • 1 hr 40 min
- 4Static and Dynamic Arraysabout 35 min
- 5Linked Listsabout 35 min
- 6The Two-Pointer Techniqueabout 30 min
Recursion2 lessons • 1 hr 10 min
- 7Recursion: Base Case and Call Stackabout 35 min
- 8Analysing Recursion: The Recursion Treeabout 35 min
Searching and Sorting4 lessons • 2 hr 15 min
- 9Binary Searchabout 35 min
- 10Simple Sorts: Selection and Insertionabout 30 min
- 11Merge Sort: Divide and Conquerabout 35 min
- 12Quick Sort and Choosing a Sortabout 35 min
IntermediateIntermediate: Data Structures — Stacks, Queues, Hashing, Trees and Heaps5 modules • 12 lessons • 6 hr 50 min
Mapped to exam: ראיונות עבודה בהייטק (שאלות קוד בסגנון LeetCode)
Stacks and Queues3 lessons • 1 hr 35 min
- 1Stack: LIFO and Balanced Parenthesesabout 30 min
- 2Queue and Deque: FIFO and Circular Bufferabout 30 min
- 3Monotonic Stack: Next Greater Elementabout 35 min
Hash Tables2 lessons • 1 hr 10 min
- 4Hash Table Internals: Hashing and Collisionsabout 35 min
- 5Hashing Patterns in Interviews: Sets, Maps, Countingabout 35 min
Trees and Binary Search Trees4 lessons • 2 hr 15 min
- 6Binary Trees and Traversalsabout 35 min
- 7BST: Search and Insertabout 30 min
- 8BST Deletion and Balanced Treesabout 35 min
- 9Tree Problems in Interviewsabout 35 min
Heaps and Priority Queues2 lessons • 1 hr 10 min
- 10Heap: A Complete Tree in an Arrayabout 35 min
- 11Priority Queues in Practice: Top-K and Mergingabout 35 min
Choosing and Combining Structures1 lesson • 40 min
- 12Choosing a Data Structure and Designing an LRU Cacheabout 40 min
AdvancedAdvanced: Graphs, Shortest Paths, Dynamic Programming and Greedy4 modules • 12 lessons • 6 hr 40 min
Mapped to exam: ראיונות עבודה בהייטק (LeetCode-style coding interviews)
Graphs: Representation and Traversal4 lessons • 2 hr 10 min
- 1Graph Representation: Adjacency List and Matrixabout 30 min
- 2BFS: Layers and Unweighted Shortest Pathabout 35 min
- 3DFS: Connected Components and Cycle Detectionabout 35 min
- 4Topological Sort: Dependencies and Orderabout 30 min
Weighted Shortest Paths2 lessons • 1 hr 5 min
- 5Dijkstra: Shortest Paths with a Heapabout 35 min
- 6Bellman-Ford and Choosing a Path Algorithmabout 30 min
Dynamic Programming4 lessons • 2 hr 15 min
- 7DP Basics: Memoization and Tabulationabout 30 min
- 81D DP: Defining State and Transitionabout 35 min
- 92D DP: Grids and Stringsabout 35 min
- 100/1 Knapsack and Subset DPabout 35 min
Greedy Algorithms2 lessons • 1 hr 10 min
- 11Greedy: When Local Choice Is Rightabout 35 min
- 12Minimum Spanning Tree and Union-Findabout 35 min
Test prepCoding Interview Preparation4 modules • 12 lessons • 6 hr 35 min
Mapped to exam: ראיונות עבודה בהייטק — ראיון קוד בסגנון LeetCode
Interview Method: Thinking Out Loud3 lessons • 1 hr 35 min
- 1Anatomy of a Coding Interview: Six Stagesabout 30 min
- 2Analysing Your Own Solution's Complexityabout 35 min
- 3From Constraints to Target Complexityabout 30 min
Array and String Patterns3 lessons • 1 hr 35 min
- 4Sliding Window: Fixed and Variableabout 35 min
- 5Prefix Sums with Hashingabout 30 min
- 6Binary Search on the Answerabout 30 min
Advanced Patterns: Search, Graphs, Intervals4 lessons • 2 hr 15 min
- 7Backtracking: Subsets, Permutations, Pruningabout 35 min
- 8Grids as Graphs: Islands and Multi-Source BFSabout 35 min
- 9Intervals: Sort, Merge, Meeting Roomsabout 30 min
- 10DP in Interviews: From Recursion to Table, Out Loudabout 35 min
Interview Simulation2 lessons • 1 hr 10 min
- 11Testing and Debugging Out Loudabout 30 min
- 12Full Mock Interviewabout 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
- Teens and adults who want to understand the subject in depth
- For anyone preparing for Tech Job Interviews
Exams and certifications
- Tech Job Interviews
- Intermediate: ראיונות עבודה בהייטק (שאלות קוד בסגנון LeetCode)
- Advanced: ראיונות עבודה בהייטק (LeetCode-style coding interviews)
- Test prep: ראיונות עבודה בהייטק — ראיון קוד בסגנון LeetCode
More courses in this track
Your teacher
NoamAI private tutor, in a live lesson on a shared boardA 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 & Data Structures lesson work?
- Pick Algorithms & Data Structures 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 & Data Structures course take?
- 12 lessons of about 34 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 freeShiur Prati with AI: what it is and how it works







