Anushka contributed to the GDG-IGDTUW/DSA-1 repository by developing two core features focused on algorithmic problem-solving in Java. She implemented a recursive string-to-integer parser that robustly handles leading spaces, optional signs, and integer overflow, enhancing input reliability and maintainability. Additionally, she designed and coded a dynamic programming solution for the Stone Game II problem, enabling optimal computation of the maximum stones the first player can collect. Her work demonstrated depth in algorithm design, recursion, and dynamic programming, addressing both input parsing and game-theory challenges. Over the month, she delivered these features with attention to correctness and performance.