John loves Chocolate but he didn't have money. The owner of "Sweet Chocolate" launches a scheme for free chocolate. He divided a day into "n" number of slots. A person has can take the number of chocolates available in the slot with a condition that he has to return the number of chocolates which are available in the slot in which he is returning the chocolates only once in a day. Now this return has to be done on the same day and it can't be done before taking the chocolates. The number of chocolates left after the return is what you get for free. John wanted to try his luck on this, Help him in it.
x->is an array consisting of the number of chocolate available in the different slots of the day.
(the number of slots per day can be got from the size of the array x)
Solve

Solution Stats

19 Solutions

10 Solvers

Last Solution submitted on Jun 04, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers10

Chris Cleveland Pranavkumar Mallela Jacinthe Lorenzo

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!