We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Check if a pump has more petrol than the kilometer (1st condition)
Test that pump. If during the tour, the remaining fuel >= 0 (2nd condition)
Return index of the pump that passed 2 conditions
note: remaining fuel = fuel - distance (kilometer)
The challenge is how to test 2nd condition. If you want to test a pump number 2, than it need to go through [2 > 3 > 4 > 5 > 1] if there is 5 pumps. If during testing and that specific pump's remaining fuel get to below 0 than skip that pump
Yeah it pretty easy , when taking coding challenges we always tend to think of alternative more clever way than the basic brute force approach , but in most cases that is the raison why we spend more time for and at the end brute force is easy win .
it is nevertheless a not very generalizable problem and thats why in this case, brute force seems a good alternative. There are not inputs whose solutions are: there is no way of making this circle. Thus, when you assess if each pump has the petrol equivalent to the distance to the next pump, it is just about picking the smaller.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Truck Tour
You are viewing a single comment's thread. Return to all comments →
Imo this is very easy
The challenge is how to test 2nd condition. If you want to test a pump number 2, than it need to go through [2 > 3 > 4 > 5 > 1] if there is 5 pumps. If during testing and that specific pump's remaining fuel get to below 0 than skip that pump
Yeah it pretty easy , when taking coding challenges we always tend to think of alternative more clever way than the basic brute force approach , but in most cases that is the raison why we spend more time for and at the end brute force is easy win .
it is nevertheless a not very generalizable problem and thats why in this case, brute force seems a good alternative. There are not inputs whose solutions are: there is no way of making this circle. Thus, when you assess if each pump has the petrol equivalent to the distance to the next pump, it is just about picking the smaller.