Added 2 solutions

varunu28 · varunu28 · commit 031a57c95edc · 2017-12-19T11:59:48.000-08:00
diff --git a/Easy/Min Cost Climbing Stairs.java b/Easy/Min Cost Climbing Stairs.java
@@ -0,0 +1,10 @@
+class Solution {
+    public int minCostClimbingStairs(int[] cost) {
+        int[] dp = new int[cost.length + 1];
+        
+        for (int i = 2; i <= cost.length; i++)
+            dp[i] = Math.min(dp[i - 1] + cost[i - 1], dp[i - 2] + cost[i - 2]);
+        
+        return dp[cost.length];
+    }
+}
diff --git a/Medium/Shortest Completing Word.java b/Medium/Shortest Completing Word.java
@@ -0,0 +1,49 @@
+class Solution {
+    public String shortestCompletingWord(String licensePlate, String[] words) {
+        
+        String licenseWords = "";
+        for (int i=0; i<licensePlate.length(); i++) {
+            if (Character.isLetter(licensePlate.charAt(i))) {
+                licenseWords = licenseWords + String.valueOf(licensePlate.charAt(i));
+            }
+        }
+        
+        String ans = "";
+        int l = Integer.MAX_VALUE;
+        
+        for (String word : words) {
+            if (complete(word.toLowerCase(), licenseWords.toLowerCase())) {
+                if (word.length() < l) {
+                    l = word.length();
+                    ans = word;
+                }
+            }
+        }
+        
+        return ans;
+    }
+    
+    private boolean complete(String word, String toCheck) {
+        
+        Map<Character, Integer> wordMap = new HashMap<>();
+        Map<Character, Integer> toCheckMap = new HashMap<>();
+        
+        for (int i=0;i<word.length(); i++) {
+            wordMap.put(word.charAt(i), wordMap.getOrDefault(word.charAt(i), 0) + 1);
+        }
+        
+        for (int i=0;i<toCheck.length(); i++) {
+            toCheckMap.put(toCheck.charAt(i), toCheckMap.getOrDefault(toCheck.charAt(i), 0) + 1);
+        }
+        
+        for(Map.Entry<Character, Integer> entry : toCheckMap.entrySet()) {
+            if (wordMap.containsKey(entry.getKey()) && wordMap.get(entry.getKey()) >= entry.getValue()) {
+                continue;
+            }
+            
+            return false;
+        }
+        
+        return true;
+    }
+}
