Skip to content

Latest commit

 

History

History
17 lines (13 loc) · 270 Bytes

File metadata and controls

17 lines (13 loc) · 270 Bytes

Cutting Rod

Given a rod of length n and array of prices for rod parts [1-n] find the maximum price to sell the rod.

Solutions:

Swift

O(n^2)

C++

O(n^2)

Installation

Run make to build and run Swift files. Or you can run .playground file.