Memory Analysis
If you like applying Memory Analysis, every challenge here gives you a chance to practice it on a real industry brief.
- CodeAdvancedNew
Index a Genomics Dataset with a Suffix Array for Read Matching
Implement a suffix array over a 720 MB DNA sequence (4-character alphabet) using DC3 (Difference Cover modulo 3) or SA-IS construction in Rust. Build pattern-matching utilities …
- Suffix Arrays
- String Algorithms
- Rust
Data Structures - AnalysisIntermediateNew
Choose a Hash Table vs Trie for a URL-Shortener Cache
Implement (1) a hash-table cache with linear probing and (2) a compressed trie cache, both with the same eviction policy (LRU). Measure (a) p50/p99 lookup latency, (b) memory fo…
- Hash Tables
- Trie Data Structure
- Benchmarking
Data Structures
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.