1-on-1 Advanced Python Tutoring: Algorithms and Data Structures

Each session introduces one idea, such as binary search or recursion, with a whiteboard explanation. The learner then solves two or three problems while thinking aloud, and the tutor coaches their approach: understand, plan, code, test. Problems are set between sessions.

How classes work

Each 55-minute session is one learner with one teacher. There is no fixed lesson plan or set number of sessions: families book as many as they want, and the teacher sets the pace and focus around the learner's goals and gives feedback as they work.

What we can work on

• 

  Problem-Solving Method and Big O – A routine for tackling problems and judging speed.

• 

  Searching – Linear and binary search.

• 

  Sorting – Selection, insertion and merge sort.

• 

  Stacks and Queues – Use them to solve bracket and scheduling problems.

• 

  Dictionaries and Sets – Fast lookups and counting.

• 

  Recursion – Think in smaller versions of the same problem.

• 

  Intro to Dynamic Programming – Remember answers to avoid repeat work.

• 

  Timed Problem Set and Review – Solve under time and review.

Ages 13-18. Confident with functions, lists, dictionaries and loops in Python.