← All problemsSign in

Fast but not Furious

Two friends Alice and Bob have a task A,B,C.....Z.Each have a duration of one hour.One day their supervisor decides to do a check on their performance.He punishes by finding the duration of summing up how long Alice and Bob have done the same task in the same order of increasing time which may or may not be consecutive.Find the longest possible duration they will be punished? Input The first lin

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.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start