Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below.
Note that the strings are case-insensitive, both lowercased and uppercased of the same letter are treated as if they are at the same row.
In the American keyboard:
"qwertyuiop","asdfghjkl", and"zxcvbnm".
Example 1:
Input: words = ["Hello","Alaska","Dad","Peace"]
Output: ["Alaska","Dad"]
Explanation:
Both "a" and "A" are in the 2nd row of the American keyboard due to case insensitivity.
Example 2:
Input: words = ["omk"]
Output: []
Example 3:
Input: words = ["adsdf","sfd"]
Output: ["adsdf","sfd"]
Constraints:
1 <= words.length <= 201 <= words[i].length <= 100words[i] consists of English letters (both lowercase and uppercase). Solutions for this problem are being prepared.
Try solving it yourself500. Keyboard Row | LEETCODE EASY | BRUTE FORCE | CODE EXPLAINER • code Explainer • 3,358 views views
Watch 9 more video solutions →Practice Keyboard Row with our built-in code editor and test cases.
Practice on FleetCode