Business
Operations, Supply Chain & Procurement Challenges
Operations, Supply Chain & Procurement challenges put you inside the work of running processes that deliver on time and at cost. You'll build skills in process mapping, flowcharting and BPMN, sharpen capacity planning and scheduling, and use ERP navigation and benchmarking to find where work breaks down.
From there you'll tackle the harder edges — supply chain optimization, Lean Six Sigma DMAIC, 5-Whys & Fishbone root-cause analysis, and Kraljic matrix supplier segmentation — running RFP/RFI orchestration and vendor evaluation the way operations teams actually do. Each challenge you solve earns a verified credential you can share with recruiters.
- CodeSeniorNew
Vectorize a Risk-Calculation Engine for a Mid-Cap Bank
Receive the existing pricer (C++17, scalar, around 600 lines), 2 weeks of representative input data (around 50M paths), the validation harness, and access to an Intel Ice Lake-S…
- Vectorization
- Avx 512
- Simd
Performance Engineering of Software Systems - CodeSeniorNew
Build a Lock-Free MPMC Queue for a Trading-Backend Hot Path
Implement Vyukov's bounded MPMC queue in C++20 using atomic operations with explicit memory orderings (relaxed where safe, acquire/release on the enqueue/dequeue handshake). Use…
- Lock Free Algorithms
- Memory Models
- Systems Language Proficiency (Go, Rust, C++)
Advanced Concurrency and Parallel Computing - AnalysisIntermediateNew
Compare Stereo Depth Methods for a Drone Inspection Startup
You receive 500 calibrated stereo pairs from a turbine inspection plus sparse LiDAR ground truth on each pair. Implement (or wrap) three depth estimators: OpenCV Semi-Global Mat…
- Stereo Depth Estimation
- Multi View Geometry
- Model Evaluation
3D Vision and Multi-View Geometry - AnalysisIntermediateNew
Spectral Clustering for Customer Segmentation at a SaaS
Receive a 12,000 customer × 220 feature usage matrix (counts per feature per week, averaged over 12 weeks). Construct a similarity graph (k-nearest-neighbors with k=15, Gaussian…
- Spectral Methods
- Linear Algebra
- Algorithm Analysis
Advanced Algorithms Develop in-demand professional skills.
Each challenge names the skills it strengthens. Over time, your profile fills with the competences a hiring manager would actually look for.
Why Ewance
- ResearchSeniorNew
SAT-Based Planner for Smart-Grid Demand Response
Encode the dispatch problem (which customers to curtail by how much, respecting per-customer contractual caps and grid-cell totals) as a SAT or MaxSAT instance. Solve 50 histori…
- Sat Based Planning
- Constraint Encoding
- Benchmarking
Automated Planning - AnalysisIntermediateNew
Evaluate an Agent Suite on the SWE-Bench-Style Coding Benchmark
You receive a sandboxed set of 50 small repo-modification tasks (test-passing as the success signal). Run 3 open-source agent frameworks (e.g., OpenHands, SWE-agent, and Aider) …
- Ai Agents
- Agent Evaluation
- Benchmarking
AI Agents and LLM-Based Agents - CodeSeniorNew
Scale an HPC MPI Workload Across a Multi-Node Cluster
Receive the MPI weather model (Fortran 2018 + C, ~22,000 lines), 4 weeks of strong-scaling logs (1 to 256 ranks), and access to AWS ParallelCluster with EFA-enabled c7gn instanc…
- Hpc Programming
- Mpi
- Parallel Performance
Advanced Concurrency and Parallel Computing - AnalysisIntermediateNew
Catastrophic-Forgetting Audit on a Domain Fine-Tune
You receive the fine-tuned 7B chemistry model and its base, plus a benchmark basket (MMLU subset, GSM8K, IFEval, a small instruction-following set). Run all 4 benchmarks on both…
- Catastrophic Forgetting
- LLM Evaluation
- Fine Tuning
Fine-Tuning Large Language Models - Browse challenges
Explore role
Pricing Strategist
Set the price that captures value without leaving sales on the table. Demand modelling, willingness-to-pay research, and the disciplined experimentation that turns pricing into a competitive advantage.
- CodeSeniorNew
Build a Unikernel for a Privacy-Focused VPN Provider
Choose either MirageOS or Unikraft as the unikernel framework. Build an image running a minimal WireGuard data plane (existing OCaml or Rust WireGuard reference implementation i…
- Unikernels
- Virtualization
- Wireguard
Advanced Operating Systems - CodeFoundationalNew
Parallelize an Image-Processing Pipeline with Data Parallelism
Receive the current pipeline (Python 3.12, ~600 lines, uses Pillow + ffmpeg), a representative batch (1,000 images averaging 3MB each), and host specs (16 cores, 32GB RAM). Rewr…
- Data Parallelism
- Python Or Javascript
- Multiprocessing
Concurrent and Parallel Programming - AnalysisIntermediateNew
TCP Congestion Control Comparison on a Long-Fat Network
Set up two Linux test hosts in Sydney + Frankfurt cloud regions (or one host pair with tc-netem emulating 280ms RTT). Run iperf3 transfers using CUBIC and BBR at 4 loss rates (0…
- Tcp Ip
- Congestion Control
- Performance Testing
Computer Networks - CodeBeginnerNew
Quantize a Vision Model for a Smart-Doorbell SoC
You receive a trained FP32 PyTorch person-detector (mAP 0.74 on a 5k validation set) plus a calibration dataset of 500 unlabeled doorbell frames. Convert to ONNX, then apply pos…
- Quantization
- Model Optimization
- Onnx Optimization
Edge ML and On-Device Machine Learning Get recognized by recruiters and employers.
Credentials are blockchain-anchored via LearnCoin — tamper-evident, portable, link-shareable on LinkedIn and beyond.
Why Ewance
- CodeSeniorNew
Design a Lock-Free Concurrent Skip List for a Time-Series Database
Implement Fraser's lock-free skip list in Rust with marked pointers for logical deletion. Validate under loom for all interleavings up to 4 threads (or use shuttle if loom can't…
- Lock Free
- Concurrent Data Structures
- Rust Programming
Parallel and Distributed Algorithms - AnalysisIntermediateNew
Benchmark Approximate Nearest-Neighbor Indexes for a Code-Search Startup
You receive a 5 M-vector sample (768-dim, float32) and a 1,000-query labeled benchmark with ground-truth top-50 neighbors per query. Index the same sample in Chroma (HNSW), Qdra…
- Ann Indexes
- Hnsw
- Benchmarking
Vector Databases and Embeddings - CodeSeniorNew
Design a Polyhedral Loop-Tiling Strategy for a Tensor DSL
Study the DSL's IR (provided, MLIR-based with linalg-style ops). Choose a tiling strategy (rectangular tiling with cost-modeled tile sizes is the safe baseline; full polyhedral …
- Polyhedral Analysis
- Loop Tiling
- Mlir
Advanced Compilers and Program Optimization - ResearchIntermediateNew
Evaluate a Knowledge-Graph-Augmented Recommender
You receive permission to use the public MovieLens 1M dataset plus a derived item-KG (movie -> genre, director, decade) built from Wikidata. Train two recommenders: a matrix-fac…
- Knowledge Graph Embeddings
- Recommender Systems
- Benchmarking
Knowledge Graphs and Semantic Web - CodeIntermediateNew
Design Error Recovery for a Friendly Compiler
Read the existing parser (recursive-descent, in Rust). Design and implement a panic-mode error recovery strategy with synchronization tokens (statement boundary, end of block, s…
- Error Recovery
- Recursive Descent Parsing
- Diagnostic Design
Compiler Construction - CodeIntermediateNew
Out-of-Order Execution Microbenchmark Suite
Design and implement 6 microbenchmarks: ROB capacity probe (varying chain length), load-store queue probe, branch mispredict cost probe, ILP saturation probe, store-to-load forw…
- Out Of Order Execution
- Performance Counters
- Benchmarking
Advanced Computer Architecture - CodeIntermediateNew
Implement Bulk Synchronous Parallel PageRank on a 1.5B-Edge Graph
Choose either Apache Spark + GraphX (Pregel API) or a vanilla MPI + C++ implementation. Run 25 iterations of PageRank on the 1.5B-edge graph (graph file format provided: CSR par…
- Parallel Algorithms
- Bsp
- Graph Algorithms
Parallel and Distributed Algorithms - CodeBeginnerNew
Replace Raw Pointers with Smart Pointers in a Game-Engine Module
Audit the 18k-line module for raw-pointer ownership patterns (owning, borrowing, shared). Refactor in 4 phases: (1) introduce unique_ptr for clearly-owning sites, (2) shared_ptr…
- Cpp Programming
- Manual Memory Management
- Pointers
Imperative and Low-Level Programming - CodeIntermediateNew
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
- Systems Language Proficiency (Go, Rust, C++)
Data Structures - CodeIntermediateNew
Tune a Multicore Pipeline with NUMA-Aware Sharding
Receive the current worker (Rust, around 8,000 lines, uses rayon for its parallelism), the host (2-socket AMD EPYC 9354, 64 cores total, 384GB DDR5), and a benchmark query workl…
- Parallel Performance
- Numa
- Systems Language Proficiency (Go, Rust, C++)
Advanced Concurrency and Parallel Computing - AnalysisIntermediateNew
Cost-Profile a Spark Job at Scale and Cut the Bill in Half
Receive the PySpark job (around 1,800 lines), 5 nights of Spark UI + EMR metrics, and the EMR cluster config. Profile to find the top 3 cost drivers (likely candidates: skewed j…
- Apache Spark
- Finops & Cost Optimization
- Etl Pipelines
Big Data and Data-Intensive Systems - ResearchIntermediateNew
Lab Project: Compare Three Architectures on Your Own Mini-Benchmark
Scope the problem yourself (suggested examples: sentiment classification on a niche domain, tabular anomaly detection, time-series forecasting on a public dataset). Define the t…
- Experimental Design
- A/B Testing With Statistical Significance
- Pytorch Or Tensorflow
AI/ML Practicum and Hands-on Lab
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.
Related skill families
Browse all skillsIndustry 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.