Added LL programs

Author: Jatin-8898

Categories/Linked List/AddTwoNumbers.java renamed to Categories/LinkedList/AddTwoNumbers.java

@@ -4,7 +4,7 @@ class ListNode {
     ListNode(int x) { val = x; }
 }
 
-public class Cycle {
+public class LinkedListCycle {
     public boolean hasCycle(ListNode head) {
         ListNode slow = head;
         ListNode fast = head;

Categories/Linked List/CycleII.java renamed to Categories/LinkedList/CycleII.java

@@ -0,0 +1,16 @@
+class Solution {
+    public int reverse(int x) {
+        boolean overflowed = false;
+        int result = 0;
+        
+        while( x != 0){
+            int num = x % 10;
+            x = x / 10;
+            if((result * 10)/100 != result/10)//MEans overflowed
+                overflowed = true;
+            
+            result = (result*10) + num;
+        }
+        return overflowed ? 0 : result;
+    }
+}

Categories/Linked List/DeleteDupInSortedList.java renamed to Categories/LinkedList/DeleteDupInSortedList.java

@@ -1,28 +1,42 @@
+package String;
+
 import java.util.*;
+public class WordPattern{
+    public static void main(String[] args) {
+        String pattern  = "abba";
+        String str  = "dog dog dog dog";
+        if(isWordPattern(pattern,str))
+            System.out.println("TRUE");
+        else
+            System.out.println("FALSE");    
+    }    
 
-class Solution {
-    public boolean wordPattern(String pattern, String str) {
+    public static boolean isWordPattern(String pattern, String str){
+        
+        String[] arr = str.split(" ");  
 
-       String[] arr = str.split(" ");  
- 
         //prevent out of boundary problem
         if(arr.length != pattern.length())
             return false;
 
         HashMap<Character, String> map = new HashMap<Character, String>();
         for(int i=0; i<pattern.length(); i++){
             char c = pattern.charAt(i);
-            if(map.containsKey(c)){
+            
+            if(map.containsKey(c)){     //if already present
+                
                 String value = map.get(c);
-                if(!value.equals(arr[i])){
+                
+                if(!value.equals(arr[i]))      //if value doesn't mtches with str eg b=dog
                     return false;
-                }
+            
             }else if (map.containsValue(arr[i])){
                 return false;
             }
+
             map.put(c, arr[i]);
         }
 
-        return true;               
-    }   
+        return true;
+    }
 }