case://study-001
Algorithms / Systems
Project 001

AidLink

AidLink is a DSA-focused disaster relief matching system designed to prioritize urgent requests, search nearby donors efficiently, and produce reliable top-k matches under resource constraints.

Avg O(1)
Lookup
1-5
Urgency
50/30
Batch Test
Algorithms / Systems
Category
The Problem

What Wasn't Working

Relief distribution often breaks down because requests differ in urgency, quantity, and deadlines, while donor discovery becomes slow and noisy as the dataset grows.

The Solution

How I Fixed It

I combined priority-queue scheduling for urgency-aware ordering, grid-hash spatial indexing for efficient donor lookup, and heap-based top-k ranking with greedy quantity assignment to produce fast, deterministic matches.

Stack

Technologies Used

C++
Priority Queue
Spatial Hashing
Heaps
CLI
Results

Key Outcomes

Priority-based donor-request matching
Deterministic tie-breakers for fair scheduling
Average O(1) cell access with bounded radius expansion
Evaluated on 50 requests and 30 donors

Want something like this?

Let's build it. I ship fast and I ship clean.