Nvidia | System Software Engineer, Distributed Systems | Coding | Phone Screen

find the number of good subsequence all element in subsequence are unique min(sub)=a, max(sub)=b, all element between [a,b] should be present in subsequence return numbers of all good subsquences example: 13 11 4 12 5 4 6+4+1=11 3 1 1 2 8 5+3+2=10