Given a string with lowercase letters and '?', where '?' can be any letter, count the number of ways to replace '?' such that the first and last characters are equal and no two adjacent characters are…
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.