An adaptive Hangman variant that maintains a set of candidate words and selects the largest word family after each guess โ built with HashMaps, TreeSets, and pattern-based word partitioning.
Core data structures and algorithmic problem-solving in Java, plus an interactive A-Frame experience. Highlights from CSC 221: Data Structures and CSC 363: Human Computer Interaction coursework.
An adaptive Hangman variant that maintains a set of candidate words and selects the largest word family after each guess โ built with HashMaps, TreeSets, and pattern-based word partitioning.
Interactive guitar simulator using the Karplus-Strong string synthesis algorithm. Implements a 37-key virtual guitar with real-time audio plucking via StdAudio.
Finds the shortest transformation sequence between two words using BFS over a dictionary graph, where edges connect words differing by exactly one letter.
Immersive A-Frame experience exploring a scaled solar system with orbital mechanics, mission objectives, collision detection, and interactive planet information panels.