Kylo
CodeChefOpen on judge ↗
Problem Statement Kylo wants to catch Finn who is on the different planet of the galaxy. All the planets lie on a linear path, i.e. if you want to go from 1st to 4th planet then you must pass 2nd and 3rd planets. There are n planets in total and you are provided with an array dist[] of n-1 size which gives you the distances between them. dist[0] = dist. b/w 0th and 1st planet dist[1] = dist. b
HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17
CodeSearch Tutor
Hints, not spoilers — it won’t hand over the full solution unless you insist.
Sign in to chat with the tutor and save your progress.
Sign in to start