DoMyProgrammingHomework.ioDoMyPHW.io
By subject · Algorithms

Algorithms homework help. Code, proofs and complexity.

Dynamic programming, greedy algorithms, graph problems and proofs. Working code plus the correctness argument your grader looks for.

PythonJavaC++LaTeX proofsRecurrencesPseudocode
Upload
Questions
Budget
Send

Get your predicted budget

Free
Upload your assignment files or browsePrompt, rubric, starter code · PDF, DOCX, ZIP, code · up to 25 MB in total
Files stay private under our NDA. No email needed to see your budget.
Money-back guaranteeUnlimited revisionsNDA & confidential24/7 email support
What we cover

Every part of algorithms your course covers.

Paradigms

  • Divide and conquer
  • Dynamic programming
  • Greedy algorithms
  • Backtracking

Graphs

  • Dijkstra and Bellman-Ford
  • Minimum spanning trees
  • Network flow
  • Topological sort

Analysis

  • Big-O, Θ and Ω
  • Master theorem
  • Amortized analysis
  • Correctness proofs

Advanced

  • NP-completeness reductions
  • Approximation algorithms
  • Randomized algorithms
  • String algorithms
Example order

One algorithms order, start to finish.

What the student uploaded, what came back, and how the price was set.

01The brief
Introduction to AlgorithmsUndergradDue in 3 days

Minimum edit distance with proof

Compute the edit distance between two strings with dynamic programming, prove the recurrence is correct, and state the time and space complexity.

Requirements
  • Bottom-up DP table
  • Insert, delete and replace costs
  • Proof of the recurrence
  • Edge cases: empty strings
02The solution
edit_distance.py16 lines
1def edit_distance(a: str, b: str) -> int:
2 m, n = len(a), len(b)
3 # dp[i][j] = cost to turn a[:i] into b[:j]
4 dp = [[0] * (n + 1) for _ in range(m + 1)]
5 for i in range(m + 1): dp[i][0] = i
6 for j in range(n + 1): dp[0][j] = j
7
8 for i in range(1, m + 1):
9 for j in range(1, n + 1):
10 same = a[i - 1] == b[j - 1]
11 dp[i][j] = min(
12 dp[i - 1][j] + 1, # delete
13 dp[i][j - 1] + 1, # insert
14 dp[i - 1][j - 1] + (0 if same else 1), # replace
15 )
16 return dp[m][n]
12 tests passing · proof included
03The explanation doc
explanation.pdf
1.
The subproblem
dp[i][j] is the cheapest way to turn the first i letters of a into the first j letters of b.
2.
Proof by induction
Any optimal script ends in a delete, an insert or a replace/keep. Each leaves a smaller optimal subproblem.
3.
Complexity
O(mn) time and space; space drops to O(min(m, n)) by keeping two rows.
04The price
AI predicted budget
$80–$150
Level · UndergradIncluded
Deadline · 3 daysStandard
Shown before any contact details were shared.
Final price from our team
$110
Delivered 5h early
How it works

From upload to predicted budget in under a minute.

The AI does one job: it predicts your price. A person on our team reviews your files and sets the final number.

  1. 01
    Step 1 of 4

    Upload your files

    Prompt, rubric, starter code. PDF, DOCX, ZIP or code files, in any combination.

  2. 02
    Step 2 of 4

    The AI asks what’s missing

    It confirms your due date, then asks only what your files don’t say. One question at a time.

  3. 03
    Step 3 of 4

    See your predicted budget

    A price range appears right away, before you share any contact details.

  4. 04
    Step 4 of 4

    Our team confirms the final price

    Leave your email. A senior engineer reviews your files and sends the final price.

No payment to get a price. You only pay after you accept the final price from our team.

Typical orders

Common algorithms assignments and typical budgets.

DP problem set (3–5 problems)
$80–$180
Usually 2–3 days
typical range
Graph algorithm implementation
$90–$200
Usually 2–4 days
typical range
Proof-based problem set
$70–$160
Usually 2–3 days
typical range
NP-completeness reductions
$90–$200
Usually 3–4 days
typical range

Your budget depends on your files, deadline and level. Upload them for your own prediction.

Guarantees

Every order is covered. In writing.

Money-back guarantee
Missed deadline, or code that doesn’t meet the brief after revisions? You get a full refund to your original payment method.
Unlimited free revisions
For 14 days after delivery, we revise until it matches your original instructions. No fees.
NDA & confidentiality
Your name, school and files are never shared, sold or reused.
Secure payments
Processed by Stripe. We never see or store your card details.
24/7 email support
Write to us any time, on any time zone. A real person replies.
FAQ

Questions students ask first.

Still have a question?

Email us any time. Support runs 24/7 and a real person replies.

team@domyprogramminghomework.io

Yes, in structured English or LaTeX, at the rigor your course expects.

Related services
Data structures homework
Correct, efficient, explained.
Do my Python homework
Readable, tested, explained.
Do my C++ homework
Compiles clean. Zero leaks.
Do my Java homework
Clean OOP, tested and explained.

Deadline coming up? See your budget now.

Upload your files. The AI predicts your budget in seconds, and our team confirms the final price.

Money-back guaranteeUnlimited revisionsNDA & confidential24/7 email support