Added 2 solutions

varunu28 · varunu28 · commit 848c9ab58ebb · 2018-09-24T18:49:28.000-07:00
diff --git a/Easy/Most Common Word.java b/Easy/Most Common Word.java
@@ -0,0 +1,30 @@
+class Solution {
+    public static String mostCommonWord(String paragraph, String[] banned) {
+        paragraph = paragraph.toLowerCase();
+        List<String> bannedWords = Arrays.asList(banned);
+
+        String[] words = paragraph.trim().split("\\s+");
+        Map<String, Integer> map = new LinkedHashMap<>();
+        int maxValue = Integer.MIN_VALUE;
+
+        for (String word : words) {
+
+            if (!Character.isAlphabetic(word.charAt(word.length()-1))) {
+                word = word.substring(0, word.length()-1);
+            }
+
+            if (!(word.equals(" ") || word.equals("")) && bannedWords.indexOf(word) == -1) {
+                map.put(word, map.getOrDefault(word, 0) + 1);
+                maxValue = Math.max(maxValue, map.get(word));
+            }
+        }
+
+        for (String word : map.keySet()) {
+            if (map.get(word) == maxValue) {
+                return word;
+            }
+        }
+
+        return "";
+    }
+}
diff --git a/Hard/Merge K Sorted Lists.java b/Hard/Merge K Sorted Lists.java
@@ -0,0 +1,43 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode mergeKLists(ListNode[] lists) {
+        if (lists.length == 0) {
+            return null;
+        }
+
+        PriorityQueue<ListNode> queue = new PriorityQueue<>(lists.length, new Comparator<ListNode>() {
+            @Override
+            public int compare(ListNode o1, ListNode o2) {
+                return o1.val - o2.val;
+            }
+        });
+
+        for (int i = 0; i < lists.length; i++) {
+            if (lists[i] != null) {
+                queue.add(lists[i]);
+            }
+        }
+
+        ListNode head = new ListNode(0);
+        ListNode p = head;
+
+        while (!queue.isEmpty()) {
+            ListNode node = queue.poll();
+            p.next = node;
+            if (node.next != null) {
+                queue.add(node.next);
+            }
+
+            p = p.next;
+        }
+
+        return head.next;
+    }
+}
