Sponsored
Use these hints if you're stuck. Try solving on your own first.
Generate recursively all the happy strings of length n.
Sort them in lexicographical order and return the kth string if it exists.
Solve with full IDE support and test cases
