Dsa
Recursion
Warm-up
Combination Count
Given two integers n and k, write a program to find how many ways you can choose k items from a set of n items using recursion. Example: For n=4 and k=2, the output should be 6, representing the combinations: (1,2), (1,3), (1,4), (2,3), (2,4), and (3,4).
Key concepts
recursioncombinatoricscounting
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now