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
Command Palette
Search for a command to run...
#learn-coding
Articles tagged with #learn-coding
How To Find The Maximal Subarray Having Distinct Elements
A simple C++ solution to Leetcode 1695. Maximum Erasure Value using a sliding window approach and prefix sums.
Jan 9, 20242 min read253
How to Check If a Number is a Power of Four
The math behind Leetcode 342. Power of Four.
Dec 26, 20232 min read216
How To Add Two Numbers Represented As Linked Lists
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
Dec 12, 20233 min read137
How to Perform a Counting Using Array and Hash Table
Finding the first non-repeating character in a string
Nov 28, 20233 min read245
How to Convert a Given Roman Numeral to its Equivalent Integer Value
How to decode Roman numbers
Nov 26, 20233 min read409