https://github.com/queraltsm/maximumprice

Maximum Price in not consecutive Boxes
https://github.com/queraltsm/maximumprice

brute-force memoization tabulation

Last synced: over 1 year ago
JSON representation

Maximum Price in not consecutive Boxes

• Host: GitHub
• URL: https://github.com/queraltsm/maximumprice
• Owner: queraltsm
• Created: 2019-07-10T10:13:40.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2019-07-15T22:49:34.000Z (almost 7 years ago)
• Last Synced: 2025-01-28T19:35:39.540Z (over 1 year ago)
• Topics: brute-force, memoization, tabulation
• Language: Java
• Size: 33.2 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
MaximumPrice

We have N boxes and inside which we can find money, and we have to calculate the maximum price of these


considering that we can not select consecutive boxes.



For example:


We have 5 boxes -> 3 2 10 1 5 


The result must be 18 (box 1 + box 3 + box 5)