Award-Winning Computer Science Tutors
serving Spokane, WA

Intensely curious, I am interested in STEM subjects and the liberal arts. I tutor to help you reach your educational goals and because it's immensely gratifying to see my students succeed.

Applied mathematics at UCLA means Maria writes code constantly — from implementing numerical methods to building optimization algorithms for economics models. She brings that practical, problem-solving mindset to computer science topics like data structures, algorithm analysis, and debugging logic errors in real programs.

As a dedicated tutor with over 2 years of experience, I am passionate about fostering a supportive learning environment where students can thrive in subjects like Algebra, Business Analytics, and Data Science. Currently pursuing my Bachelor's in Informatics at the University of Washington, I incorporate real-world applications into my teaching to engage students and enhance their understanding of complex concepts. My approach emphasizes personalized learning, encouraging students to ask questions and develop critical thinking skills. I find great joy in witnessing my students' growth and success, and I strive to instill a love for learning that extends beyond the classroom.

Studying Computer Science at the University of Washington means Antonia is immersed in algorithms, data structures, and computational thinking every day. She unpacks topics like sorting algorithms, Big-O analysis, and abstraction by connecting them to practical problems students can visualize. Her dual-language tutoring background also makes her particularly skilled at explaining technical jargon in plain, accessible terms.

I'm a tutor who loves the moment when a concept finally clickswhether that's solving a calculus problem or debugging a first Python script. With experience teaching math from elementary to college level and professional training in full-stack development, I help students build confidence alongside competence in both math and programming. At Mathnasium, I worked with groups of 4-6 students at different levels, learning to adapt quickly to different learning styles. I bring that same flexibility to teaching HTML, CSS, JavaScript, Python, and other programming languages. I don't just give answersI guide students to discover solutions themselves because that's what sticks. Whether it's explaining why a for-loop isn't working, walking through derivatives, preparing for the SAT, or building a first web page, I focus on understanding over memorization. I'm patient but direct, and I adjust my approach based on what's actually working for each student. My goal is simple: make learning feel achievable, not intimidating, and give students tools they can use long after our sessions end.

Learning to code is really learning to decompose problems — figuring out what a program needs to do before writing a single line. Nat is double-majoring in computer science at Vanderbilt and unpacks core topics like loops, conditionals, data structures, and algorithm design in ways that build genuine understanding. Whether a student is writing their first Python script or debugging recursive functions, he connects each concept to the logic behind it.

From data structures and algorithms to systems-level thinking, computer science covers enormous ground. John earned a BS in Computer Science and codes in Java, C++, and SQL, giving him the range to dig into whatever topic is causing trouble — whether that's recursion, Big-O analysis, or database design.

Elizabeth's computer science degree and professional software development career mean she teaches CS concepts the way they're actually used — not just as textbook definitions. Whether it's understanding recursion, tracing through data structures, or reasoning about algorithmic efficiency, she connects abstract ideas to real code she's written on the job.

John transitioned from law into co-founding a software company, which meant teaching himself to think in algorithms, data structures, and system design under real deadlines. He approaches computer science the same way — breaking problems into smaller, solvable pieces before writing a single line of code. That builder's mindset makes debugging and logic design feel less intimidating.

As an engineering student at Brown, Kashish works with programming languages and computational thinking daily — from writing algorithms to debugging code and understanding data structures like arrays, linked lists, and trees. She breaks down abstract CS concepts by connecting them to concrete problems, making topics like recursion or object-oriented design click for students encountering them for the first time. Her analytical precision and 5.0 rating make her a strong fit for introductory through intermediate computer science.

Studying computer science at Cornell, Eric tackles everything from algorithm analysis and Big-O notation to systems-level concepts like memory management and recursion. He breaks down problems the way a CS student actually encounters them — whiteboarding a solution, tracing through edge cases, then translating logic into clean code. His 5.0 rating speaks to how clearly that approach lands.

Pursuing both computer science and data science at NYU's Courant Institute with a cybersecurity minor, Diego lives in this material daily — from algorithms and data structures to networking and systems-level thinking. He breaks abstract CS concepts into smaller, buildable pieces so students can trace the logic themselves rather than just copying solutions.

Most CS tutors come from pure software backgrounds — Clive's path runs through economics at Brown, where he picked up Java, Python, JavaScript, SQL, and HTML as tools for data analysis and building real projects rather than just completing problem sets. That applied angle makes him especially effective at teaching programming fundamentals and web technologies to students who learn better when code solves a tangible problem.

Florence doesn't just study computer science at Duke — she teaches it, having served as a TA for Intro to Databases and Computer Network Architecture while also interning in software development at IBM. That combination of academic depth and industry experience means she can explain everything from relational algebra to TCP/IP networking with concrete, real-world context. Rated 5.0 by students.

Holding both a B.S. in Computer Science from the University of Kentucky and a game development master's in progress at SCAD, Evan covers the full stack of CS fundamentals: data structures, algorithm analysis, object-oriented design, and software architecture. He connects abstract concepts like Big-O complexity or recursion to concrete implementations in C, C++, and Java so the theory actually sticks.

From sorting algorithms and Big-O analysis to data structures like linked lists and binary trees, Rhamy covers the foundational CS concepts that show up in coursework and technical interviews alike. His computer engineering degree at Vanderbilt, paired with experience in multiple languages, lets him explain abstract ideas through concrete code. Rated 5.0 by students.

Studying computer science at MIT, Brice digs into everything from data structures and algorithms to systems-level thinking with students at any stage. He's tutored over 30 students in the past year alone, tackling topics like recursion, object-oriented design, and algorithmic complexity. Rated 4.9 by students.