K Sum
CodeChefOpen on judge ↗
You are given an array of N numbers. Return the K-sum array of the given numbers. A k-sum array can be calculated as follows: Given an array, group K consecutive numbers starting from the first element (If the last group contain less than K elements, do not group them). Replace each of these groups with their respective sums. Repeat this process until the length of the array becomes lesser than K.
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