Worked on the OI-wiki/OI-wiki repository, focusing on optimizing a high-frequency algorithmic path within the Probability Problem Solution. Addressed a time limit exceeded (TLE) risk by removing an unnecessary memset call in the dynamic programming probability code, which improved runtime stability while maintaining correctness under strict contest constraints. This targeted fix enhanced the reliability of contest-ready submissions and demonstrated careful debugging and performance tuning. Utilized C++ and algorithm design skills, applying competitive programming techniques to ensure efficient execution. The work reflected a disciplined approach to code optimization, emphasizing minimal-risk changes and clear documentation to support ongoing repository maintainability and reliability.