By language · C++

Do my C++ homework. Compiles clean. Zero leaks.

Memory-safe, well-structured C++ for data structures, systems and game projects. Builds with your flags and passes Valgrind.

C++11–C++20STLCMake / MakeGoogleTestValgrindgdb

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

Anything your files don’t say? (optional)

Files stay private under our NDA. No email needed to see your budget.

Price cappedFrom $45Full refund if we’re late800+ students

See an example order

What we cover

Every part of C++ your course covers.

Core

Classes, constructors, RAII
Pointers and references
Templates
Operator overloading

STL & data structures

vector, map, unordered_map
Lists and trees from scratch
Priority queues and heaps
Iterators and algorithms

Systems

Smart pointers
File streams
std::thread
Makefiles and CMake

Projects

Games and simulations
Graph algorithms
Matrix and numerical code
Qt GUIs

Example order

One C++ order, start to finish.

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

01The brief

Data Structures and AlgorithmsUndergradDue in 3 days

Templated binary heap priority queue

Implement a templated binary heap with push, pop and top in O(log n). No STL heap functions. Must build with -Wall -Werror and pass Valgrind with zero leaks.

Requirements

Templated on type and comparator
O(log n) push and pop
No std::push_heap or priority_queue
Zero leaks under Valgrind

02The solution

BinaryPQ.h25 lines

1template <typename T, typename Comp = std::less<T>>

2class BinaryPQ {

3public:

4 void push(const T& val) {

5 data.push_back(val);

6 fixUp(data.size() - 1); // restore heap order

7 }

8 void pop() {

9 data[0] = data.back();

10 data.pop_back();

11 if (!data.empty()) fixDown(0);

12 }

13 const T& top() const { return data[0]; }

15private:

16 std::vector<T> data;

17 Comp comp;

18 void fixUp(size_t i) {

19 while (i > 0 && comp(data[(i - 1) / 2], data[i])) {

20 std::swap(data[i], data[(i - 1) / 2]);

21 i = (i - 1) / 2;

22 }

23 }

24 void fixDown(size_t i);

25};

22 tests passing · g++ -Wall -Werror · 0 leaks

03The explanation doc

explanation.pdf

Heap stored in a vector

Parent of i is (i − 1) / 2, children are 2i + 1 and 2i + 2. No pointers, so nothing to leak.

Comparator as a template parameter

Passing std::greater turns it into a min-heap with zero runtime cost.

Complexity

push and pop are O(log n); top is O(1).

04The price

AI predicted budget

$90–$160

Level · UndergradIncluded

Deadline · 3 daysStandard

Shown before any contact details were shared.

Final price from our team

$125

Delivered 9h early

How it works

From upload to predicted budget in under a minute.

The AI does one job: it predicts your price. A senior engineer reviews your files and sets the final number.

01
Step 1 of 4
Upload your files
Prompt, rubric, starter code, or a screenshot of the task. PDF, DOCX, ZIP, code or images, in any mix.
02
Step 2 of 4
The AI asks what’s missing
It confirms your due date, then asks up to 3 questions your files don’t answer. Each one has an “I don’t know” option.
03
Step 3 of 4
See your predicted budget
A price range appears right away. No email, no sign-up.
04
Step 4 of 4
A senior engineer confirms your price
Leave your email. Within 5 minutes you get one fixed price. It never goes above the top of your range.

No payment to get a price. You pay only after you accept the fixed price. If the AI can’t price your files, an engineer emails you a price instead.

Typical orders

Common C++ assignments and typical budgets.

Linked list, stack or queue from scratch

$60–$130

Usually 2–3 days

typical range

Templated container or heap

$90–$180

Usually 3–4 days

typical range

Graph algorithms project

$110–$240

Usually 3–5 days

typical range

Game or simulation (SFML, Qt)

$150–$350

Usually 5–7 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.

Full refund, in three cases

We miss your deadline. Your code still doesn’t meet your original brief after revisions. Or you cancel before an engineer starts.

Partial refunds, worked out in the open

Cancel after work starts, or keep part of the work: we refund the rest and show you how we worked it out first.

Refunds that move fast

We reply within 24 hours. Approved refunds go back to your card through Stripe within 2 business days.

Unlimited revisions for 14 days

We revise until it matches your original instructions. No fees.

Your price is capped

Your fixed price never goes above the top of your range.

How the cap works

NDA and privacy

Your name, school and files are never shared, sold or reused. Engineers never see your name or email.

Secure payment

Processed by Stripe. We never see or store your card details.

Read the full refund policyFree. No email needed.

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

Will it compile on my school’s server?

Tell us the compiler and flags, or send the Makefile. We test with the same g++ or clang version.

Do you check for memory leaks?

Every order that uses dynamic memory runs under Valgrind or AddressSanitizer before delivery.

Can you follow the spec exactly?

Yes. File names, signatures and banned headers stay exactly as the spec says.

Is the predicted budget the final price?

Not exactly, but it’s capped. Our team reviews your files and sends one fixed price before you pay anything, and it never goes above the top of your range.

What if you miss my deadline?

You get a full refund, back to your card through Stripe. It’s in our refund policy, in writing.

Related services