How to compute the time and space complexity of Binary Tree Algorithms
January 2, 2020
System Design of Centralized Logging System
January 5, 2020
90

Cutting the Rod Problem. Part_1: Recursion and Memoization

Given pieces of rod sizes. Find the max value we can get by cutting a rod of length n and selling the pieces.

Leave a Reply

Your email address will not be published. Required fields are marked *