Leetcode 3019. Number of Changing Keys

Count how many times consecutive characters in string s correspond to different physical keys, treating uppercase and lowercase of the same letter as the same key. In other words, return the number of indices i where s[i] and s[i-1] differ when compared case-insensitively.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3019. Number of Changing Keys

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact