Solved 4 problems

varunu28 · varunu28 · commit be57b6ca0d8a · 2017-11-19T13:44:44.000-08:00
diff --git a/Medium/My Calendar II.java b/Medium/My Calendar II.java
@@ -0,0 +1,29 @@
+class MyCalendarTwo {
+    private List<int[]> books = new ArrayList<>();  
+    
+    public boolean book(int s, int e) {
+        
+        MyCalendar overlaps = new MyCalendar();
+        for (int[] b : books)
+            if (Math.max(b[0], s) < Math.min(b[1], e))
+                if (!overlaps.book(Math.max(b[0], s), Math.min(b[1], e))) return false;
+        books.add(new int[]{ s, e });
+        return true;
+    }
+
+    private static class MyCalendar {
+        List<int[]> books = new ArrayList<>();
+        public boolean book(int start, int end) {
+            for (int[] b : books)
+                if (Math.max(b[0], start) < Math.min(b[1], end)) return false;
+            books.add(new int[]{ start, end });
+            return true;
+        }
+    }
+}
+
+/**
+ * Your MyCalendarTwo object will be instantiated and called as such:
+ * MyCalendarTwo obj = new MyCalendarTwo();
+ * boolean param_1 = obj.book(start,end);
+ */
diff --git a/Medium/Self Dividing Numbers.java b/Medium/Self Dividing Numbers.java
@@ -0,0 +1,28 @@
+class Solution {
+    public List<Integer> selfDividingNumbers(int left, int right) {
+        ArrayList<Integer> arr = new ArrayList<>();
+        
+        while(left <= right) {
+            if(selfDivide(left)) {
+                arr.add(left);
+            }
+            left++;
+        }
+        
+        return arr;
+    }
+    
+    private boolean selfDivide(int n) {
+        int copy = n;
+        while(n>0) {
+            int rem = n%10;
+            if (rem == 0) return false;
+            if(copy%rem != 0) {
+                return false;
+            }
+            n /= 10;
+        }
+        
+        return true;
+    }
+}
diff --git a/Medium/Split Linked List into Parts.java b/Medium/Split Linked List into Parts.java
@@ -0,0 +1,44 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+
+class Solution {
+    public ListNode[] splitListToParts(ListNode root, int k) {
+        int m = findLength(root);
+        ListNode temp = root;
+        
+        ListNode[] res = new ListNode[k];
+        int size=m/k;
+        int l= m%k;
+        
+        for(int i=0;i<k;i++){
+            ListNode ans= temp;
+            int j=size;
+            while(temp!=null && j>1){
+                temp=temp.next;j--;
+            }
+            if(size!=0 && l>0 && temp!=null){ temp=temp.next;  l--;}
+            ListNode temp1=temp;
+            if(temp!=null) temp=temp.next;
+            if(temp1!=null) temp1.next=null;
+            res[i]=ans;
+        }
+        return res;
+    }
+    
+    private int findLength(ListNode root) {
+        if (root == null) return 0;
+        int l = 0;
+        while(root != null) {
+            l++;
+            root = root.next;
+        }
+        
+        return l;
+    }
+}
diff --git a/Medium/Swap Nodes in Pair.java b/Medium/Swap Nodes in Pair.java
@@ -0,0 +1,33 @@
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+    public ListNode swapPairs(ListNode head) {
+        if(head == null || head.next == null) return head;
+        
+        ListNode temp = head.next;
+        ListNode prev = null;
+        
+        while(head != null && head.next != null) {
+            
+            if(prev != null) {
+                prev.next = head.next;
+            }
+            
+            ListNode temp1 = head.next;
+            ListNode temp2 = head;
+            head.next = head.next.next;
+            head = temp1;
+            head.next = temp2;
+            prev = head.next;
+            head = head.next.next;
+        }
+        
+        return temp;
+    }
+}
