pushing changes for 08/13

surajr · surajr · commit b16915b2f4c8 · 2017-08-13T09:03:54.000-07:00
diff --git a/README.md b/README.md
@@ -44,6 +44,7 @@ Feel free to add issues, comment and pull request.
 | Leetcode  | [557. Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/) | [Java](./java/reverseWords.java) \| [Python](./Python/) | _O(n)_       | _O(1)_          |  Easy       |         |
 | Leetcode  | [387. First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/) | [Java](./java/FirstUniqChar.java) \| [Python](./Python/) | _O(n)_       | _O(n)_          |  Easy       |         |
 | Leetcode  | [647. Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [Java](./java/CountSubstrings.java) \| [Python](./Python/) | _O(n^2)_       | _O(1)_          |  Easy       |         |
+| Leetcode  | [500. Keyboard Row](https://leetcode.com/problems/keyboard-row/description/) | [Java](./java/findWords.java) \| [Python](./Python/) | _O(n)_       | _O(1)_          |  Easy       |         |
 
 ## HashMap
 | Website 		| Title           |  Solution    |  Time           | Space           | Difficulty    |  Note| 
diff --git a/java/findWords.java b/java/findWords.java
@@ -0,0 +1,40 @@
+public class Solution {
+    
+    // Used String datastructure to store the rows 
+    private String [] rows = new String [] {"QWERTYUIOP","ASDFGHJKL","ZXCVBNM"};
+    
+    public String[] findWords(String[] words) {   
+        
+        ArrayList<String> findWord = new ArrayList<>();
+        int rowNumber = -1;
+        
+        for(String word : words)
+        {
+            char [] charWord = word.toCharArray();            
+            rowNumber = findRowNumber(charWord[0]);            
+            for(int idx = 1; idx<charWord.length; idx++)
+            {
+                // If the rows are different, then update rowNumber as -1
+                if(rowNumber != findRowNumber(charWord[idx]))
+                {
+                    rowNumber = -1;
+                    break;
+                }                    
+            }                  
+            
+            if(rowNumber != -1)
+                findWord.add(new String(charWord));                
+        }        
+        return findWord.toArray(new String[findWord.size()]);       
+    }
+    
+    public int findRowNumber(char c)
+    {
+        for(int num=0; num<3; num++)
+        {            //Identify the row number
+            if(rows[num].indexOf(Character.toUpperCase(c)) != -1)
+                return num;
+        }
+        return -1;
+    }
+}
diff --git a/java/shouldPrintMessage.java b/java/shouldPrintMessage.java
@@ -0,0 +1,30 @@
+public class Logger {
+    
+    private HashMap<String, Integer> map;
+    
+    /** Initialize your data structure here. */
+    public Logger() {        
+       map  = new HashMap<>();
+                
+    }
+    
+    /** Returns true if the message should be printed in the given timestamp, otherwise returns false.
+        If this method returns false, the message will not be printed.
+        The timestamp is in seconds granularity. */
+    public boolean shouldPrintMessage(int timestamp, String message) {
+        if(!map.containsKey(message) || timestamp - map.get(message) >= 10)
+        {
+            map.put(message, timestamp);
+            return true;
+        }
+        
+        return false;
+            
+    }
+}
+
+/**
+ * Your Logger object will be instantiated and called as such:
+ * Logger obj = new Logger();
+ * boolean param_1 = obj.shouldPrintMessage(timestamp,message);
+ */
