Joseph And Johnny
CodeChefOpen on judge ↗
Joseph and Johnny were feeling bored doing nothing, since they love to play with numbers so they decided to play a game, in which Joseph gives an array of numbers to Johnny. In the given array Johnny has to first find the sum of maximum digits of each array element then he has to search the array to get pair of those numbers whose difference is equal to that sum. Help Johnny to find whether such p
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