Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

Leetcode Keyboard Row problem solution

YASH PAL, 31 July 2024

In this Leetcode Keyboard Row problem solution 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.

Leetcode Keyboard Row problem solution

Problem solution in Python.

class Solution:
    def findWords(self, words: List[str]) -> List[str]:
        rows = [set("qwertyuiop"),set("asdfghjkl"),set("zxcvbnm")]
        return [w for w in words if any(s&set(w.lower())==set(w.lower()) for s in rows)]

Problem solution in Java.

public String[] findWords(String[] words) {
        List<String> sameRowList = new ArrayList<String>();
        for(String word : words) {
           if(findWordInSameRow(word)) {
               sameRowList.add(word);
           }
        }
        String[] samwWords = new String[sameRowList.size()];
        samwWords = sameRowList.toArray(samwWords);
        return samwWords;
    }

    public boolean findWordInSameRow(String word) {
        String keyBoard = "qwertyuiopasdfghjkl&zxcvbnm&&&";
        char[] charWord = word.toLowerCase().toCharArray();
        int row = keyBoard.indexOf(charWord[0]) / 10;
        for(char c : charWord) {
            if(row != keyBoard.indexOf(c) / 10) {
                return false; 
            }
        }
        return true;
    }

Problem solution in C++.

class Solution {
public:
    Solution(){
        hash.resize(26);
        vector<string> key{"qwertyuiop","asdfghjkl","zxcvbnm"};
        for(int i=0;i<key.size();i++){
            for(auto j: key[i])
                hash[j-'a']=i;
        } 
    }
    vector<string> findWords(vector<string>& words) {
        vector<string> re;
        for(auto i : words){
            if(same(i)&&i.size())
                re.push_back(i);
        }
        return re;
    }
    bool same(string str){
        if(!str.size()) return true;
        int cur = hash[tolower(str[0])-'a'];
        for(int i=1;i<str.size();i++){
            if(hash[tolower(str[i])-'a']!=cur)
                return false;
        }
        return true;
    }
private:
    vector<int> hash;
};

coding problems

Post navigation

Previous post
Next post
  • HackerRank Separate the Numbers solution
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
How to download udemy paid courses for free

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
©2025 Programming101 | WordPress Theme by SuperbThemes