Algorithms & Data Structures Tutor | Mohamed Abdelnaby
Skip to main content
1-on-1 CS Tutoring

Algorithms & Data Structures Tutoring

Sorting, graphs, DP, trees, and complexity, built up the right way.

Algorithms is one of those classes where students often understand each topic on its own and still cannot solve unfamiliar problems. I focus on building the pattern recognition that makes problems start to feel familiar instead of intimidating.

Best for students in algorithms courses, interview prep, or anyone wanting a deeper grip on problem solving.

What I help with

Common things students bring to sessions

  • Dynamic programming makes sense in lecture but I cannot recognize when to use it.
  • I get stuck on Big-O analysis and proving complexity bounds.
  • Graph algorithms (BFS, DFS, Dijkstra, MST) blur together.
  • I keep failing leetcode-style interview problems even when I know the topic.
  • Recursion and tree traversals are not clicking.

Topics covered

Sorting algorithms and complexity analysis
Graph algorithms (BFS, DFS, shortest paths, MST, topological sort)
Dynamic programming patterns and recurrences
Tree structures and traversals (BST, heap, trie, segment tree)
Hashing and hash table internals
Greedy algorithms and proof techniques
Big-O and Big-Theta complexity analysis
Interview-style problem solving

How sessions work

Free 15-minute call

Tell me your course, the assignment, your deadline, and what you are stuck on. I will let you know if I can help.

Schedule your session

We pick times that work around your week. Single sessions, weekly slots, or short bursts before exams, all fine.

Walk in stuck, walk out unstuck

We work through your actual code, problem set, or concepts together until it clicks. You leave with notes you can use.

What you'll walk away with

A clear plan to finish your assignment, project, or exam prep.
Confidence in the concepts your course is actually testing.
Code you understand line by line, not just code that compiles.
A faster way to debug your own work when I'm not around.
Notes and worked examples you can come back to before the exam.
Honest feedback on what to focus on, and what to skip.

What students have said

Knowledgeable and Patient Tutor

"Mohamed has been incredibly helpful to me across multiple courses. He provided strong support in CMPEN 271, where we worked extensively with FPGA systems, and consistently made complex concepts much easier to understand. He has also been a great resource in other classes, such as AI, data-driven courses, and app programming, always taking the time to explain the material clearly and effectively. His patience, knowledge, and ability to break down difficult topics make him an excellent tutor."

Satyadeep, 69 lessons

Exceptional Computer Science Tutor

"I had many lessons with Mohamed, and I learned a great deal from him. Some of the topics we covered included Java polymorphism, Java GUI projects such as JavaFX, multi-threading and concurrency programming, and even building a calculator compiler in C++. What I especially appreciated about Mohamed's lessons was his dedication beyond our scheduled sessions. He often took extra time outside of class to prepare explanations and examples tailored to how I learn best."

Spencer, 40 lessons

Knowledgeable and Patient Tutor

"I learned computer architecture and assembly language from Mohamed. He's a very patient tutor and explains concepts very well. He's also very punctual. I was very scared before my final exam and was struggling, however he helped me get my confidence back and taught me concepts very well at a good pace as per my learning style so that I could be best prepared for my final. In the end, it all worked out for me."

Priaka, 23 lessons

Ready to get unstuck? Start with a free 15-minute call. Tell me your course, the assignment, your deadline, and what is in the way. If I can help, we will book a real session.