Leetcode 120. How To Find The Minimum Path From Top To Bottom Of A Triangle

Problem statement You're provided with a triangle array. Your goal is to find the smallest possible sum of a path from the top of the triangle to the bottom. You can move to an adjacent number in the row below at each step. Specifically, if you're at...