Given a rod of length n and array of prices for rod parts [1-n] find the maximum price to sell the rod.
O(n^2)
O(n^2)
Run make to build and run Swift files. Or you can run .playground file.
Rod
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||