Leetcode 120. How To Find The Minimum Path From Top To Bottom Of A Triangle
Two dynamic programming techniques to solve Leetcode 120. Triangle. One has space complexity O(n^2). The other is O(n).
Jan 23, 20244 min read256

Search for a command to run...
Articles tagged with #learn-coding
Two dynamic programming techniques to solve Leetcode 120. Triangle. One has space complexity O(n^2). The other is O(n).

A simple C++ solution to Leetcode 1695. Maximum Erasure Value using a sliding window approach and prefix sums.

The math behind Leetcode 342. Power of Four.

By iterating digit by digit, and calculating the sum and carry, it handles scenarios for the lengths of the input lists and any remaining carry values

Finding the first non-repeating character in a string

How to decode Roman numbers
