Given two numbers n and K and you have to find all possible combinations of K numbers from 1 to n. This is a good interview problem to understand the concept of problem-solving using backtracking and combinatorics.
EnjoyAlgorithms
Our Weekly Newsletter
Subscribe to get free weekly content on data structure and algorithms, machine learning, system design, oops and math.
