Np Completeness
If you like applying Np Completeness, every challenge here gives you a chance to practice it on a real industry brief.
- AnalysisBeginnerNew
Is the Optimal Vet-Scheduling Feature Computationally Tractable?
Working only from the materials provided — the product feature specification, the de-identified internal record of the customer request, a representative one-day appointment dat…
- Np Completeness
- Complexity Theory
- Algorithm Analysis
Open coursework - DesignSeniorNew
Provably Fair Approximation Algorithm for a Neobank On-Call Roster
Using the roster problem specification (roster-problem-spec), formalize the weekly on-call assignment as a constrained multi-week optimization problem, prove it is NP-hard by re…
- Approximation Algorithms
- Linear Programming
- Np Completeness
Open coursework
How it works
From brief to credential, in six steps.
Step 01
Browse challenges aligned to your studies.
Step 02
Accept the one that fits your goals.
Step 03
Work through it with AI Copilot guidance.
Step 04
Submit for structured evaluation.
Step 05
Earn a verified credential.
Step 06
Add it to LinkedIn with one click.
Industry teams behind a decade of practitioner briefs
Hiring from this pool?
Sponsor a challenge and meet candidates through actual work.
Industry teams can shape briefs around the skills they hire for, then evaluate students on rubric-scored deliverables — not resumes.