Add No_500: Keyboard Row

Author: brianchiang-tw

No_500_Keyboard_Row/No_500_Keyboard_Row_description.md

@@ -0,0 +1,18 @@
+'''
+
+Description:
+
+Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.
+
+Example:
+
+Input: ["Hello", "Alaska", "Dad", "Peace"]
+Output: ["Alaska", "Dad"]
+ 
+
+Note:
+
+You may use one character in the keyboard more than once.
+You may assume the input string will only contain letters of alphabet.
+
+'''

No_500_Keyboard_Row/keyboard_row_iterative.py

@@ -0,0 +1,81 @@
+'''
+
+Description:
+
+Given a List of words, return the words that can be typed using letters of alphabet on only one row's of American keyboard like the image below.
+
+Example:
+
+Input: ["Hello", "Alaska", "Dad", "Peace"]
+Output: ["Alaska", "Dad"]
+ 
+
+Note:
+
+You may use one character in the keyboard more than once.
+You may assume the input string will only contain letters of alphabet.
+
+'''
+
+
+
+from typing import List
+class Solution:
+    
+    
+    def findWords(self, words: List[str]) -> List[str]:
+        
+        
+        group = [ 'qwertyuiop', 'asdfghjkl', 'zxcvbnm' ] 
+        one_row_words = []
+        
+        for word in words:
+        
+            word_low = word.lower()
+            
+            flag =  all( ch in group[0] for ch in word_low ) or \
+                    all( ch in group[1] for ch in word_low ) or \
+                    all( ch in group[2] for ch in word_low )
+            
+            if flag:
+                one_row_words.append(word)
+                
+        return one_row_words
+
+
+
+# n : the number of word in input list
+
+## Time Complexity: O( n )
+#
+# The major overhead in time is the for loop iterating on word, which is of O( n )
+
+
+## Space Complexity: O( n )
+#
+# The major overhead in space is the storage for output one_row_words, which is of O( n )
+
+
+def test_bench():
+
+    test_data = [
+                    ["Hello", "Alaska", "Dad", "Peace"]
+                ]
+
+    # expected output:
+    '''
+    ['Alaska', 'Dad']
+    '''
+
+    for test_words in test_data:
+
+        print( Solution().findWords(test_words) )
+
+    return 
+
+
+
+if __name__ == '__main__':
+
+    test_bench()
+