Given an array of n elements a[1], a[2], ... , a[n] (0 <= a[i] <= 9). There are k constraints of 3 types that the array must satisfy: 1 x i : a[i] should not be x 2 x l r : there is at least one a[i] = x such that l <= i <= r

You should find any array that satisfy all k constraints (it is guaranteed to exist at least one). k <= 200 and n should be fairly small like under 20, tell me if you could still solve it for larger n

I've come up with this problem recently and for some reasons my backtracking solution runs fast as hell for any test cases that I've generated randomly and I've not come up with any better solution or better tests. Can someone show me a corner test case to kill backtracking or maybe this is the best way to solve this problem?