LeetCode 120 | Triangle - Fixing the Fix [medium]

Описание: You're given a triangle of integers and asked to find the minimum path sum from top to bottom, moving only to adjacent numbers on the row below. It’s a classic dynamic programming problem that challenges how you think about bottom-up vs top-down computation. Can you optimize for both time and space while keeping your code clean?