Krish Mittal developed two core algorithmic features for the GDG-IGDTUW/DSA-1 repository, focusing on scalable data processing and optimization challenges. He implemented a Kth Largest Element Finder using C++ and a min-heap, providing an alternative sorting-based approach for reference and comparison. Additionally, he delivered a dynamic programming solution for the Burst Balloons problem, maximizing coin collection through optimal bursting order. Both solutions emphasized maintainable code and future reusability, with thorough commenting and preparation for integration. Throughout the month, Krish demonstrated strong skills in C++, algorithm design, and data structures, producing robust, well-structured implementations without reported bugs.