Algorithms

Algorithms help

from sorting to dynamic programming, in Singapore

Get a Free Quote Telegram

Sorting and searching are the warm-up. The real challenge is recognising which pattern a problem maps to, greedy, divide-and-conquer, DP, or graph, then implementing it cleanly. I tutor through past year papers and problem sets until the pattern matching becomes second nature.

What's included

How Algorithms support works with me

  • Pattern-matching approach to problem solving
  • DP from 1D to 2D with worked examples
  • Graph algorithms with templates
  • Competitive programming tips

Covered topics

What Algorithms covers

Sorting algorithms Searching Divide and conquer Greedy algorithms Dynamic programming Graph algorithms (BFS/DFS) Shortest path (Dijkstra, Bellman-Ford) MST (Kruskal, Prim) NP-completeness Competitive programming basics

Module, language, or framework not listed? Message me anyway and I will tell you honestly whether I can help.

How it works

Four steps from enquiry to delivery

  1. 01
    Reach out
    Telegram is fastest. Tell me what you need and the deadline.
  2. 02
    Share details
    Module code, requirements, any existing code or starter files.
  3. 03
    Get a quote
    Honest fixed price and timeline, no obligation.
  4. 04
    Work together
    I deliver, you review, we iterate until it is right.

Ready to get unstuck on Algorithms?

Send the brief and I will reply with a fixed price, usually within the hour.

Get a Free Quote Telegram