The Golden Rod — Puzzle for Interview rounds

Question :

An employee works for an employer for 7 days. The employer has a gold rod of 7 units. How does the employer pay to the employee, so that the number of employee’s rod units increases by one at the end of each day? The employer can make at most 2 cuts in the rod.

(Hint- after the end of the day employee’s can’t spend any part of rod)

Solution :

The employer can pay for seven days by making 2 cuts in a way that he has 3 rods of size 1, 2 and 4.
1st Day: Employer gives 1 unit cut.
2nd day: Takes back 1 unit cut from employee given on the first day and gives 2 unit cut.
3rd Day: Gives 1 unit and then the employer is left with 4 unit rod lengths.
4th Day: Takes back cuts of 1 and 2 units. Gives the cut of 4 units.
5th Day: Gives cut of 1 unit to the employee.
6th Day: Takes back cut of 1 unit and gives a cut of 2 units.
7th Day: Gives cut of 1 unit to the employee.

Thanks for Reading

Placewit grows the best engineers by providing an interactive classroom experience and by helping them develop their skills and get placed in amazing companies.

Learn more at Placewit. Follow us on Instagram and Facebook for daily learning.

--

--

--

Upskilling students for tech placements!

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

How to Overcome the Fear of Getting Paid for Your Side Hustle

Rise of the BOTs — Part III

My comfortable couch is my office chair and my job commute is a Hallway’s length — Why I need a…

How a Washington Casino is Using The Good Jobs Strategy to Invest in Guest Experience

Your Agile Might be Fake

Perspectives

A Role by Any Other Name

My hopes for the HNG Internship

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Placewit

Placewit

Upskilling students for tech placements!

More from Medium

Scattered Rice Coding Question

“Delete and Earn” problem using Dynamic Programming

Leetcode 862. Shortest Subarray with Sum at Least K

LeetCode 146. LRU Cache