HomeWork

CodeChefOpen on judge ↗

Lavlesh is (a student of Computer Science department ) given a task by Prof. XYZ (a very strict professor), which is to find all no. of ways.. The task is, he will be given a set 'S' of cardinality 'K' and he need to select 6 numbers from this set in such a way that a number should be greater than it's preceding number. for e.g. for S={3, 6 , 9 ,10, 16, 19, 20,25} he should start with [3,6,9,10,16

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