My issue
As per my understanding … In total of N values from 1 to N , how many no of spooky sequences can be obtained by following the constraint given the question such as their strengths,friends…
I cannot even able to think brute force solution for this problem . . Kindly anybody guide me or give me any tip for this problem . How should I approach this kind of problems ?
My code
# cook your dish here
Problem Link: SPOOKYSEQ Problem - CodeChef