The problem of finding a list of integers in a given specific range that meets certain conditions is called?
(a) Subset sum problem
(b) Constraint satisfaction problem
(c) Hamiltonian circuit problem
(d) Travelling salesman problem
The question was posed to me during an interview.
I'm obligated to ask this question of Backtracking in chapter Backtracking of Data Structures & Algorithms II