Developed and documented two algorithmic features in the UngSangYoon/Algorithm_Study_FISA repository, focusing on greedy problem-solving techniques using Python. Built a Coin Change solver that applies a descending-sort and greedy selection strategy to minimize the number of coins needed for a given amount, and implemented a solution for Baekjoon problem 2847 that enforces a strictly decreasing score sequence through targeted reductions. Emphasized clear file naming and thorough documentation to support onboarding and future code reuse. Demonstrated disciplined commit practices and maintained traceability by linking problem statements directly to code changes, leveraging skills in algorithms, greedy methods, and structured problem solving.