Segment Trees with Lazy Propagation, Clearly
A ground-up explanation of lazy propagation in segment trees, with a reusable C++ template.
Contest results, Codeforces rating, and algorithm teaching.
National programming competition at FAST-NUCES. Placed 1st in the competitive programming track against teams from universities across Pakistan.
International Collegiate Programming Contest — Pakistan Divisional. Represented NUST with a 3-person team; qualified for regionals.
National ACM programming contest at FAST-NUCES, Islamabad. Silver medal finish in the open category.
I help train the IOI Pakistan squad, running sessions on graph algorithms, dynamic programming, and competitive problem decomposition. Preparing students for the International Olympiad in Informatics selection rounds.
Previously organized and coached for NUST's internal competitive programming community — problem setting, solution walkthroughs, and team formation for ICPC regionals.
A ground-up explanation of lazy propagation in segment trees, with a reusable C++ template.
A breakdown of the 6-month preparation cycle that got our NUST team to 3rd place at ICPC Pakistan Nationals 2024.