High-Performance WordSet & Graph Search

Overview

This project focused on implementing high-performance data structures and applying them to solve a word-ladder style graph search problem. The goal was correctness, speed, and clean abstractions under constraints. I emphasized algorithmic tradeoffs, test-driven iteration, and practical performance considerations that show up when moving beyond toy inputs.

Highlights

• Implemented a custom hash-based set for fast membership checks under heavy query load.
• Used BFS graph search to find shortest transformation paths with careful attention to time and space tradeoffs.
• Validated correctness with targeted tests and edge-case handling for real input behavior.
• Optimized bottlenecks by focusing on the operations that dominated runtime at scale.

Tech

C++, hashing, BFS, performance testing, correctness-focused debugging