<p>Given an array of strings <code>words</code>, return <em>the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below</em>.</p>

<p>In the <strong>American keyboard</strong>:</p>

<ul>
	<li>the first row consists of the characters <code>&quot;qwertyuiop&quot;</code>,</li>
	<li>the second row consists of the characters <code>&quot;asdfghjkl&quot;</code>, and</li>
	<li>the third row consists of the characters <code>&quot;zxcvbnm&quot;</code>.</li>
</ul>
<img alt="" src="https://assets.leetcode.com/uploads/2018/10/12/keyboard.png" style="width: 800px; max-width: 600px; height: 267px;" />
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;Hello&quot;,&quot;Alaska&quot;,&quot;Dad&quot;,&quot;Peace&quot;]
<strong>Output:</strong> [&quot;Alaska&quot;,&quot;Dad&quot;]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;omk&quot;]
<strong>Output:</strong> []
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> words = [&quot;adsdf&quot;,&quot;sfd&quot;]
<strong>Output:</strong> [&quot;adsdf&quot;,&quot;sfd&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= words.length &lt;= 20</code></li>
	<li><code>1 &lt;= words[i].length &lt;= 100</code></li>
	<li><code>words[i]</code> consists of English letters (both lowercase and uppercase).&nbsp;</li>
</ul>

class Solution {
public:
    vector<string> findWords(vector<string>& words) {
        string str1 = "qwertyuiopQWERTYUIOP";
        string str2 = "asdfghjklASDFGHJKL";
        string str3 = "zxcvbnmZXCVBNM";
        int cnt1 = 0;
        int cnt2 = 0;
        int cnt3 = 0;
        
        vector<string> str;
        for(int i = 0;i<words.size();i++){
            for(int j=0;j<words[i].size();j++){
                for(int k=0;k<str1.size();k++){
                    if(words[i][j] == str1[k]){
                        cnt1++;
                    }
                    
                }
            }
            if(cnt1 == words[i].size()){
                str.push_back(words[i]);
            }
            cnt1 = 0;

            for(int j=0;j<words[i].size();j++){
                for(int k=0;k<str2.size();k++){
                    if(words[i][j] == str2[k]){
                        cnt2++;
                    }
                    
                }
            }
            if(cnt2 == words[i].size()){
                str.push_back(words[i]);
            }

            cnt2 = 0;

            for(int j=0;j<words[i].size();j++){
                for(int k=0;k<str3.size();k++){
                    if(words[i][j] == str3[k]){
                        cnt3++;
                    }
                    
                }
            }
            if(cnt3 == words[i].size()){
                str.push_back(words[i]);
            }

            cnt3 = 0;
        }
        return str;
    }
};
8300