From 9fe5d1ee191ba97b1befc88fd0293832173173ee Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Sat, 15 Sep 2018 19:41:59 -0500
Subject: [PATCH 01/35] some codes

---
 Codes/CommonDivisorHE.java     | 31 ++++++++++++++++++
 Codes/FindTheNextHE.java       | 34 ++++++++++++++++++++
 Codes/ImpressingTheBossHR.java | 43 +++++++++++++++++++++++++
 Codes/MatrixOperations.java    | 59 ++++++++++++++++++++++++++++++++++
 Codes/PairRecoveryHE.java      | 28 ++++++++++++++++
 Codes/loop_LinkedList.java     |  1 +
 Codes/testcommit.java          | 19 +++++++++++
 props.properties               |  2 ++
 src/ChainInspection.java       | 32 ++++++++++++++++++
 src/MergeStrings.java          | 25 ++++++++++++++
 src/Myinterface.java           |  6 ++++
 src/test.java                  | 39 ++++++++++++++++++++++
 src/test1.java                 | 46 ++++++++++++++++++++++++++
 src/test2.java                 | 30 +++++++++++++++++
 14 files changed, 395 insertions(+)
 create mode 100644 Codes/CommonDivisorHE.java
 create mode 100644 Codes/FindTheNextHE.java
 create mode 100644 Codes/ImpressingTheBossHR.java
 create mode 100644 Codes/MatrixOperations.java
 create mode 100644 Codes/PairRecoveryHE.java
 create mode 100644 props.properties
 create mode 100644 src/ChainInspection.java
 create mode 100644 src/MergeStrings.java
 create mode 100644 src/Myinterface.java
 create mode 100644 src/test.java
 create mode 100644 src/test1.java
 create mode 100644 src/test2.java

diff --git a/Codes/CommonDivisorHE.java b/Codes/CommonDivisorHE.java
new file mode 100644
index 0000000..7a44509
--- /dev/null
+++ b/Codes/CommonDivisorHE.java
@@ -0,0 +1,31 @@
+import java.util.Scanner;
+
+public class CommonDivisorHE {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in  = new Scanner(System.in);
+		System.out.println("Enter the numbers");
+		int a = in.nextInt();
+		int b = in.nextInt();
+		int count = 0;
+		if(a>b){
+	        //int count =0;
+	        for(int i =1;i<=a;i++){
+	            if(a%i == 0 && b%i == 0){
+	                count++;
+	            }
+	        }
+	    }else if(a<b){
+	        //int count =0;
+	        for(int i=1;i<=b;i++){
+	            if(a%i == 0 && b%i == 0){
+	                count++;
+	                
+	            }
+	            
+	        }
+	        System.out.println(count);
+	    }
+	}
+}
diff --git a/Codes/FindTheNextHE.java b/Codes/FindTheNextHE.java
new file mode 100644
index 0000000..c331e37
--- /dev/null
+++ b/Codes/FindTheNextHE.java
@@ -0,0 +1,34 @@
+import java.util.Scanner;
+
+public class FindTheNextHE {
+	
+	private static void calculate(int[] a, int q) {
+		q=q+1;
+		for(int i=0;i<a.length;i++){
+			if(a[i] == q){
+				q=q+1;
+			}
+		}
+		System.out.println(q);
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int len = in.nextInt();
+		int query = in.nextInt();
+		int a[] = new int[len];
+		
+		
+		for(int i=0;i<len;i++){
+			a[i] = in.nextInt();
+		}
+		for(int i=0;i<query;i++){
+		int q1 = in.nextInt();
+		calculate(a, q1);
+		}
+		
+	}
+
+	
+}
diff --git a/Codes/ImpressingTheBossHR.java b/Codes/ImpressingTheBossHR.java
new file mode 100644
index 0000000..6eb782a
--- /dev/null
+++ b/Codes/ImpressingTheBossHR.java
@@ -0,0 +1,43 @@
+import java.util.Scanner;
+
+public class ImpressingTheBossHR {
+	
+	public static String canModify(int[] a){
+		int count = 0;
+		int i=0;
+		if(a.length == 0){
+			return "NO";
+		}
+		while(i<a.length-1){
+			for(int j=1;j<a.length;j++){
+				if(a[j] < a[i]){
+					count++;
+				}
+				i++;
+			}
+		}
+			if(count >= 2){
+				return "NO";
+			}
+			return "YES";
+		
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+	/*	Scanner in = new Scanner(System.in);
+		System.out.println("Enter the length of array");
+		int l = in.nextInt();
+		int arr[] = new int[l];
+		
+		System.out.println("Enter the elements of array");
+		for(int i=0;i<l;i++){
+			arr[i] = in.nextInt();
+		}*/
+		//int arr[] = {5,7,7,11,15,12,22,24};
+		int arr[] = {20,19,18,16,14,15,14,13,11};
+		
+		System.out.println(canModify(arr));
+	}
+
+}
diff --git a/Codes/MatrixOperations.java b/Codes/MatrixOperations.java
new file mode 100644
index 0000000..0d41d7e
--- /dev/null
+++ b/Codes/MatrixOperations.java
@@ -0,0 +1,59 @@
+import java.util.Scanner;
+
+public class MatrixOperations {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		
+		Scanner in = new Scanner(System.in);
+		
+		int board[][] = new int[256][256];
+		for(int i=0;i<=255;i++){
+			for(int j=0;j<=255;j++){
+				board[i][j] = 0;
+			}
+		}
+		
+		
+		while(in.hasNext()){
+			String line = in.nextLine();
+			String elements[] = line.split("\\s");
+			String command = elements[0];
+			int target  = Integer.parseInt(elements[1]);
+			int value = 0;
+			
+			
+			if(command.equalsIgnoreCase("setrow")){
+				value = Integer.parseInt(elements[2]);
+				for(int i=0;i<256;i++){
+					board[target][i] = value;
+				}
+			}
+			
+			if(command.equalsIgnoreCase("setcol")){
+				value = Integer.parseInt(elements[2]);
+				for(int i=0;i<256;i++){
+					board[i][target] = value;
+				}
+			}
+				
+				
+			if(command.equalsIgnoreCase("querycol")){
+				int total = 0;
+				for(int i=0;i<256;i++){
+					total += board[i][target];
+				}
+				System.out.println(total);
+		}
+			
+			if(command.equalsIgnoreCase("queryrow")){
+				int total = 0;
+				for(int i=0;i<256;i++){
+					total += board[target][i];
+				}
+				System.out.println(total);
+		}
+		}
+	}
+}
+
diff --git a/Codes/PairRecoveryHE.java b/Codes/PairRecoveryHE.java
new file mode 100644
index 0000000..133f4cb
--- /dev/null
+++ b/Codes/PairRecoveryHE.java
@@ -0,0 +1,28 @@
+import java.util.Scanner;
+
+public class PairRecoveryHE {
+	
+	public static void calculate(int a3, int a4)
+	{
+		int a1,a2 = 0;
+		int temp = a4-a3;
+		a2 = temp;
+		int temp1 = a3-a2;
+		a1 = temp1;
+		
+		System.out.println(a1 +" "+a2);
+		
+	}
+	
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int a3 = in.nextInt();
+		int a4 = in.nextInt();
+		
+		calculate(a3,a4);
+
+	}
+
+}
diff --git a/Codes/loop_LinkedList.java b/Codes/loop_LinkedList.java
index 70fd4f1..8b02df5 100644
--- a/Codes/loop_LinkedList.java
+++ b/Codes/loop_LinkedList.java
@@ -20,6 +20,7 @@ int detectAndRemoveLoop(Node node) {
             fast = fast.next.next;
  
             if (slow == fast) {
+            	System.out.println(slow.data);
                 removeLoop(slow, node);
                 return 1;
             }
diff --git a/Codes/testcommit.java b/Codes/testcommit.java
index 2b07fc5..a50a6a2 100644
--- a/Codes/testcommit.java
+++ b/Codes/testcommit.java
@@ -3,6 +3,25 @@ public class testcommit {
 
 	public static void main(String[] args) {
 		// TODO Auto-generated method stub
+		String s = "hello i'm lOOking for a Java Developer Position.";
+		s.toLowerCase();
+		char[] c = s.toCharArray();
+		
+		
+		for(int i=0;i<c.length;i++){
+			int count  = 0;
+			for(int j=0;j<c.length;j++){
+				if(c[i] == c[j]){
+					count++;
+					
+				}
+				if(j == s.length()-1){
+					System.out.println(c[i] + " "+ count);
+				}
+				
+			}
+			
+		}
 
 	}
 
diff --git a/props.properties b/props.properties
new file mode 100644
index 0000000..573589d
--- /dev/null
+++ b/props.properties
@@ -0,0 +1,2 @@
+A=10
+b=20
\ No newline at end of file
diff --git a/src/ChainInspection.java b/src/ChainInspection.java
new file mode 100644
index 0000000..edd3d77
--- /dev/null
+++ b/src/ChainInspection.java
@@ -0,0 +1,32 @@
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Map.Entry;
+
+public class ChainInspection {
+
+	public static void main(String[] args) {
+		String input = "4-2;BEGIN-3;3-4;2-END";
+		String[] tempArr = input.split(";");
+		for(int i=0;i<tempArr.length;i++)
+			System.out.print(tempArr[i] + "  ");
+		System.out.println();
+		Map<String,String> map = new HashMap<String,String>();
+		for(String s: tempArr) {
+			String[] elements = s.split("-");
+			map.put(elements[0], elements[1]);
+			/*for(int i=0;i<elements.length;i++)
+				System.out.print(elements[i]+"");*/
+			/*if(elements[0].equals(elements[1]))
+				System.out.println("bad");*/
+		}
+		System.out.println(map.entrySet());
+		for(Entry<String, String> s: map.entrySet()) {
+			if(s.getKey().equals(s.getValue()))
+				System.out.println("bad");
+			else if(map.get("BEGIN") != null) {
+				System.out.println(map.get("BEGIN"));
+			}
+		}
+	}
+
+}
\ No newline at end of file
diff --git a/src/MergeStrings.java b/src/MergeStrings.java
new file mode 100644
index 0000000..2790070
--- /dev/null
+++ b/src/MergeStrings.java
@@ -0,0 +1,25 @@
+
+public class MergeStrings {
+	
+	
+	public static String mergeStrings(String s1, String s2){
+		String mergedString = "";
+		    for(int i=0;i<s1.length();i++){
+		        mergedString=mergedString+s1.charAt(i) + s2.charAt(i);      
+		    }
+		    if(s1.length()<s2.length()){
+		        mergedString=mergedString+s2.substring(s1.length());
+		    }
+		    return mergedString;
+		  }
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		
+		String s1 = "abc";
+		String s2 = "stuvwx";
+		
+		System.out.println(mergeStrings(s1,s2));
+
+	}
+
+}
diff --git a/src/Myinterface.java b/src/Myinterface.java
new file mode 100644
index 0000000..230bbfc
--- /dev/null
+++ b/src/Myinterface.java
@@ -0,0 +1,6 @@
+interface Myinterface {
+default void method1(){
+	System.out.println("sameer");
+}
+
+}
diff --git a/src/test.java b/src/test.java
new file mode 100644
index 0000000..48b5948
--- /dev/null
+++ b/src/test.java
@@ -0,0 +1,39 @@
+public class test{
+	
+	static int insertInSortedArr(int arr[],int n,int key, int capacity){
+		if(n >= capacity){
+			return n;
+		}
+		int i;
+		for(i=n-1; (i>0 && arr[i] > key); i--)
+			arr[i+1] = arr[i];
+		
+		arr[i+1] = key;
+		return (n+1);
+	}
+	
+	static void view(int arr[]){
+		for(int i=0;i<arr.length;i++){
+			System.out.println(arr[i]);
+		}
+	}
+	
+	
+	
+	
+	public static void main(String args[]){
+		int arr[] = new int[20];
+		arr[0] = 10;
+		arr[1] = 12;
+		arr[2] = 14;
+		arr[3] = 20;
+		arr[4] = 40;
+		arr[5] = 70;
+		
+		int capacity = arr.length;
+		int key = 26;
+		int n =6;
+		System.out.println(insertInSortedArr(arr,n,key,capacity));
+		view(arr);	
+	}
+}
\ No newline at end of file
diff --git a/src/test1.java b/src/test1.java
new file mode 100644
index 0000000..b54d0f2
--- /dev/null
+++ b/src/test1.java
@@ -0,0 +1,46 @@
+
+public class test1 {
+
+	static int binarySearch(int arr[],int low, int high, int key){
+		if(high<low){
+			return -1;
+		}
+		int mid = (high+low)/2;
+		if(key == arr[mid]){
+			return mid;
+		}
+		else if(key > arr[mid]){
+			return binarySearch(arr, mid+1, high, key);
+		}
+		return binarySearch(arr, low, mid-1, key);
+	}
+	
+	static int deleteElement(int arr[],int pos){
+		for(int i=pos;i<arr.length-1;i++){
+			arr[i] = arr[i+1];
+		}
+		
+		return arr.length-1;
+	}
+	
+	
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		
+		int arr[] = new int[6];
+		arr[0] = 10;
+		arr[1] = 12;
+		arr[2] = 14;
+		arr[3] = 20;
+		arr[4] = 40;
+		arr[5] = 70;
+		
+		int n = arr.length;
+		int key = 40;
+		
+		int pos = binarySearch(arr,0,n,key);
+		System.out.println(pos);
+		deleteElement(arr,pos);
+	}
+
+}
diff --git a/src/test2.java b/src/test2.java
new file mode 100644
index 0000000..d705edd
--- /dev/null
+++ b/src/test2.java
@@ -0,0 +1,30 @@
+public class test2 {
+
+	public test2() {
+		
+
+	}
+
+	public void printD() {
+		char[][] pic = new char[6][6];
+        for (int i = 0; i < 6; i++)
+           for (int j = 0; j < 6; j++) {
+              if ( i == j  ||  i == 0  ||  i == 5 )
+                 pic[i][j] = '*';
+              else
+                 pic[i][j] = '.';
+           }
+        for (int i = 0; i < 6; i++) {
+           for (int j = 0; j < 6; j++)
+              System.out.print(pic[i][j]);
+           System.out.println();
+        }
+		
+		
+	}
+	public static void main(String [] args) {
+		test2 myclass1 = new test2();
+		myclass1.printD();
+		
+	}
+}
\ No newline at end of file

From 14b5807580e14028ed24c1f6da0b9726731e47f2 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sam1502@users.noreply.github.com>
Date: Sat, 15 Sep 2018 20:07:59 -0500
Subject: [PATCH 02/35] Rename test2.java to PatternPrint.java

---
 src/{test2.java => PatternPrint.java} | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)
 rename src/{test2.java => PatternPrint.java} (99%)

diff --git a/src/test2.java b/src/PatternPrint.java
similarity index 99%
rename from src/test2.java
rename to src/PatternPrint.java
index d705edd..2253f30 100644
--- a/src/test2.java
+++ b/src/PatternPrint.java
@@ -27,4 +27,4 @@ public static void main(String [] args) {
 		myclass1.printD();
 		
 	}
-}
\ No newline at end of file
+}

From e78b1c9b5eed84e5b9c01474caaa5182cbe0ff84 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Tue, 18 Sep 2018 22:41:21 -0500
Subject: [PATCH 03/35] Hacker rank codes

---
 Codes/ExceptionStrToInt.java        | 21 ++++++++++
 src/hackerRank/JavaArrayListHR.java | 65 +++++++++++++++++++++++++++++
 src/hackerRank/JavaListHR.java      | 45 ++++++++++++++++++++
 3 files changed, 131 insertions(+)
 create mode 100644 Codes/ExceptionStrToInt.java
 create mode 100644 src/hackerRank/JavaArrayListHR.java
 create mode 100644 src/hackerRank/JavaListHR.java

diff --git a/Codes/ExceptionStrToInt.java b/Codes/ExceptionStrToInt.java
new file mode 100644
index 0000000..f770122
--- /dev/null
+++ b/Codes/ExceptionStrToInt.java
@@ -0,0 +1,21 @@
+import java.util.Scanner;
+
+public class ExceptionStrToInt {
+
+	public static void main(String[] args) throws Exception{
+		// TODO Auto-generated method stub
+		
+		Scanner in = new Scanner(System.in);
+		String s = in.next();
+		
+		try{
+		int a = Integer.parseInt(s);
+		System.out.println(a);
+		}
+		catch(Exception ex){
+			System.out.println("Bad String");
+		}
+
+	}
+
+}
diff --git a/src/hackerRank/JavaArrayListHR.java b/src/hackerRank/JavaArrayListHR.java
new file mode 100644
index 0000000..8e0a777
--- /dev/null
+++ b/src/hackerRank/JavaArrayListHR.java
@@ -0,0 +1,65 @@
+/*Sometimes it's better to use dynamic size arrays. Java's Arraylist can provide you this feature. Try to solve this problem using Arraylist.
+You are given n lines. In each line there are zero or more integers. You need to answer a few queries where you need to tell the number located in yth position of xth line. 
+
+
+5 //number of lines
+5 41 77 74 22 44// line 1 {the first element of line represnets the number of elements in line}
+1 12 // line 2
+4 37 34 36 52 // line 3
+0// line 4
+3 20 22 33 // line 5
+5
+1 3
+3 4
+3 1
+4 3
+5 5
+
+OUTPUT:
+	74
+	52
+	37
+	ERROR!
+	ERROR!
+*/
+
+package hackerRank;
+
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class JavaArrayListHR {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		
+		Scanner in = new Scanner(System.in);
+		int numLines = in.nextInt();
+		
+		ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
+		for(int row = 0;row< numLines;row++){
+			int d = in.nextInt();
+			ArrayList<Integer> list = new ArrayList<>();
+			for(int col = 0; col < d ; col++){
+				list.add(in.nextInt());
+			}
+			lists.add(list);
+		}
+		
+		int q = in.nextInt();
+		for(int i=0;i<q;i++){
+			int x = in.nextInt();
+			int y = in.nextInt();
+			
+			ArrayList<Integer> list = lists.get(x-1);
+			if(y <= list.size()){
+				System.out.println(list.get(y-1));
+			}
+			else{
+				System.out.println("ERROR!");
+			}
+		}
+		in.close();
+	}
+
+}
diff --git a/src/hackerRank/JavaListHR.java b/src/hackerRank/JavaListHR.java
new file mode 100644
index 0000000..5070e0b
--- /dev/null
+++ b/src/hackerRank/JavaListHR.java
@@ -0,0 +1,45 @@
+/*For this problem, we have 2 types of queries you can perform on a List:
+	Insert y at indesx x:
+		Insert
+		x y
+	Delete the element at Insex x:
+		Delete
+		x
+*/
+package hackerRank;
+
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class JavaListHR {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		
+		 Scanner in = new Scanner(System.in);
+	        int N = in.nextInt();
+	        ArrayList<Integer> list = new ArrayList<>();
+	        for (int i = 0; i < N; i++) {
+	            list.add(in.nextInt());
+	        }
+	        
+	        /* Perfrom queries on Linked List */
+	        int q = in.nextInt();
+	        for (int i = 0; i < q; i++) {
+	            String action = in.next();
+	            if (action.equals("Insert")) {
+	                int index = in.nextInt();
+	                int value = in.nextInt();
+	                list.add(index, value);
+	            } else { // "Delete"
+	                int index = in.nextInt();
+	                list.remove(index);
+	            }
+	        }
+	        in.close();
+	        
+	        /* Print our updated Linked List */
+	            System.out.print(list);
+	        
+	    }
+	}
\ No newline at end of file

From e76d50e299d1ccca6935e1b4f9fefb64c8487da8 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Wed, 19 Sep 2018 20:44:09 -0500
Subject: [PATCH 04/35] hacker rank

---
 src/hackerRank/JavaMap.java | 36 ++++++++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 src/hackerRank/JavaMap.java

diff --git a/src/hackerRank/JavaMap.java b/src/hackerRank/JavaMap.java
new file mode 100644
index 0000000..96895cd
--- /dev/null
+++ b/src/hackerRank/JavaMap.java
@@ -0,0 +1,36 @@
+package hackerRank;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Scanner;
+
+public class JavaMap {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		Map<String,Integer> phonebook = new HashMap<>();
+		System.out.println("entries");
+		int entries = in.nextInt();
+		in.nextLine();
+		for(int i=0;i<entries;i++){
+			String name = in.nextLine();
+			int num = in.nextInt();
+			phonebook.put(name, num);
+			in.nextLine();
+		}
+		
+		while(in.hasNext()){
+			String n = in.nextLine();
+			try{
+				int temp = phonebook.get(n);
+				System.out.println(n+" = "+temp);
+			}
+			catch(Exception e){
+				System.out.println("Not found");
+			}
+		}
+
+	}
+
+}

From 3c4b9a7daf33f712b571d348ee2b4c6091a8c4fb Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Wed, 26 Sep 2018 20:25:49 -0500
Subject: [PATCH 05/35] hackerrank

---
 src/hackerRank/JavaHashSet.java | 47 ++++++++++++++++++++++++++++++++
 src/hackerRank/JavaStack.java   | 48 +++++++++++++++++++++++++++++++++
 2 files changed, 95 insertions(+)
 create mode 100644 src/hackerRank/JavaHashSet.java
 create mode 100644 src/hackerRank/JavaStack.java

diff --git a/src/hackerRank/JavaHashSet.java b/src/hackerRank/JavaHashSet.java
new file mode 100644
index 0000000..482eaff
--- /dev/null
+++ b/src/hackerRank/JavaHashSet.java
@@ -0,0 +1,47 @@
+/*Input
+5
+john tom
+john mary
+john tom
+mary anna
+mary anna
+
+
+output:
+1
+2
+2
+3
+3
+*/
+package hackerRank;
+
+import java.util.HashSet;
+import java.util.Scanner;
+
+public class JavaHashSet {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		
+		HashSet<String> pair = new HashSet<>();
+		Scanner in = new Scanner(System.in);
+		int t = in.nextInt();
+		String[] pair_left = new String[t];
+		String[] pair_right = new String[t];
+		
+		for(int i=0;i<t;i++){
+			pair_left[i] = in.next();
+			pair_right[i] = in.next();
+		}
+		
+		for(int i=0;i<t;i++){
+			pair.add("(" + pair_left[i]+ "," + pair_right[i]+")");
+			System.out.println(pair.size());
+		}
+		
+		
+
+	}
+
+}
diff --git a/src/hackerRank/JavaStack.java b/src/hackerRank/JavaStack.java
new file mode 100644
index 0000000..3a79059
--- /dev/null
+++ b/src/hackerRank/JavaStack.java
@@ -0,0 +1,48 @@
+package hackerRank;
+
+import java.util.Scanner;
+import java.util.Stack;
+
+public class JavaStack {
+		
+		public static void main(String[] args){
+			Scanner in = new Scanner(System.in);
+			while(in.hasNext()){
+				String input=in.next();
+		          Stack<Character> s = new Stack();
+		          boolean isBalanced = true;
+		          for(char c : input.toCharArray()) {
+		              switch (c) {
+		                  case '{':
+		                  case '(':
+		                  case '[':
+		                    s.push(c);
+		                    break;
+		                  case '}':
+		                    if (!s.empty() && s.peek() == '{')
+		                        s.pop();
+		                    else
+		                        isBalanced = false;
+		                    break;
+		                  case ')':
+		                    if (!s.empty() && s.peek() == '(')
+		                        s.pop();
+		                    else
+		                        isBalanced = false;
+		                    break;
+		                  case ']':
+		                    if (!s.empty() && s.peek() == '[')
+		                        s.pop();
+		                    else
+		                        isBalanced = false;
+		                    break;
+		              }
+		          }
+		          if (!s.empty() || !isBalanced){
+		              System.out.println("false");
+		          } else
+		              System.out.println("true");
+		      }
+		      
+		   }
+		}
\ No newline at end of file

From da1fab36109eb1fbe09af57b4407bfcf1864c45c Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Mon, 8 Oct 2018 20:46:25 -0500
Subject: [PATCH 06/35] HackerRank/HackerEarth codes

---
 src/hackerRank/CityTravel.java        | 44 ++++++++++++++
 src/hackerRank/GatesHE.java           | 25 ++++++++
 src/hackerRank/JavaSortHR.java        | 85 +++++++++++++++++++++++++++
 src/hackerRank/JewelsAndStonesLC.java | 54 +++++++++++++++++
 src/hackerRank/LongestWord.java       | 22 +++++++
 src/hackerRank/ValidatingIPHR.java    | 25 ++++++++
 6 files changed, 255 insertions(+)
 create mode 100644 src/hackerRank/CityTravel.java
 create mode 100644 src/hackerRank/GatesHE.java
 create mode 100644 src/hackerRank/JavaSortHR.java
 create mode 100644 src/hackerRank/JewelsAndStonesLC.java
 create mode 100644 src/hackerRank/LongestWord.java
 create mode 100644 src/hackerRank/ValidatingIPHR.java

diff --git a/src/hackerRank/CityTravel.java b/src/hackerRank/CityTravel.java
new file mode 100644
index 0000000..3b04b7c
--- /dev/null
+++ b/src/hackerRank/CityTravel.java
@@ -0,0 +1,44 @@
+package hackerRank;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Scanner;
+
+public class CityTravel {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int s = in.nextInt(); // Distance between A nad B
+		int x = in.nextInt(); // KM in one normal day
+		int n = in.nextInt(); // exceptions
+		
+		Map<Integer, Integer> daysSteps = new HashMap<>();
+		for(int i=0;i<n;i++){
+			int days = in.nextInt();
+			int steps = in.nextInt();
+			daysSteps.put(days, steps);
+		}
+		while(s > 0){
+		int count = 0;
+		if(daysSteps.containsKey(count)){
+			s = s - daysSteps.get(count);
+			count++;
+		}
+		else if(s>0){
+			s = s-x;
+			count++;
+		}
+		else
+		{
+			System.out.println("No");
+		}
+		
+		System.out.println(count);
+		}
+		
+		System.out.println(s);
+
+	}
+
+}
diff --git a/src/hackerRank/GatesHE.java b/src/hackerRank/GatesHE.java
new file mode 100644
index 0000000..e1b5859
--- /dev/null
+++ b/src/hackerRank/GatesHE.java
@@ -0,0 +1,25 @@
+package hackerRank;
+
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.text.DecimalFormat;
+
+public class GatesHE {
+	public static void main(String[] args) throws Exception{
+		// TODO Auto-generated method stub
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	    
+		   
+        int n=Integer.parseInt(br.readLine());
+        while(n>0){
+        	n--;
+        	int d=Integer.parseInt(br.readLine());
+        	double r=(double)1/d;
+        	r=(double)1-r;
+        	DecimalFormat numberFormat = new DecimalFormat("0.000000");
+        	//numberFormat.setRoundingMode(RoundingMode.FLOOR);
+        	System.out.println(numberFormat.format(r));
+        }
+}
+
+}
\ No newline at end of file
diff --git a/src/hackerRank/JavaSortHR.java b/src/hackerRank/JavaSortHR.java
new file mode 100644
index 0000000..d07eb44
--- /dev/null
+++ b/src/hackerRank/JavaSortHR.java
@@ -0,0 +1,85 @@
+/*You are given a list of student information: ID, FirstName, and CGPA.
+ * Your task is to rearrange them according to their CGPA in decreasing order.
+ * If two student have the same CGPA, then arrange them according to their first name in alphabetical order.
+ * If those two students also have the same first name, then order them according to their ID. 
+ * No two students have the same ID.*/
+
+
+
+package hackerRank;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.Comparator;
+import java.util.List;
+import java.util.Scanner;
+
+
+class Student{
+	private int id;
+	private String fname;
+	private double cgpa;
+	
+	public Student(int id, String fname, double cgpa){
+		this.id = id;
+		this.fname = fname;
+		this.cgpa = cgpa;
+	}
+	
+	public int getId() {
+		return id;
+	}
+
+	public String getFname() {
+		return fname;
+	}
+
+	public double getCgpa() {
+		return cgpa;
+	}
+	
+}
+
+class Sorter implements Comparator<Student>{
+
+	@Override
+	public int compare(Student o1, Student o2) {
+		if(o1.getCgpa() == o2.getCgpa()){
+			if(o1.getFname().equals(o2.getFname()))
+				return ((o1.getId() < o2.getId()) ? 1:-1);
+			else
+				return (o1.getFname().compareTo(o2.getFname()));
+		}
+		else
+			return ((o1.getCgpa() < o2.getCgpa()) ? 1:-1);
+	}
+	
+}
+
+
+public class JavaSortHR {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		List<Student> stu = new ArrayList<>();
+		int testCases = in.nextInt();
+		
+		for(int i=0;i<testCases;i++){
+			int id = in.nextInt();
+			String fname = in.next();
+			double cgpa = in.nextDouble();
+			
+			Student st = new Student(id, fname, cgpa);
+			stu.add(st);
+		}
+		
+		Sorter sorter = new Sorter();
+		Collections.sort(stu, sorter);
+		for(Student st : stu){
+			System.out.println(st.getFname());
+		}
+
+	}
+
+}
diff --git a/src/hackerRank/JewelsAndStonesLC.java b/src/hackerRank/JewelsAndStonesLC.java
new file mode 100644
index 0000000..22b26cc
--- /dev/null
+++ b/src/hackerRank/JewelsAndStonesLC.java
@@ -0,0 +1,54 @@
+/*Input: J = "aA", S = "aAAbbbb"
+Output: 3
+
+
+Input: J = "z", S = "ZZ"
+Output: 0
+
+*/
+
+
+package hackerRank;
+
+import java.util.HashSet;
+import java.util.Scanner;
+import java.util.Set;
+
+public class JewelsAndStonesLC {
+	
+	private static int evaluate(String J, String S){
+		int count = 0;
+		if(S == null || J == null){
+			return 0;
+		}
+		Set<Character> res = new HashSet<>();
+		
+		char[] s1 = S.toCharArray();
+		char[] j1 = J.toCharArray();
+		
+		for(char jewel : j1){
+			res.add(jewel);
+		}
+		
+		for(char stones : s1){
+			if(res.contains(stones)){
+				count++;
+			}
+		}
+		
+		return count;
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		
+		String J = in.next();
+		String S = in.next();
+		
+		System.out.println(evaluate(J,S));
+		in.close();
+
+	}
+
+}
diff --git a/src/hackerRank/LongestWord.java b/src/hackerRank/LongestWord.java
new file mode 100644
index 0000000..4193244
--- /dev/null
+++ b/src/hackerRank/LongestWord.java
@@ -0,0 +1,22 @@
+package hackerRank;
+
+import java.util.Scanner;
+
+public class LongestWord {
+	
+	private static void evaluate(String str){
+		str = str.replaceAll("[^a-zA-Z0-9]", "");
+		System.out.println(str);
+		
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		String str = in.next();
+	
+		evaluate(str);
+
+	}
+
+}
diff --git a/src/hackerRank/ValidatingIPHR.java b/src/hackerRank/ValidatingIPHR.java
new file mode 100644
index 0000000..30911b6
--- /dev/null
+++ b/src/hackerRank/ValidatingIPHR.java
@@ -0,0 +1,25 @@
+package hackerRank;
+
+import java.util.Scanner;
+import java.util.regex.Matcher;
+import java.util.regex.Pattern;
+
+public class ValidatingIPHR {
+	
+	private static boolean validate(String s){
+	Pattern ptn = Pattern.compile("^(\\d{1,3})\\.(\\d{1,3})\\.(\\d{1,3})\\.(\\d{1,3})$");
+    Matcher mtch = ptn.matcher(s);
+    return mtch.find();
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		while(in.hasNext()){
+			String ip = in.next();
+			System.out.println(validate(ip));
+		}
+
+	}
+
+}

From 4b838798707347258a5f92e33f2bab86dcee2af7 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Fri, 19 Oct 2018 20:57:13 -0500
Subject: [PATCH 07/35] hacker rank

---
 src/hackerRank/AddTwoNumbers.java             | 52 +++++++++++++++++++
 src/hackerRank/DiamondProblemHE.java          | 33 ++++++++++++
 src/hackerRank/MaxCircularSum.java            | 44 ++++++++++++++++
 src/hackerRank/StrangeAttendanceSystemHE.java | 35 +++++++++++++
 4 files changed, 164 insertions(+)
 create mode 100644 src/hackerRank/AddTwoNumbers.java
 create mode 100644 src/hackerRank/DiamondProblemHE.java
 create mode 100644 src/hackerRank/MaxCircularSum.java
 create mode 100644 src/hackerRank/StrangeAttendanceSystemHE.java

diff --git a/src/hackerRank/AddTwoNumbers.java b/src/hackerRank/AddTwoNumbers.java
new file mode 100644
index 0000000..79a47b1
--- /dev/null
+++ b/src/hackerRank/AddTwoNumbers.java
@@ -0,0 +1,52 @@
+package hackerRank;
+
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Scanner;
+
+
+class Node{
+	int data;
+	Node next;
+	
+	public Node(int d) {
+		data = d;
+		next = null;
+	}
+}
+
+
+public class AddTwoNumbers {
+	static Node head;
+	public static void push(int new_data){
+		Node newData = new Node(new_data);
+		newData.next = head;
+		head = newData;
+	}
+	
+	
+	public static void getCount(){
+		Node temp = head;
+		while(temp != null){
+			System.out.println(temp.data);
+			temp = temp.next;
+		}
+	}
+
+	public static void main(String[] args) {
+		List<Integer> first = new LinkedList<>();
+		List<Integer> second = new LinkedList<>();
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		
+		int len = in.nextInt();
+		for(int i=0;i<len;i++){
+			push(in.nextInt());
+		}
+		getCount();
+		
+		
+
+	}
+
+}
diff --git a/src/hackerRank/DiamondProblemHE.java b/src/hackerRank/DiamondProblemHE.java
new file mode 100644
index 0000000..ce09fe2
--- /dev/null
+++ b/src/hackerRank/DiamondProblemHE.java
@@ -0,0 +1,33 @@
+package hackerRank;
+
+import java.util.Scanner;
+
+public class DiamondProblemHE {
+		  static Scanner sc = new Scanner(System.in);
+			public static void main(String[] args) {
+				int tc = sc.nextInt();
+				while(tc-->0){
+					long height = sc.nextLong();
+					long width = sc.nextLong();
+					long ia = height*width;
+					long total = 0;
+					total += (height/4)*(width/2);
+					if(width%2==0){
+						if(height%4 ==0 || height%4==1){
+							total += ((height/4 )-1)*((width-2)/2);
+						}else{
+							total += ((height/4))*((width-2)/2);
+						}
+					}else{
+						if(height%4 ==0 || height%4==1){
+							total += ((height/4 )-1)*((width-1)/2);
+						}else{
+							total += ((height/4))*((width-1)/2);
+						}
+					}
+					System.out.println(ia-(total*4));
+		 
+				}
+			}
+		 
+		}
\ No newline at end of file
diff --git a/src/hackerRank/MaxCircularSum.java b/src/hackerRank/MaxCircularSum.java
new file mode 100644
index 0000000..db078a8
--- /dev/null
+++ b/src/hackerRank/MaxCircularSum.java
@@ -0,0 +1,44 @@
+package hackerRank;
+
+import java.util.Scanner; 
+  
+public class MaxCircularSum {
+static int smallestSumSubarr(int arr[], int n) 
+{ 
+    int min_ending_here = 0; 
+      
+
+    int min_so_far = 2147483647; 
+    
+    for (int i = 0; i < n/2; i++) 
+    { 
+         
+        if (min_ending_here > 0) 
+            min_ending_here = arr[i]; 
+          
+ 
+        else
+            min_ending_here += arr[i]; 
+  
+        min_so_far = Math.min(min_so_far, 
+                               min_ending_here);          
+    } 
+     
+    return min_so_far; 
+} 
+  
+// Driver method 
+public static void main(String[] args) 
+{ 
+      
+   Scanner in = new Scanner(System.in);
+   int n = in.nextInt();
+   int arr[] = new int[n];
+   
+   for(int i=0;i<n;i++){
+	   arr[i] = in.nextInt();
+   }
+    System.out.print("Smallest sum: "
+            + smallestSumSubarr(arr, n)); 
+} 
+} 
\ No newline at end of file
diff --git a/src/hackerRank/StrangeAttendanceSystemHE.java b/src/hackerRank/StrangeAttendanceSystemHE.java
new file mode 100644
index 0000000..ecb690b
--- /dev/null
+++ b/src/hackerRank/StrangeAttendanceSystemHE.java
@@ -0,0 +1,35 @@
+package hackerRank;
+
+import java.util.Scanner;
+
+public class StrangeAttendanceSystemHE {
+	
+	
+	public static int calculate(int classesH, int classesA){
+		int result = 0;
+		double r = (double)1/classesH;
+		double res1 = classesA * r;
+		double perc = res1 * 100;
+		if(perc > 75){
+			return 0;
+		}
+		else{
+			return (int)Math.abs((classesH*3-classesA*4));
+		}
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int testcases = in.nextInt();
+		
+		for(int i=0;i<testcases;i++){
+			int classesHeld = in.nextInt();
+			int classesAttended = in.nextInt();
+			
+			System.out.println(calculate(classesHeld,classesAttended));
+		}
+
+	}
+
+}

From 43f19e1af2c0138bd99da3c598fc11a732ffef2b Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Sat, 27 Oct 2018 13:35:28 -0500
Subject: [PATCH 08/35] HE october circuit

---
 src/hackerRank/TotalCostOCT18HE.java | 57 ++++++++++++++++++++++++++++
 1 file changed, 57 insertions(+)
 create mode 100644 src/hackerRank/TotalCostOCT18HE.java

diff --git a/src/hackerRank/TotalCostOCT18HE.java b/src/hackerRank/TotalCostOCT18HE.java
new file mode 100644
index 0000000..87bf9a8
--- /dev/null
+++ b/src/hackerRank/TotalCostOCT18HE.java
@@ -0,0 +1,57 @@
+/*A family consists of x members. You are given the task to book flight tickets for these x members.
+You are given the following information about the airline in which you have to book the tickets:
+
+initial cost : 6000 
+Available seats : 10 
+min seats for low price : 5 
+Hiked price : 6500 
+seats to book : 7
+
+Monk books 5 tickets for price 6000 each and rest 2 for price 6500 each.
+Total expenditure = 6000*5+6500*2 = 43000
+
+
+*/
+
+
+
+
+package hackerRank;
+
+import java.util.Scanner;
+
+public class TotalCostOCT18HE {
+	
+	
+	public static void calculate(int iniCost,int availSeats,int minSeatsForLowCost,int hikedCost,int noOfTickets){
+		int expenditure = 0;
+		for(int i=noOfTickets;i>=1;i--){
+			if(minSeatsForLowCost >= availSeats){
+				expenditure = expenditure+hikedCost;
+				noOfTickets--;
+				availSeats--;
+			}
+			else{
+			expenditure = expenditure+iniCost;
+			noOfTickets--;
+			availSeats--;
+			}
+		}
+		
+		System.out.println(expenditure);
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int iniCost = in.nextInt();
+		int availSeats = in.nextInt();
+		int minSeatsForLowCost = in.nextInt();
+		int hikedCost = in.nextInt();
+		int noOfTickets = in.nextInt();
+		
+		calculate(iniCost,availSeats,minSeatsForLowCost,hikedCost,noOfTickets);
+
+	}
+
+}

From 2efdef68791e5792274ac65d136814756677a8b1 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Sun, 28 Oct 2018 22:47:36 -0500
Subject: [PATCH 09/35] HE OCT18

---
 src/hackerRank/QuestionPaperOCT18HE.java     | 39 ++++++++++++
 src/hackerRank/ReversingElementsOCT18HE.java | 63 ++++++++++++++++++++
 2 files changed, 102 insertions(+)
 create mode 100644 src/hackerRank/QuestionPaperOCT18HE.java
 create mode 100644 src/hackerRank/ReversingElementsOCT18HE.java

diff --git a/src/hackerRank/QuestionPaperOCT18HE.java b/src/hackerRank/QuestionPaperOCT18HE.java
new file mode 100644
index 0000000..fb65472
--- /dev/null
+++ b/src/hackerRank/QuestionPaperOCT18HE.java
@@ -0,0 +1,39 @@
+package hackerRank;
+
+import java.util.HashSet;
+import java.util.Scanner;
+import java.util.Set;
+
+public class QuestionPaperOCT18HE {
+	
+	public static void calculate(int noOfQues,int corrMark,int wrongMarks){
+		Set<Integer> marks = new HashSet<>();
+		int corrcTot = 0;
+		int wrongTotal = 0;
+		marks.add(0);
+		for(int i=0;i<noOfQues;i++){
+			corrcTot += corrMark;
+			wrongTotal += (-wrongMarks);
+			marks.add(corrcTot);
+			marks.add(wrongTotal);
+		}
+		
+		System.out.println(marks);
+		System.out.println(marks.size());
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int testCases = in.nextInt();
+		
+		for(int i=0;i<testCases;i++){
+		int noOfQues = in.nextInt();
+		int corrMark = in.nextInt();
+		int wrongMarks = in.nextInt();
+		
+		calculate(noOfQues,corrMark,wrongMarks);
+		}
+	}
+
+}
diff --git a/src/hackerRank/ReversingElementsOCT18HE.java b/src/hackerRank/ReversingElementsOCT18HE.java
new file mode 100644
index 0000000..3153d35
--- /dev/null
+++ b/src/hackerRank/ReversingElementsOCT18HE.java
@@ -0,0 +1,63 @@
+package hackerRank;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.Scanner;
+
+public class ReversingElementsOCT18HE {
+	
+	
+	public static void reverseArray(int l,int r,int[] arr){
+//		for(int i=l;i<r;i++){
+//			int temp = arr[i];
+//			arr[i] = arr[r];
+//			arr[r] = temp;
+//		}
+		
+		
+		arr[l] = (arr[l] + arr[r]) - (arr[r] = arr[l]);
+		System.out.println(maxSumSubarray(arr));
+		for(int i=0;i<arr.length;i++){
+			System.out.print(arr[i]);
+		}
+	}
+	
+	
+	public static int maxSumSubarray(int arr[]){
+		int max_so_far = arr[0];
+		int max_ending_here = 0;
+		int n = arr.length;
+		
+		for(int i=0;i<n;i++){
+			max_ending_here = max_ending_here + arr[i];
+			if(max_so_far < max_ending_here){
+				max_so_far = max_ending_here;
+			}
+			if(max_ending_here < 0){
+				max_ending_here = 0;
+			}
+		}
+		return max_so_far;
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int sizeOfArray = in.nextInt();
+		int queries = in.nextInt();
+		int[] arr = new int[sizeOfArray];
+		for(int i=0;i<sizeOfArray;i++){
+			arr[i] = in.nextInt();
+		}
+		
+		for(int i=0;i<queries;i++){
+			int l = in.nextInt();
+			int r = in.nextInt();
+			reverseArray(l-1,r-1,arr);
+		}
+		in.close();
+
+	}
+
+}

From 618b8abf8aecdef82ef90c37e2bac33ebb7428d3 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Tue, 30 Oct 2018 22:00:55 -0500
Subject: [PATCH 10/35] Codes

---
 src/test.java | 176 +++++++++++++++++++++++++++++++++++++++-----------
 1 file changed, 138 insertions(+), 38 deletions(-)

diff --git a/src/test.java b/src/test.java
index 48b5948..d525ef9 100644
--- a/src/test.java
+++ b/src/test.java
@@ -1,39 +1,139 @@
-public class test{
-	
-	static int insertInSortedArr(int arr[],int n,int key, int capacity){
-		if(n >= capacity){
-			return n;
-		}
-		int i;
-		for(i=n-1; (i>0 && arr[i] > key); i--)
-			arr[i+1] = arr[i];
-		
-		arr[i+1] = key;
-		return (n+1);
-	}
-	
-	static void view(int arr[]){
-		for(int i=0;i<arr.length;i++){
-			System.out.println(arr[i]);
-		}
-	}
-	
-	
-	
-	
-	public static void main(String args[]){
-		int arr[] = new int[20];
-		arr[0] = 10;
-		arr[1] = 12;
-		arr[2] = 14;
-		arr[3] = 20;
-		arr[4] = 40;
-		arr[5] = 70;
-		
-		int capacity = arr.length;
-		int key = 26;
-		int n =6;
-		System.out.println(insertInSortedArr(arr,n,key,capacity));
-		view(arr);	
-	}
+import java.util.Scanner;
+
+import java.util.Random;
+
+public class test
+
+{
+
+public static void main(String [] args)
+
+{
+
+Scanner in = new Scanner(System.in);
+
+Random random = new Random();
+
+int choice;
+
+int passLength;
+
+int num1 = 0;
+
+char character;
+
+String password = "";
+
+System.out.println(" Password Generation Menu ");
+
+System.out.println("*****************************************************************************");
+
+System.out.println("* [1] Lowercase Letters *");
+
+System.out.println("* [2] Lowercase Letters & Uppercase Letters *");
+
+System.out.println("* [3] Lowercase Letters, Uppercase Letters, and Numbers *");
+
+System.out.println("* [4] All keyboard symbols *");
+
+System.out.println("* [5] Quit *");
+
+System.out.println("*****************************************************************************");
+
+System.out.print("\n\nEnter choice (1-5): ");
+
+choice = in.nextInt();
+
+System.out.print("Password Length (1-14): ");
+
+passLength = in.nextInt();
+
+while(password.length() < passLength)
+
+{
+
+if(choice == 1){
+
+num1 = random.nextInt(122-97) + 97;
+
+character = (char)num1;
+
+String charString = Character.toString(character);
+
+password += charString;
+
+}
+
+else if(choice == 2){
+
+num1 = random.nextInt(122-65) + 65;
+
+if((num1 > 97 && num1 < 122) || (num1 > 65 && num1 < 90))
+
+{
+
+character = (char)num1;
+
+String charString = Character.toString(character);
+
+password += charString;
+
+}
+
+}
+
+else if(choice == 3)
+
+{
+
+num1 = random.nextInt(122-48) + 48;
+
+if((num1 < 57) || (num1 > 65 && num1 < 90) || (num1 > 97 && num1 < 122))
+
+{
+
+character = (char)num1;
+
+String charString = Character.toString(character);
+
+password += charString;
+
+}
+
+else if(choice == 4)
+
+{
+
+num1 = random.nextInt(126-33) + 33;
+
+if(num1 > 33 || num1 < 126)
+
+{
+
+character = (char)num1;
+
+String charString = Character.toString(character);
+
+password += charString;
+
+}
+
+else
+
+{
+
+System.out.println("Good bye! Thank you for visiting!");
+
+}
+
+System.out.print("\nPassword: " + password);
+
+}
+
+}
+
+}
+
+}
+
 }
\ No newline at end of file

From 9107dfc0c3baf9fbb9e2df6b044f87ec022a81a9 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Tue, 30 Oct 2018 22:01:34 -0500
Subject: [PATCH 11/35] Codes CareerCup

---
 src/hackerRank/appendArrayCC.java | 30 ++++++++++++++++++++++++++++++
 src/hackerRank/localMimArray.java | 10 ++++++++++
 2 files changed, 40 insertions(+)
 create mode 100644 src/hackerRank/appendArrayCC.java
 create mode 100644 src/hackerRank/localMimArray.java

diff --git a/src/hackerRank/appendArrayCC.java b/src/hackerRank/appendArrayCC.java
new file mode 100644
index 0000000..308248f
--- /dev/null
+++ b/src/hackerRank/appendArrayCC.java
@@ -0,0 +1,30 @@
+package hackerRank;
+
+public class appendArrayCC {
+	
+	public static void append(int arr[],String arr1[]){
+		String arr2[] = new String[arr.length];
+		
+		
+		if(arr.length == arr1.length){
+		for(int i=0;i<arr.length;i++){
+			arr2[i] = arr[i]+arr1[i] + ",";
+		}
+	}
+		
+		for(int i=0;i<arr.length;i++){
+			System.out.print(arr2[i]);
+		}
+		
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		int arr[] = {1,2,3};
+		String arr1[] = {"a","b","c"};
+		
+		append(arr,arr1);
+
+	}
+
+}
diff --git a/src/hackerRank/localMimArray.java b/src/hackerRank/localMimArray.java
new file mode 100644
index 0000000..6569558
--- /dev/null
+++ b/src/hackerRank/localMimArray.java
@@ -0,0 +1,10 @@
+package hackerRank;
+
+public class localMimArray {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+
+	}
+
+}

From d46af310882009fd86c0d64385a91c6f5fba71db Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Wed, 31 Oct 2018 22:27:10 -0500
Subject: [PATCH 12/35] Longest String_3LC

---
 src/hackerRank/longestSubString.java | 37 ++++++++++++++++++++++++++++
 1 file changed, 37 insertions(+)
 create mode 100644 src/hackerRank/longestSubString.java

diff --git a/src/hackerRank/longestSubString.java b/src/hackerRank/longestSubString.java
new file mode 100644
index 0000000..661d87b
--- /dev/null
+++ b/src/hackerRank/longestSubString.java
@@ -0,0 +1,37 @@
+package hackerRank;
+
+import java.util.LinkedHashMap;
+import java.util.Scanner;
+
+public class longestSubString {
+	
+ public static int lengthOfLongestSubstring(String s) {
+        int length = 0;
+        LinkedHashMap<Character,Integer> chaPos = new LinkedHashMap<>();
+        for(int i=0;i<s.length();i++){
+        	char curr = s.charAt(i);
+        	if(!chaPos.containsKey(curr)){
+        		chaPos.put(curr, i);
+        	}
+        	else{
+        		i = chaPos.get(curr);
+        		chaPos.clear();
+        	}
+        	
+        	if(chaPos.size() > length){
+        		length = chaPos.size();
+        	}
+        }
+        
+        return length;
+    }
+	
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		String s = in.next();
+		System.out.println(lengthOfLongestSubstring(s));
+	}
+
+}

From bbe79e04f2ed84eede177382782d07009377d2b4 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Wed, 31 Oct 2018 22:28:21 -0500
Subject: [PATCH 13/35] Longest String added question

---
 src/hackerRank/longestSubString.java | 8 ++++++++
 1 file changed, 8 insertions(+)

diff --git a/src/hackerRank/longestSubString.java b/src/hackerRank/longestSubString.java
index 661d87b..1796d28 100644
--- a/src/hackerRank/longestSubString.java
+++ b/src/hackerRank/longestSubString.java
@@ -1,3 +1,11 @@
+/*Input: "abcabcbb"
+Output: 3 
+Explanation: The answer is "abc", with the length of 3.*/
+
+
+
+
+
 package hackerRank;
 
 import java.util.LinkedHashMap;

From 8f5058a3733bc298b171a0bc3c9ab00f6fc4293d Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Thu, 1 Nov 2018 19:06:17 -0500
Subject: [PATCH 14/35] Container with Most Water LC

---
 src/hackerRank/ContainerWithMostWaterLC.java | 46 ++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 src/hackerRank/ContainerWithMostWaterLC.java

diff --git a/src/hackerRank/ContainerWithMostWaterLC.java b/src/hackerRank/ContainerWithMostWaterLC.java
new file mode 100644
index 0000000..4bbd284
--- /dev/null
+++ b/src/hackerRank/ContainerWithMostWaterLC.java
@@ -0,0 +1,46 @@
+/*
+ * Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai).
+ * n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0).
+ * Find two lines, which together with x-axis forms a container, such that the container contains the most water.
+ */
+
+
+
+package hackerRank;
+
+import java.util.Scanner;
+
+public class ContainerWithMostWaterLC {
+	
+	
+	public static int calculateArea(int arr[]){
+		int area = 0;
+		int left = 0;
+		int right = arr.length -1;
+		
+		while(left < right){
+		area = Math.max(area,(right - left) * Math.min(arr[left], arr[right]));
+		if(arr[left] < arr[right])
+			left++;
+		else{
+		right--;
+		}
+	}
+		
+		return area;
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int n = in.nextInt();
+		
+		int arr[] = new int[n];
+		for(int i=0;i<n;i++){
+			arr[i] = in.nextInt();
+		}
+		
+		System.out.println(calculateArea(arr));
+	}
+
+}

From 93df2a8749d5a89c5a948ceec45fd644c3fee8f8 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Thu, 1 Nov 2018 19:12:06 -0500
Subject: [PATCH 15/35] Container with Most Water LC

---
 src/hackerRank/ContainerWithMostWaterLC.java | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/hackerRank/ContainerWithMostWaterLC.java b/src/hackerRank/ContainerWithMostWaterLC.java
index 4bbd284..492b04d 100644
--- a/src/hackerRank/ContainerWithMostWaterLC.java
+++ b/src/hackerRank/ContainerWithMostWaterLC.java
@@ -2,6 +2,10 @@
  * Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai).
  * n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0).
  * Find two lines, which together with x-axis forms a container, such that the container contains the most water.
+ 
+ *
+ *Input: [1,8,6,2,5,4,8,3,7]
+Output: 49
  */
 
 

From f76603eddd0ecd452dc79185db258ca615f7b1ea Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Mon, 5 Nov 2018 21:40:18 -0600
Subject: [PATCH 16/35] Hack2Hire Easy Queries

---
 src/hackerRank/EasyQueriesHE.java | 62 +++++++++++++++++++++++++++++++
 1 file changed, 62 insertions(+)
 create mode 100644 src/hackerRank/EasyQueriesHE.java

diff --git a/src/hackerRank/EasyQueriesHE.java b/src/hackerRank/EasyQueriesHE.java
new file mode 100644
index 0000000..818d9d8
--- /dev/null
+++ b/src/hackerRank/EasyQueriesHE.java
@@ -0,0 +1,62 @@
+package hackerRank;
+
+/*
+ * You are given an empty list A and Q queries. Each query is one of the following:
+ * 1) 1 X Y: add element X to the list Y times
+ * 2) 2 N : find the Nth element in list A
+ * 
+ * 
+ * 
+ *Input:
+ *4
+ *1 5 5
+ *1 3 6
+ *2 7 -----> Output : 5
+ *2 6 -----> Output : 3
+ * 
+ * */
+
+
+
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.List;
+import java.util.Scanner;
+
+public class EasyQueriesHE {
+	static Scanner in = new Scanner(System.in);
+	
+	public static void addEle(int ini,List<Integer> ll){
+		
+		if(ini == 1){
+			int ele = in.nextInt();
+			int noOfTimes = in.nextInt();
+			
+			for(int i=0;i<noOfTimes;i++){
+				ll.add(ele);
+			}
+		}else{
+			if(ini == 2){
+				int index =in.nextInt();
+				Collections.sort(ll);
+				int a = ll.get(index-1);
+				System.out.println(a);
+			}
+		}
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		List<Integer> ll = new ArrayList<>();
+		int queries = in.nextInt();
+		
+		for(int i=0;i<queries;i++){
+		int ini = in.nextInt();
+		
+		addEle(ini,ll);
+		}
+
+	}
+
+}

From 593e48d7c6f630bd00e98c8549a6e28bd60b9f2e Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Thu, 8 Nov 2018 17:53:30 -0600
Subject: [PATCH 17/35] Unique email Address LC

---
 src/hackerRank/UniqueEmailAddress.java | 54 ++++++++++++++++++++++++++
 1 file changed, 54 insertions(+)
 create mode 100644 src/hackerRank/UniqueEmailAddress.java

diff --git a/src/hackerRank/UniqueEmailAddress.java b/src/hackerRank/UniqueEmailAddress.java
new file mode 100644
index 0000000..593237a
--- /dev/null
+++ b/src/hackerRank/UniqueEmailAddress.java
@@ -0,0 +1,54 @@
+package hackerRank;
+
+
+/*
+ * Besides lowercase letters, these emails may contain '.'s or '+'s.
+ * Discard everything after the + sign and do not consider .
+ * "alice.z@leetcode.com" and "alicez@leetcode.com" forward to the same email address.  
+ * 
+ * Given a list of emails, we send one email to each address in the list.
+ * How many different addresses actually receive mails? 
+ * 
+ */
+
+
+import java.util.HashSet;
+import java.util.Scanner;
+import java.util.Set;
+
+public class UniqueEmailAddress {
+	
+	
+	public static int check(String[] emails){
+		Set<String> res = new HashSet<>();
+		for (String email : emails) {
+            String localName = email.split("@")[0];
+            String domainName = email.split("@")[1];
+
+            localName = localName.replace(".", "");
+            int index = localName.indexOf('+');
+            if (index != -1) {
+                localName = localName.substring(0, index);
+            }
+
+            res.add(localName+"@"+domainName);
+        }
+
+        return res.size();
+    }
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int n = in.nextInt();
+		String emails[] = new String[n];
+		
+		for(int i=0;i<n;i++){
+			emails[i] = in.next();
+		}
+		
+		System.out.println(check(emails));
+		in.close();
+	}
+
+}

From 66965e54e8571ac8006d2eb2e2ab4e02e3fda1f8 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Thu, 8 Nov 2018 21:39:08 -0600
Subject: [PATCH 18/35] To Lower Case LC

---
 src/hackerRank/ToLowerCase.java | 32 ++++++++++++++++++++++++++++++++
 1 file changed, 32 insertions(+)
 create mode 100644 src/hackerRank/ToLowerCase.java

diff --git a/src/hackerRank/ToLowerCase.java b/src/hackerRank/ToLowerCase.java
new file mode 100644
index 0000000..dbb2ebc
--- /dev/null
+++ b/src/hackerRank/ToLowerCase.java
@@ -0,0 +1,32 @@
+package hackerRank;
+
+/*
+ * Implement function that has a string parameter str, 
+ * and returns the same string in lowercase.
+ */
+
+
+import java.util.Scanner;
+
+public class ToLowerCase {
+	
+	//can be done using ascii values too
+	//convert the string character to char compare it to the 
+	//ascii value of equivalent alphabet and add 32 to it.
+	
+	private static String convert(String UC){
+		String LC = "";
+		LC = UC.toLowerCase();
+		return LC;
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		String UC = in.next();
+		
+		System.out.println(convert(UC));
+
+	}
+
+}

From 2edfa85f8ea0ea8ee3ffa50967828d319d43631e Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Thu, 8 Nov 2018 22:59:46 -0600
Subject: [PATCH 19/35] Unique Morse Code Words LC

---
 src/hackerRank/UniqueMorseCodeWords.java | 70 ++++++++++++++++++++++++
 1 file changed, 70 insertions(+)
 create mode 100644 src/hackerRank/UniqueMorseCodeWords.java

diff --git a/src/hackerRank/UniqueMorseCodeWords.java b/src/hackerRank/UniqueMorseCodeWords.java
new file mode 100644
index 0000000..f2b07ff
--- /dev/null
+++ b/src/hackerRank/UniqueMorseCodeWords.java
@@ -0,0 +1,70 @@
+package hackerRank;
+
+/*
+ * 
+ * 
+ * Example:
+Input: words = ["gin", "zen", "gig", "msg"]
+Output: 2
+Explanation: 
+The transformation of each word is:
+"gin" -> "--...-."
+"zen" -> "--...-."
+"gig" -> "--...--."
+"msg" -> "--...--."
+
+There are 2 different transformations, "--...-." and "--...--.".
+
+ */
+
+
+
+
+import java.util.ArrayList;
+import java.util.HashSet;
+import java.util.Scanner;
+import java.util.Set;
+
+public class UniqueMorseCodeWords {
+	
+	static String[] dictionary  = {".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","--","-.","---",".--.","--.-",".-.","...","-","..-","...-",".--","-..-","-.--","--.."};
+
+	
+	private static int uniqueMorseRepresentations(String[] words){
+		Set<String> morseValues = new HashSet<>();
+		
+		for(String word : words){
+			morseValues.add(morseCodeRep(word));
+		}
+		
+		return morseValues.size();
+		
+	}
+	
+	
+	public static String morseCodeRep(String word){
+		StringBuilder representation = new StringBuilder();
+		for(int i=0;i<word.length();i++){
+			char c = word.charAt(i);
+			representation.append(dictionary[c - 'a']);
+		}
+		return representation.toString();
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		ArrayList<String> al = new ArrayList<>();
+		for (String line = in.nextLine(); !line.isEmpty(); line = in.nextLine())
+			{
+	            al.add(line);
+	        }
+		
+	        String [] words = new String[al.size()];
+	        for(int i=0;i<al.size();i++){
+	            words[i]=al.get(i);
+	    }
+	    System.out.println(uniqueMorseRepresentations(words));
+	}
+
+}

From 56e32f3a6cc563a8d520e7c074949d6928b60367 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Fri, 9 Nov 2018 11:49:38 -0600
Subject: [PATCH 20/35] Sort Array By parity LC

---
 src/hackerRank/SortArrayByParity.java | 46 +++++++++++++++++++++++++++
 1 file changed, 46 insertions(+)
 create mode 100644 src/hackerRank/SortArrayByParity.java

diff --git a/src/hackerRank/SortArrayByParity.java b/src/hackerRank/SortArrayByParity.java
new file mode 100644
index 0000000..d20ff8e
--- /dev/null
+++ b/src/hackerRank/SortArrayByParity.java
@@ -0,0 +1,46 @@
+package hackerRank;
+
+/*
+ * Given an array A of non-negative integers,
+ * return an array consisting of all the even elements of A, followed by all the odd elements of A.
+ * 
+ * Input: [3,1,2,4]
+ * Output: [2,4,3,1]
+ */
+
+
+
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class SortArrayByParity {
+	
+	public static void doThemagic(int arr[]){
+		for(int i=0,j=0;j<arr.length;j++){
+			if(arr[j] % 2 == 0){
+				int temp = arr[i];
+				arr[i++] = arr[j];
+				arr[j] = temp;
+				
+			}
+		}
+		for(int i=0;i<arr.length;i++){
+			System.out.println(arr[i]);
+		}
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		int n = in.nextInt();
+		int arr[] = new int[n];
+		
+		for(int i=0;i<n;i++){
+			arr[i] = in.nextInt();
+		}
+		
+		doThemagic(arr);
+
+	}
+
+}

From 76c8e3924cc269fc34aa2ec195bc72fe6d505b62 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Sat, 10 Nov 2018 21:29:24 -0600
Subject: [PATCH 21/35] Robot return to origin LC

---
 src/hackerRank/RobotReturnToOrigin.java | 58 +++++++++++++++++++++++++
 1 file changed, 58 insertions(+)
 create mode 100644 src/hackerRank/RobotReturnToOrigin.java

diff --git a/src/hackerRank/RobotReturnToOrigin.java b/src/hackerRank/RobotReturnToOrigin.java
new file mode 100644
index 0000000..67bea85
--- /dev/null
+++ b/src/hackerRank/RobotReturnToOrigin.java
@@ -0,0 +1,58 @@
+package hackerRank;
+
+/*
+ * Input: "UD"
+Output: true 
+
+Explanation: The robot moves up once, and then down once.
+All moves have the same magnitude, so it ended up at the origin where it started.
+Therefore, we return true.
+ * 
+ * 
+ * 
+ */
+
+
+import java.util.Scanner;
+
+public class RobotReturnToOrigin {
+	
+	public static boolean whereIsRobot(String moves){
+		int PositiveMoves = 0;
+		int NegativeMoves = 0;
+		
+		for(int i=0;i<moves.length();i++){
+			char c = moves.charAt(i);
+			
+			switch(c){
+			
+			case 'U' : 
+				NegativeMoves++;
+				break;
+			case 'D' :
+				NegativeMoves--;
+				break;
+			case 'R' : 
+				PositiveMoves++;
+				break;
+			case 'L' :
+				PositiveMoves--;
+				break;
+				
+				default:
+					break;
+			}
+		}
+		
+		return PositiveMoves == 0 && NegativeMoves == 0 ? true :false;
+	}
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		Scanner in = new Scanner(System.in);
+		
+		String moves = in.nextLine();
+		System.out.println(whereIsRobot(moves));
+	}
+
+}

From e9e2c3bf227d1849ffdf32098415cd318573e339 Mon Sep 17 00:00:00 2001
From: sam1502 <sameer.neema02@gmail.com>
Date: Tue, 13 Nov 2018 19:48:35 -0600
Subject: [PATCH 22/35] Pros and Cons LC

---
 src/hackerRank/ProsAndConsLC.java | 78 +++++++++++++++++++++++++++++++
 1 file changed, 78 insertions(+)
 create mode 100644 src/hackerRank/ProsAndConsLC.java

diff --git a/src/hackerRank/ProsAndConsLC.java b/src/hackerRank/ProsAndConsLC.java
new file mode 100644
index 0000000..4c8c2ed
--- /dev/null
+++ b/src/hackerRank/ProsAndConsLC.java
@@ -0,0 +1,78 @@
+package hackerRank;
+
+/*
+ * Ted: Robin, get me my legal pad. It's Pros and Cons Time!
+
+There is a long list of n girls in front of Barney, and he is to calculate the optimal "happiness" he can find by selecting exactly 2 girls. (Why 2? No one knows!)
+
+Ted, as a fan of pros and cons, suggests to make a list, a method for estimating the maximum happiness that Barney can achieve.
+
+Each girl is characterized by two parameters:
+
+- favour: if this girl is chosen, his happiness increases by this amount. 
+- anger: if this girl is not chosen, his happiness decreases by this amount.
+
+Find the maximum "happiness" that Barney can obtain. Note that the answer is allowed to be negative.
+
+Input:
+The first line of input file contains an integer t, denoting the number of test cases to follow.
+
+The first line of each test case contains an integer n, as explained in statement. It is followed by n lines, each containing two space-seperated integers denoting the favour and anger of the ith girl.
+ * 
+ * 
+ * 
+
+ * Input:
+1
+4
+2 3
+10 2
+11 5
+4 1
+
+
+
+output :17
+ */
+
+
+import java.util.*;
+
+class ProsAndConsLC {
+   public static void main(String args[] ) throws Exception {
+        
+        Scanner s=new Scanner(System.in);
+		
+		//System.out.println("enter t");
+		int t=s.nextInt();
+		for(int i=0; i<t; i++)
+		{
+			int n=s.nextInt();
+			long[] happy=new long[n];
+			long x,y;
+			long sum=0;
+			for(int j=0; j<n; j++)
+			{
+				x=s.nextLong();
+				y=s.nextLong();
+				happy[j]=x+y;
+				sum+=y;
+			}
+			
+		    long max1=Long.MIN_VALUE,max2=Long.MIN_VALUE;
+            for(int j=0; j<n; j++)
+            {
+            	if(happy[j] > max1)
+            	{
+            		max2=max1;
+            		max1=happy[j];
+            	}
+            	else if(happy[j] < max1 && happy[j] > max2)
+            		max2=happy[j];
+            }
+			
+            System.out.println(max1+max2-sum);
+		}
+        
+    }
+}
\ No newline at end of file

From a0c687c440441777b66dc17b6770e212b13a7b35 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Sat, 11 May 2019 23:56:24 -0400
Subject: [PATCH 23/35] updated

---
 .idea/misc.xml          |   6 +
 .idea/modules.xml       |   8 ++
 .idea/vcs.xml           |   6 +
 .idea/workspace.xml     | 258 ++++++++++++++++++++++++++++++++++++++++
 Java-Practice.iml       |  13 ++
 src/Consecutive1TF.java |  30 +++++
 src/test.java           | 139 ----------------------
 src/test1.java          |  46 -------
 8 files changed, 321 insertions(+), 185 deletions(-)
 create mode 100644 .idea/misc.xml
 create mode 100644 .idea/modules.xml
 create mode 100644 .idea/vcs.xml
 create mode 100644 .idea/workspace.xml
 create mode 100644 Java-Practice.iml
 create mode 100644 src/Consecutive1TF.java
 delete mode 100644 src/test.java
 delete mode 100644 src/test1.java

diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 0000000..84da703
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" languageLevel="JDK_1_8" project-jdk-name="1.8" project-jdk-type="JavaSDK">
+    <output url="file://$PROJECT_DIR$/classes" />
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 0000000..003b7f0
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/Java-Practice.iml" filepath="$PROJECT_DIR$/Java-Practice.iml" />
+    </modules>
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 0000000..35eb1dd
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="" vcs="Git" />
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
new file mode 100644
index 0000000..b3e8c7e
--- /dev/null
+++ b/.idea/workspace.xml
@@ -0,0 +1,258 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ChangeListManager">
+    <list default="true" id="de1033a4-5b49-45d1-bc14-d2226c70eeb5" name="Default Changelist" comment="">
+      <change beforePath="$PROJECT_DIR$/Codes/StringRev_Stack.java" beforeDir="false" afterPath="$PROJECT_DIR$/Codes/StringRev_Stack.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/src/test.java" beforeDir="false" />
+      <change beforePath="$PROJECT_DIR$/src/test1.java" beforeDir="false" />
+    </list>
+    <ignored path="$PROJECT_DIR$/classes/" />
+    <ignored path="$PROJECT_DIR$/build/classes/" />
+    <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
+    <option name="SHOW_DIALOG" value="false" />
+    <option name="HIGHLIGHT_CONFLICTS" value="true" />
+    <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
+    <option name="LAST_RESOLUTION" value="IGNORE" />
+  </component>
+  <component name="DefaultGradleProjectSettings">
+    <option name="isMigrated" value="true" />
+  </component>
+  <component name="FileEditorManager">
+    <leaf>
+      <file pinned="false" current-in-tab="false">
+        <entry file="file://$PROJECT_DIR$/Codility/PairElements.java">
+          <provider selected="true" editor-type-id="text-editor">
+            <state relative-caret-position="600">
+              <caret line="40" selection-start-line="40" selection-end-line="40" />
+              <folding>
+                <element signature="imports" expanded="true" />
+              </folding>
+            </state>
+          </provider>
+        </entry>
+      </file>
+      <file pinned="false" current-in-tab="true">
+        <entry file="file://$PROJECT_DIR$/Codes/AnagramsHR.java">
+          <provider selected="true" editor-type-id="text-editor">
+            <state relative-caret-position="30">
+              <caret line="5" selection-start-line="5" selection-end-line="5" selection-end-column="19" />
+            </state>
+          </provider>
+        </entry>
+      </file>
+    </leaf>
+  </component>
+  <component name="FileTemplateManagerImpl">
+    <option name="RECENT_TEMPLATES">
+      <list>
+        <option value="Class" />
+      </list>
+    </option>
+  </component>
+  <component name="FindInProjectRecents">
+    <findStrings>
+      <find>anagrams</find>
+    </findStrings>
+  </component>
+  <component name="Git.Settings">
+    <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$" />
+  </component>
+  <component name="IdeDocumentHistory">
+    <option name="CHANGED_PATHS">
+      <list>
+        <option value="$PROJECT_DIR$/Codility/Consecutive1TF.java" />
+        <option value="$PROJECT_DIR$/src/Consecutive1TF.java" />
+      </list>
+    </option>
+  </component>
+  <component name="ProjectConfigurationFiles">
+    <option name="files">
+      <list>
+        <option value="$PROJECT_DIR$/Java-Practice.iml" />
+        <option value="$PROJECT_DIR$/.idea/misc.xml" />
+        <option value="$PROJECT_DIR$/.idea/vcs.xml" />
+        <option value="$PROJECT_DIR$/.idea/modules.xml" />
+      </list>
+    </option>
+  </component>
+  <component name="ProjectFrameBounds" fullScreen="true">
+    <option name="width" value="1680" />
+    <option name="height" value="1050" />
+  </component>
+  <component name="ProjectView">
+    <navigator proportions="" version="1">
+      <foldersAlwaysOnTop value="true" />
+    </navigator>
+    <panes>
+      <pane id="Scope" />
+      <pane id="ProjectPane">
+        <subPane>
+          <expand>
+            <path>
+              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
+              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
+            </path>
+            <path>
+              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
+              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
+              <item name="Codility" type="462c0819:PsiDirectoryNode" />
+            </path>
+            <path>
+              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
+              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
+              <item name="src" type="462c0819:PsiDirectoryNode" />
+            </path>
+          </expand>
+          <select />
+        </subPane>
+      </pane>
+      <pane id="PackagesPane" />
+    </panes>
+  </component>
+  <component name="PropertiesComponent">
+    <property name="last_opened_file_path" value="$PROJECT_DIR$" />
+  </component>
+  <component name="RunDashboard">
+    <option name="ruleStates">
+      <list>
+        <RuleState>
+          <option name="name" value="ConfigurationTypeDashboardGroupingRule" />
+        </RuleState>
+        <RuleState>
+          <option name="name" value="StatusDashboardGroupingRule" />
+        </RuleState>
+      </list>
+    </option>
+  </component>
+  <component name="RunManager">
+    <configuration name="AnagramsHR" type="Application" factoryName="Application" temporary="true" nameIsGenerated="true">
+      <option name="MAIN_CLASS_NAME" value="AnagramsHR" />
+      <module name="Java-Practice" />
+      <method v="2">
+        <option name="Make" enabled="true" />
+      </method>
+    </configuration>
+    <recent_temporary>
+      <list>
+        <item itemvalue="Application.AnagramsHR" />
+      </list>
+    </recent_temporary>
+  </component>
+  <component name="SvnConfiguration">
+    <configuration />
+  </component>
+  <component name="TaskManager">
+    <task active="true" id="Default" summary="Default task">
+      <changelist id="de1033a4-5b49-45d1-bc14-d2226c70eeb5" name="Default Changelist" comment="" />
+      <created>1557599443037</created>
+      <option name="number" value="Default" />
+      <option name="presentableId" value="Default" />
+      <updated>1557599443037</updated>
+    </task>
+    <servers />
+  </component>
+  <component name="ToolWindowManager">
+    <frame x="0" y="0" width="1680" height="1050" extended-state="6" />
+    <layout>
+      <window_info id="Image Layers" />
+      <window_info id="Designer" />
+      <window_info id="UI Designer" />
+      <window_info id="Capture Tool" />
+      <window_info id="Favorites" side_tool="true" />
+      <window_info content_ui="combo" id="Project" order="0" visible="true" weight="0.24969475" />
+      <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
+      <window_info anchor="bottom" id="Version Control" />
+      <window_info anchor="bottom" id="Terminal" />
+      <window_info anchor="bottom" id="Event Log" side_tool="true" />
+      <window_info anchor="bottom" id="Messages" weight="0.32959184" />
+      <window_info anchor="bottom" id="Message" order="0" />
+      <window_info anchor="bottom" id="Find" order="1" weight="0.32959184" />
+      <window_info anchor="bottom" id="Run" order="2" />
+      <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
+      <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
+      <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
+      <window_info anchor="bottom" id="TODO" order="6" />
+      <window_info anchor="right" id="Palette" />
+      <window_info anchor="right" id="Theme Preview" />
+      <window_info anchor="right" id="Maven" />
+      <window_info anchor="right" id="Capture Analysis" />
+      <window_info anchor="right" id="Palette&#9;" />
+      <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
+      <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
+      <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
+    </layout>
+  </component>
+  <component name="editorHistoryManager">
+    <entry file="file://$PROJECT_DIR$/Codility/Consecutive1TF">
+      <provider selected="true" editor-type-id="text-editor" />
+    </entry>
+    <entry file="file://$PROJECT_DIR$/src/ChainInspection.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="30">
+          <caret line="4" column="13" selection-start-line="4" selection-start-column="13" selection-end-line="4" selection-end-column="13" />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Codility/Consecutive1TF.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="30">
+          <caret line="2" column="4" selection-start-line="2" selection-start-column="4" selection-end-line="2" selection-end-column="4" />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/src/Consecutive1TF.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="135">
+          <caret line="9" selection-start-line="9" selection-end-line="9" />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Codility/PairElements.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="600">
+          <caret line="40" selection-start-line="40" selection-end-line="40" />
+          <folding>
+            <element signature="imports" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Codes/LinkedList_Recursive.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="287">
+          <caret line="22" column="35" selection-start-line="22" selection-start-column="35" selection-end-line="22" selection-end-column="35" />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Codes/Elements_LL.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="30">
+          <caret line="2" selection-start-line="2" selection-end-line="2" />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Codes/AnagramsHR.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="30">
+          <caret line="5" selection-start-line="5" selection-end-line="5" selection-end-column="19" />
+        </state>
+      </provider>
+    </entry>
+  </component>
+  <component name="masterDetails">
+    <states>
+      <state key="ProjectJDKs.UI">
+        <settings>
+          <last-edited>1.8</last-edited>
+          <splitter-proportions>
+            <option name="proportions">
+              <list>
+                <option value="0.2" />
+              </list>
+            </option>
+          </splitter-proportions>
+        </settings>
+      </state>
+    </states>
+  </component>
+</project>
\ No newline at end of file
diff --git a/Java-Practice.iml b/Java-Practice.iml
new file mode 100644
index 0000000..18b7f86
--- /dev/null
+++ b/Java-Practice.iml
@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <output url="file://$MODULE_DIR$/build/classes" />
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+      <sourceFolder url="file://$MODULE_DIR$/Codes" isTestSource="false" />
+    </content>
+    <orderEntry type="sourceFolder" forTests="false" />
+    <orderEntry type="inheritedJdk" />
+  </component>
+</module>
\ No newline at end of file
diff --git a/src/Consecutive1TF.java b/src/Consecutive1TF.java
new file mode 100644
index 0000000..f5275d2
--- /dev/null
+++ b/src/Consecutive1TF.java
@@ -0,0 +1,30 @@
+import java.util.Scanner;
+
+public class Consecutive1TF {
+
+
+    public static boolean checkAppearance(String[] arr) {
+        boolean result = false;
+
+        for(int i=0;i<arr.length;i++) {
+
+        }
+
+
+        return result;
+    }
+
+
+    public static void main(String[] args) {
+
+        Scanner in = new Scanner(System.in);
+
+        int a = in.nextInt();
+
+        String[] arr = new String[a];
+
+        for(int i=0;i<a;i++) arr[i] = in.next();
+
+        checkAppearance(arr);
+    }
+}
diff --git a/src/test.java b/src/test.java
deleted file mode 100644
index d525ef9..0000000
--- a/src/test.java
+++ /dev/null
@@ -1,139 +0,0 @@
-import java.util.Scanner;
-
-import java.util.Random;
-
-public class test
-
-{
-
-public static void main(String [] args)
-
-{
-
-Scanner in = new Scanner(System.in);
-
-Random random = new Random();
-
-int choice;
-
-int passLength;
-
-int num1 = 0;
-
-char character;
-
-String password = "";
-
-System.out.println(" Password Generation Menu ");
-
-System.out.println("*****************************************************************************");
-
-System.out.println("* [1] Lowercase Letters *");
-
-System.out.println("* [2] Lowercase Letters & Uppercase Letters *");
-
-System.out.println("* [3] Lowercase Letters, Uppercase Letters, and Numbers *");
-
-System.out.println("* [4] All keyboard symbols *");
-
-System.out.println("* [5] Quit *");
-
-System.out.println("*****************************************************************************");
-
-System.out.print("\n\nEnter choice (1-5): ");
-
-choice = in.nextInt();
-
-System.out.print("Password Length (1-14): ");
-
-passLength = in.nextInt();
-
-while(password.length() < passLength)
-
-{
-
-if(choice == 1){
-
-num1 = random.nextInt(122-97) + 97;
-
-character = (char)num1;
-
-String charString = Character.toString(character);
-
-password += charString;
-
-}
-
-else if(choice == 2){
-
-num1 = random.nextInt(122-65) + 65;
-
-if((num1 > 97 && num1 < 122) || (num1 > 65 && num1 < 90))
-
-{
-
-character = (char)num1;
-
-String charString = Character.toString(character);
-
-password += charString;
-
-}
-
-}
-
-else if(choice == 3)
-
-{
-
-num1 = random.nextInt(122-48) + 48;
-
-if((num1 < 57) || (num1 > 65 && num1 < 90) || (num1 > 97 && num1 < 122))
-
-{
-
-character = (char)num1;
-
-String charString = Character.toString(character);
-
-password += charString;
-
-}
-
-else if(choice == 4)
-
-{
-
-num1 = random.nextInt(126-33) + 33;
-
-if(num1 > 33 || num1 < 126)
-
-{
-
-character = (char)num1;
-
-String charString = Character.toString(character);
-
-password += charString;
-
-}
-
-else
-
-{
-
-System.out.println("Good bye! Thank you for visiting!");
-
-}
-
-System.out.print("\nPassword: " + password);
-
-}
-
-}
-
-}
-
-}
-
-}
\ No newline at end of file
diff --git a/src/test1.java b/src/test1.java
deleted file mode 100644
index b54d0f2..0000000
--- a/src/test1.java
+++ /dev/null
@@ -1,46 +0,0 @@
-
-public class test1 {
-
-	static int binarySearch(int arr[],int low, int high, int key){
-		if(high<low){
-			return -1;
-		}
-		int mid = (high+low)/2;
-		if(key == arr[mid]){
-			return mid;
-		}
-		else if(key > arr[mid]){
-			return binarySearch(arr, mid+1, high, key);
-		}
-		return binarySearch(arr, low, mid-1, key);
-	}
-	
-	static int deleteElement(int arr[],int pos){
-		for(int i=pos;i<arr.length-1;i++){
-			arr[i] = arr[i+1];
-		}
-		
-		return arr.length-1;
-	}
-	
-	
-	public static void main(String[] args) {
-		// TODO Auto-generated method stub
-		
-		int arr[] = new int[6];
-		arr[0] = 10;
-		arr[1] = 12;
-		arr[2] = 14;
-		arr[3] = 20;
-		arr[4] = 40;
-		arr[5] = 70;
-		
-		int n = arr.length;
-		int key = 40;
-		
-		int pos = binarySearch(arr,0,n,key);
-		System.out.println(pos);
-		deleteElement(arr,pos);
-	}
-
-}

From 8c98cce15de64416d8dca392ce8300b410aa4ae9 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Tue, 14 May 2019 23:38:29 -0400
Subject: [PATCH 24/35] starting again some java codes

---
 .idea/workspace.xml                         | 106 +++++++++++++-------
 src/PatternPrint.java                       |  30 ------
 src/hackerRank/FizzBuzzHR.java              |  22 ++++
 src/hackerRank/LastAndSecondLastString.java |  34 +++++++
 4 files changed, 126 insertions(+), 66 deletions(-)
 delete mode 100644 src/PatternPrint.java
 create mode 100644 src/hackerRank/FizzBuzzHR.java
 create mode 100644 src/hackerRank/LastAndSecondLastString.java

diff --git a/.idea/workspace.xml b/.idea/workspace.xml
index b3e8c7e..a6074d9 100644
--- a/.idea/workspace.xml
+++ b/.idea/workspace.xml
@@ -2,9 +2,11 @@
 <project version="4">
   <component name="ChangeListManager">
     <list default="true" id="de1033a4-5b49-45d1-bc14-d2226c70eeb5" name="Default Changelist" comment="">
+      <change afterPath="$PROJECT_DIR$/src/hackerRank/FizzBuzzHR.java" afterDir="false" />
+      <change afterPath="$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java" afterDir="false" />
+      <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
       <change beforePath="$PROJECT_DIR$/Codes/StringRev_Stack.java" beforeDir="false" afterPath="$PROJECT_DIR$/Codes/StringRev_Stack.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/src/test.java" beforeDir="false" />
-      <change beforePath="$PROJECT_DIR$/src/test1.java" beforeDir="false" />
+      <change beforePath="$PROJECT_DIR$/src/PatternPrint.java" beforeDir="false" />
     </list>
     <ignored path="$PROJECT_DIR$/classes/" />
     <ignored path="$PROJECT_DIR$/build/classes/" />
@@ -19,27 +21,18 @@
   </component>
   <component name="FileEditorManager">
     <leaf>
-      <file pinned="false" current-in-tab="false">
-        <entry file="file://$PROJECT_DIR$/Codility/PairElements.java">
+      <file pinned="false" current-in-tab="true">
+        <entry file="file://$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java">
           <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="600">
-              <caret line="40" selection-start-line="40" selection-end-line="40" />
+            <state relative-caret-position="210">
+              <caret line="14" column="8" selection-start-line="14" selection-start-column="8" selection-end-line="14" selection-end-column="8" />
               <folding>
-                <element signature="imports" expanded="true" />
+                <element signature="e#0#177#0" expanded="true" />
               </folding>
             </state>
           </provider>
         </entry>
       </file>
-      <file pinned="false" current-in-tab="true">
-        <entry file="file://$PROJECT_DIR$/Codes/AnagramsHR.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="30">
-              <caret line="5" selection-start-line="5" selection-end-line="5" selection-end-column="19" />
-            </state>
-          </provider>
-        </entry>
-      </file>
     </leaf>
   </component>
   <component name="FileTemplateManagerImpl">
@@ -62,16 +55,8 @@
       <list>
         <option value="$PROJECT_DIR$/Codility/Consecutive1TF.java" />
         <option value="$PROJECT_DIR$/src/Consecutive1TF.java" />
-      </list>
-    </option>
-  </component>
-  <component name="ProjectConfigurationFiles">
-    <option name="files">
-      <list>
-        <option value="$PROJECT_DIR$/Java-Practice.iml" />
-        <option value="$PROJECT_DIR$/.idea/misc.xml" />
-        <option value="$PROJECT_DIR$/.idea/vcs.xml" />
-        <option value="$PROJECT_DIR$/.idea/modules.xml" />
+        <option value="$PROJECT_DIR$/src/hackerRank/FizzBuzzHR.java" />
+        <option value="$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java" />
       </list>
     </option>
   </component>
@@ -102,6 +87,12 @@
               <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
               <item name="src" type="462c0819:PsiDirectoryNode" />
             </path>
+            <path>
+              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
+              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
+              <item name="src" type="462c0819:PsiDirectoryNode" />
+              <item name="hackerRank" type="462c0819:PsiDirectoryNode" />
+            </path>
           </expand>
           <select />
         </subPane>
@@ -110,6 +101,7 @@
     </panes>
   </component>
   <component name="PropertiesComponent">
+    <property name="SHARE_PROJECT_CONFIGURATION_FILES" value="true" />
     <property name="last_opened_file_path" value="$PROJECT_DIR$" />
   </component>
   <component name="RunDashboard">
@@ -124,7 +116,7 @@
       </list>
     </option>
   </component>
-  <component name="RunManager">
+  <component name="RunManager" selected="Application.FizzBuzzHR">
     <configuration name="AnagramsHR" type="Application" factoryName="Application" temporary="true" nameIsGenerated="true">
       <option name="MAIN_CLASS_NAME" value="AnagramsHR" />
       <module name="Java-Practice" />
@@ -132,8 +124,22 @@
         <option name="Make" enabled="true" />
       </method>
     </configuration>
+    <configuration name="FizzBuzzHR" type="Application" factoryName="Application" temporary="true" nameIsGenerated="true">
+      <option name="MAIN_CLASS_NAME" value="hackerRank.FizzBuzzHR" />
+      <module name="Java-Practice" />
+      <extension name="coverage">
+        <pattern>
+          <option name="PATTERN" value="hackerRank.*" />
+          <option name="ENABLED" value="true" />
+        </pattern>
+      </extension>
+      <method v="2">
+        <option name="Make" enabled="true" />
+      </method>
+    </configuration>
     <recent_temporary>
       <list>
+        <item itemvalue="Application.FizzBuzzHR" />
         <item itemvalue="Application.AnagramsHR" />
       </list>
     </recent_temporary>
@@ -153,13 +159,14 @@
   </component>
   <component name="ToolWindowManager">
     <frame x="0" y="0" width="1680" height="1050" extended-state="6" />
+    <editor active="true" />
     <layout>
       <window_info id="Image Layers" />
       <window_info id="Designer" />
       <window_info id="UI Designer" />
       <window_info id="Capture Tool" />
       <window_info id="Favorites" side_tool="true" />
-      <window_info content_ui="combo" id="Project" order="0" visible="true" weight="0.24969475" />
+      <window_info active="true" content_ui="combo" id="Project" order="0" visible="true" weight="0.24969475" />
       <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
       <window_info anchor="bottom" id="Version Control" />
       <window_info anchor="bottom" id="Terminal" />
@@ -207,6 +214,20 @@
         </state>
       </provider>
     </entry>
+    <entry file="file://$PROJECT_DIR$/Codes/LinkedList_Recursive.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="287">
+          <caret line="22" column="35" selection-start-line="22" selection-start-column="35" selection-end-line="22" selection-end-column="35" />
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/Codes/AnagramsHR.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="405">
+          <caret line="30" lean-forward="true" selection-start-line="30" selection-end-line="30" />
+        </state>
+      </provider>
+    </entry>
     <entry file="file://$PROJECT_DIR$/Codility/PairElements.java">
       <provider selected="true" editor-type-id="text-editor">
         <state relative-caret-position="600">
@@ -217,24 +238,37 @@
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/Codes/LinkedList_Recursive.java">
+    <entry file="file://$PROJECT_DIR$/src/PatternPrint.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="287">
-          <caret line="22" column="35" selection-start-line="22" selection-start-column="35" selection-end-line="22" selection-end-column="35" />
+        <state>
+          <caret column="13" selection-start-column="13" selection-end-column="13" />
         </state>
       </provider>
     </entry>
     <entry file="file://$PROJECT_DIR$/Codes/Elements_LL.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="30">
-          <caret line="2" selection-start-line="2" selection-end-line="2" />
+        <state relative-caret-position="420">
+          <caret line="28" column="21" lean-forward="true" selection-start-line="28" selection-start-column="21" selection-end-line="28" selection-end-column="21" />
         </state>
       </provider>
     </entry>
-    <entry file="file://$PROJECT_DIR$/Codes/AnagramsHR.java">
+    <entry file="file://$PROJECT_DIR$/src/hackerRank/FizzBuzzHR.java">
       <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="30">
-          <caret line="5" selection-start-line="5" selection-end-line="5" selection-end-column="19" />
+        <state relative-caret-position="330">
+          <caret line="22" lean-forward="true" selection-start-line="22" selection-end-line="22" />
+          <folding>
+            <element signature="imports" expanded="true" />
+          </folding>
+        </state>
+      </provider>
+    </entry>
+    <entry file="file://$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java">
+      <provider selected="true" editor-type-id="text-editor">
+        <state relative-caret-position="210">
+          <caret line="14" column="8" selection-start-line="14" selection-start-column="8" selection-end-line="14" selection-end-column="8" />
+          <folding>
+            <element signature="e#0#177#0" expanded="true" />
+          </folding>
         </state>
       </provider>
     </entry>
diff --git a/src/PatternPrint.java b/src/PatternPrint.java
deleted file mode 100644
index 2253f30..0000000
--- a/src/PatternPrint.java
+++ /dev/null
@@ -1,30 +0,0 @@
-public class test2 {
-
-	public test2() {
-		
-
-	}
-
-	public void printD() {
-		char[][] pic = new char[6][6];
-        for (int i = 0; i < 6; i++)
-           for (int j = 0; j < 6; j++) {
-              if ( i == j  ||  i == 0  ||  i == 5 )
-                 pic[i][j] = '*';
-              else
-                 pic[i][j] = '.';
-           }
-        for (int i = 0; i < 6; i++) {
-           for (int j = 0; j < 6; j++)
-              System.out.print(pic[i][j]);
-           System.out.println();
-        }
-		
-		
-	}
-	public static void main(String [] args) {
-		test2 myclass1 = new test2();
-		myclass1.printD();
-		
-	}
-}
diff --git a/src/hackerRank/FizzBuzzHR.java b/src/hackerRank/FizzBuzzHR.java
new file mode 100644
index 0000000..22a9144
--- /dev/null
+++ b/src/hackerRank/FizzBuzzHR.java
@@ -0,0 +1,22 @@
+package hackerRank;
+
+import java.util.Scanner;
+import java.util.stream.IntStream;
+
+public class FizzBuzzHR {
+
+
+    private static void fizzBuzz(int num) {
+        IntStream.rangeClosed(1, num)
+                .mapToObj(i -> i % 3 == 0 ? (i % 5 == 0 ? "HelloWorld" : "Hello") : (i % 7 == 0 ? "World" : i))
+                .forEach(System.out::println);
+    }
+
+
+    public static void main(String args[]) {
+        Scanner in = new Scanner(System.in);
+        int n = in.nextInt();
+        fizzBuzz(n);
+
+    }
+}
diff --git a/src/hackerRank/LastAndSecondLastString.java b/src/hackerRank/LastAndSecondLastString.java
new file mode 100644
index 0000000..dbe8658
--- /dev/null
+++ b/src/hackerRank/LastAndSecondLastString.java
@@ -0,0 +1,34 @@
+//Given the string print the last two characters reversed and with a space between them.
+//ex : bat output: t a
+
+
+
+package hackerRank;
+
+import java.util.Scanner;
+
+public class LastAndSecondLastString {
+
+
+
+    public static String lastLetters(String word) {
+
+        String substring = word.length() > 2 ? word.substring(word.length() - 2) : word;
+        System.out.println(substring);
+
+        char[] a = substring.toCharArray();
+        substring = a[1] + " " +a[0];
+
+        return substring;
+    }
+
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        String s = in.next();
+
+        lastLetters(s);
+    }
+
+
+}

From 72778e60f4fc9311b4e885e0476b70f8cbe9c471 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Sat, 20 Jul 2019 16:16:16 -0400
Subject: [PATCH 25/35] started corewars

---
 .idea/uiDesigner.xml                       | 124 +++++++++++++++++++++
 src/codewars/OddOccuranceArrayElement.java |   4 +
 src/practice/MostOccurance.java            |  37 ++++++
 3 files changed, 165 insertions(+)
 create mode 100644 .idea/uiDesigner.xml
 create mode 100644 src/codewars/OddOccuranceArrayElement.java
 create mode 100644 src/practice/MostOccurance.java

diff --git a/.idea/uiDesigner.xml b/.idea/uiDesigner.xml
new file mode 100644
index 0000000..e96534f
--- /dev/null
+++ b/.idea/uiDesigner.xml
@@ -0,0 +1,124 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="Palette2">
+    <group name="Swing">
+      <item class="com.intellij.uiDesigner.HSpacer" tooltip-text="Horizontal Spacer" icon="/com/intellij/uiDesigner/icons/hspacer.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="1" hsize-policy="6" anchor="0" fill="1" />
+      </item>
+      <item class="com.intellij.uiDesigner.VSpacer" tooltip-text="Vertical Spacer" icon="/com/intellij/uiDesigner/icons/vspacer.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="6" hsize-policy="1" anchor="0" fill="2" />
+      </item>
+      <item class="javax.swing.JPanel" icon="/com/intellij/uiDesigner/icons/panel.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3" />
+      </item>
+      <item class="javax.swing.JScrollPane" icon="/com/intellij/uiDesigner/icons/scrollPane.png" removable="false" auto-create-binding="false" can-attach-label="true">
+        <default-constraints vsize-policy="7" hsize-policy="7" anchor="0" fill="3" />
+      </item>
+      <item class="javax.swing.JButton" icon="/com/intellij/uiDesigner/icons/button.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="3" anchor="0" fill="1" />
+        <initial-values>
+          <property name="text" value="Button" />
+        </initial-values>
+      </item>
+      <item class="javax.swing.JRadioButton" icon="/com/intellij/uiDesigner/icons/radioButton.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="3" anchor="8" fill="0" />
+        <initial-values>
+          <property name="text" value="RadioButton" />
+        </initial-values>
+      </item>
+      <item class="javax.swing.JCheckBox" icon="/com/intellij/uiDesigner/icons/checkBox.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="3" anchor="8" fill="0" />
+        <initial-values>
+          <property name="text" value="CheckBox" />
+        </initial-values>
+      </item>
+      <item class="javax.swing.JLabel" icon="/com/intellij/uiDesigner/icons/label.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="0" anchor="8" fill="0" />
+        <initial-values>
+          <property name="text" value="Label" />
+        </initial-values>
+      </item>
+      <item class="javax.swing.JTextField" icon="/com/intellij/uiDesigner/icons/textField.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
+          <preferred-size width="150" height="-1" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JPasswordField" icon="/com/intellij/uiDesigner/icons/passwordField.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
+          <preferred-size width="150" height="-1" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JFormattedTextField" icon="/com/intellij/uiDesigner/icons/formattedTextField.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
+          <preferred-size width="150" height="-1" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JTextArea" icon="/com/intellij/uiDesigner/icons/textArea.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
+          <preferred-size width="150" height="50" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JTextPane" icon="/com/intellij/uiDesigner/icons/textPane.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
+          <preferred-size width="150" height="50" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JEditorPane" icon="/com/intellij/uiDesigner/icons/editorPane.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
+          <preferred-size width="150" height="50" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JComboBox" icon="/com/intellij/uiDesigner/icons/comboBox.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="0" hsize-policy="2" anchor="8" fill="1" />
+      </item>
+      <item class="javax.swing.JTable" icon="/com/intellij/uiDesigner/icons/table.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
+          <preferred-size width="150" height="50" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JList" icon="/com/intellij/uiDesigner/icons/list.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="6" hsize-policy="2" anchor="0" fill="3">
+          <preferred-size width="150" height="50" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JTree" icon="/com/intellij/uiDesigner/icons/tree.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
+          <preferred-size width="150" height="50" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JTabbedPane" icon="/com/intellij/uiDesigner/icons/tabbedPane.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3">
+          <preferred-size width="200" height="200" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JSplitPane" icon="/com/intellij/uiDesigner/icons/splitPane.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3">
+          <preferred-size width="200" height="200" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JSpinner" icon="/com/intellij/uiDesigner/icons/spinner.png" removable="false" auto-create-binding="true" can-attach-label="true">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1" />
+      </item>
+      <item class="javax.swing.JSlider" icon="/com/intellij/uiDesigner/icons/slider.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1" />
+      </item>
+      <item class="javax.swing.JSeparator" icon="/com/intellij/uiDesigner/icons/separator.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3" />
+      </item>
+      <item class="javax.swing.JProgressBar" icon="/com/intellij/uiDesigner/icons/progressbar.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="0" fill="1" />
+      </item>
+      <item class="javax.swing.JToolBar" icon="/com/intellij/uiDesigner/icons/toolbar.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="6" anchor="0" fill="1">
+          <preferred-size width="-1" height="20" />
+        </default-constraints>
+      </item>
+      <item class="javax.swing.JToolBar$Separator" icon="/com/intellij/uiDesigner/icons/toolbarSeparator.png" removable="false" auto-create-binding="false" can-attach-label="false">
+        <default-constraints vsize-policy="0" hsize-policy="0" anchor="0" fill="1" />
+      </item>
+      <item class="javax.swing.JScrollBar" icon="/com/intellij/uiDesigner/icons/scrollbar.png" removable="false" auto-create-binding="true" can-attach-label="false">
+        <default-constraints vsize-policy="6" hsize-policy="0" anchor="0" fill="2" />
+      </item>
+    </group>
+  </component>
+</project>
\ No newline at end of file
diff --git a/src/codewars/OddOccuranceArrayElement.java b/src/codewars/OddOccuranceArrayElement.java
new file mode 100644
index 0000000..939ad0b
--- /dev/null
+++ b/src/codewars/OddOccuranceArrayElement.java
@@ -0,0 +1,4 @@
+package codewars;
+
+public class OddOccuranceArrayElement {
+}
diff --git a/src/practice/MostOccurance.java b/src/practice/MostOccurance.java
new file mode 100644
index 0000000..08869bb
--- /dev/null
+++ b/src/practice/MostOccurance.java
@@ -0,0 +1,37 @@
+package practice;
+
+import java.util.Arrays;
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Scanner;
+
+public class MostOccurance {
+
+    public static String printResult(String str) {
+        String result  = "";
+
+        Map<Character, Integer> res = new HashMap<>();
+        char[] arr = str.toCharArray();
+        Arrays.sort(arr);
+
+        for(int i= 0 ;i<arr.length;i++) {
+            if(res.containsKey(i)) {
+                res.put(arr[i], res.get(i)+1);
+            }
+            else
+                res.put(arr[i], 1);
+            System.out.println(res);
+        }
+
+        return result;
+    }
+
+
+    public static void main(String[] args) {
+        Scanner in = new Scanner(System.in);
+        String str = in.next();
+
+
+        System.out.println(printResult(str));
+    }
+}

From 1ac68f1f222b71fb7223e54fe960e1e686acd260 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Sat, 20 Jul 2019 16:20:34 -0400
Subject: [PATCH 26/35] resync .gitignore

---
 .gitignore                                    |  79 +++++
 .idea/uiDesigner.xml                          | 124 --------
 .idea/workspace.xml                           | 292 ------------------
 .settings/.jsdtscope                          |   5 -
 .settings/org.eclipse.jdt.core.prefs          |   7 -
 .settings/org.eclipse.wst.common.component    |   8 -
 ....eclipse.wst.common.project.facet.core.xml |   4 -
 ...rg.eclipse.wst.jsdt.ui.superType.container |   1 -
 .../org.eclipse.wst.jsdt.ui.superType.name    |   1 -
 Codes/Elements_LL.java                        |   2 +
 Codes/LinkedList_Recursive.java               |   5 +-
 Codes/StringRev_Stack.java                    |  30 --
 README.md                                     |   2 +-
 src/codewars/OddOccuranceArrayElement.java    |  40 +++
 14 files changed, 125 insertions(+), 475 deletions(-)
 delete mode 100644 .idea/uiDesigner.xml
 delete mode 100644 .idea/workspace.xml
 delete mode 100644 .settings/.jsdtscope
 delete mode 100644 .settings/org.eclipse.jdt.core.prefs
 delete mode 100644 .settings/org.eclipse.wst.common.component
 delete mode 100644 .settings/org.eclipse.wst.common.project.facet.core.xml
 delete mode 100644 .settings/org.eclipse.wst.jsdt.ui.superType.container
 delete mode 100644 .settings/org.eclipse.wst.jsdt.ui.superType.name
 delete mode 100644 Codes/StringRev_Stack.java

diff --git a/.gitignore b/.gitignore
index 84c048a..b7d5a53 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1 +1,80 @@
 /build/
+
+# User-specific stuff
+.idea/**/workspace.xml
+.idea/**/tasks.xml
+.idea/**/usage.statistics.xml
+.idea/**/dictionaries
+.idea/**/shelf
+
+.settings/**
+
+# Generated files
+.idea/**/contentModel.xml
+
+# Sensitive or high-churn files
+.idea/**/dataSources/
+.idea/**/dataSources.ids
+.idea/**/dataSources.local.xml
+.idea/**/sqlDataSources.xml
+.idea/**/dynamic.xml
+.idea/**/uiDesigner.xml
+.idea/**/dbnavigator.xml
+
+# Gradle
+.idea/**/gradle.xml
+.idea/**/libraries
+
+# Gradle and Maven with auto-import
+# When using Gradle or Maven with auto-import, you should exclude module files,
+# since they will be recreated, and may cause churn.  Uncomment if using
+# auto-import.
+# .idea/modules.xml
+# .idea/*.iml
+# .idea/modules
+# *.iml
+# *.ipr
+
+# CMake
+cmake-build-*/
+
+# Mongo Explorer plugin
+.idea/**/mongoSettings.xml
+
+# File-based project format
+*.iws
+
+# IntelliJ
+out/
+
+# mpeltonen/sbt-idea plugin
+.idea_modules/
+
+# JIRA plugin
+atlassian-ide-plugin.xml
+
+# Cursive Clojure plugin
+.idea/replstate.xml
+
+# Crashlytics plugin (for Android Studio and IntelliJ)
+com_crashlytics_export_strings.xml
+crashlytics.properties
+crashlytics-build.properties
+fabric.properties
+
+# Editor-based Rest Client
+.idea/httpRequests
+
+# Android studio 3.1+ serialized cache file
+.idea/caches/build_file_checksums.ser
+
+### Intellij Patch ###
+# Comment Reason: https://github.com/joeblau/gitignore.io/issues/186#issuecomment-215987721
+
+# *.iml
+# modules.xml
+# .idea/misc.xml
+# *.ipr
+
+# Sonarlint plugin
+.idea/sonarlint
diff --git a/.idea/uiDesigner.xml b/.idea/uiDesigner.xml
deleted file mode 100644
index e96534f..0000000
--- a/.idea/uiDesigner.xml
+++ /dev/null
@@ -1,124 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="Palette2">
-    <group name="Swing">
-      <item class="com.intellij.uiDesigner.HSpacer" tooltip-text="Horizontal Spacer" icon="/com/intellij/uiDesigner/icons/hspacer.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="1" hsize-policy="6" anchor="0" fill="1" />
-      </item>
-      <item class="com.intellij.uiDesigner.VSpacer" tooltip-text="Vertical Spacer" icon="/com/intellij/uiDesigner/icons/vspacer.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="6" hsize-policy="1" anchor="0" fill="2" />
-      </item>
-      <item class="javax.swing.JPanel" icon="/com/intellij/uiDesigner/icons/panel.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3" />
-      </item>
-      <item class="javax.swing.JScrollPane" icon="/com/intellij/uiDesigner/icons/scrollPane.png" removable="false" auto-create-binding="false" can-attach-label="true">
-        <default-constraints vsize-policy="7" hsize-policy="7" anchor="0" fill="3" />
-      </item>
-      <item class="javax.swing.JButton" icon="/com/intellij/uiDesigner/icons/button.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="3" anchor="0" fill="1" />
-        <initial-values>
-          <property name="text" value="Button" />
-        </initial-values>
-      </item>
-      <item class="javax.swing.JRadioButton" icon="/com/intellij/uiDesigner/icons/radioButton.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="3" anchor="8" fill="0" />
-        <initial-values>
-          <property name="text" value="RadioButton" />
-        </initial-values>
-      </item>
-      <item class="javax.swing.JCheckBox" icon="/com/intellij/uiDesigner/icons/checkBox.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="3" anchor="8" fill="0" />
-        <initial-values>
-          <property name="text" value="CheckBox" />
-        </initial-values>
-      </item>
-      <item class="javax.swing.JLabel" icon="/com/intellij/uiDesigner/icons/label.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="0" anchor="8" fill="0" />
-        <initial-values>
-          <property name="text" value="Label" />
-        </initial-values>
-      </item>
-      <item class="javax.swing.JTextField" icon="/com/intellij/uiDesigner/icons/textField.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
-          <preferred-size width="150" height="-1" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JPasswordField" icon="/com/intellij/uiDesigner/icons/passwordField.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
-          <preferred-size width="150" height="-1" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JFormattedTextField" icon="/com/intellij/uiDesigner/icons/formattedTextField.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1">
-          <preferred-size width="150" height="-1" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JTextArea" icon="/com/intellij/uiDesigner/icons/textArea.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
-          <preferred-size width="150" height="50" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JTextPane" icon="/com/intellij/uiDesigner/icons/textPane.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
-          <preferred-size width="150" height="50" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JEditorPane" icon="/com/intellij/uiDesigner/icons/editorPane.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
-          <preferred-size width="150" height="50" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JComboBox" icon="/com/intellij/uiDesigner/icons/comboBox.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="0" hsize-policy="2" anchor="8" fill="1" />
-      </item>
-      <item class="javax.swing.JTable" icon="/com/intellij/uiDesigner/icons/table.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
-          <preferred-size width="150" height="50" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JList" icon="/com/intellij/uiDesigner/icons/list.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="6" hsize-policy="2" anchor="0" fill="3">
-          <preferred-size width="150" height="50" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JTree" icon="/com/intellij/uiDesigner/icons/tree.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3">
-          <preferred-size width="150" height="50" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JTabbedPane" icon="/com/intellij/uiDesigner/icons/tabbedPane.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3">
-          <preferred-size width="200" height="200" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JSplitPane" icon="/com/intellij/uiDesigner/icons/splitPane.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="3" hsize-policy="3" anchor="0" fill="3">
-          <preferred-size width="200" height="200" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JSpinner" icon="/com/intellij/uiDesigner/icons/spinner.png" removable="false" auto-create-binding="true" can-attach-label="true">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1" />
-      </item>
-      <item class="javax.swing.JSlider" icon="/com/intellij/uiDesigner/icons/slider.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="8" fill="1" />
-      </item>
-      <item class="javax.swing.JSeparator" icon="/com/intellij/uiDesigner/icons/separator.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="6" hsize-policy="6" anchor="0" fill="3" />
-      </item>
-      <item class="javax.swing.JProgressBar" icon="/com/intellij/uiDesigner/icons/progressbar.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="0" fill="1" />
-      </item>
-      <item class="javax.swing.JToolBar" icon="/com/intellij/uiDesigner/icons/toolbar.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="6" anchor="0" fill="1">
-          <preferred-size width="-1" height="20" />
-        </default-constraints>
-      </item>
-      <item class="javax.swing.JToolBar$Separator" icon="/com/intellij/uiDesigner/icons/toolbarSeparator.png" removable="false" auto-create-binding="false" can-attach-label="false">
-        <default-constraints vsize-policy="0" hsize-policy="0" anchor="0" fill="1" />
-      </item>
-      <item class="javax.swing.JScrollBar" icon="/com/intellij/uiDesigner/icons/scrollbar.png" removable="false" auto-create-binding="true" can-attach-label="false">
-        <default-constraints vsize-policy="6" hsize-policy="0" anchor="0" fill="2" />
-      </item>
-    </group>
-  </component>
-</project>
\ No newline at end of file
diff --git a/.idea/workspace.xml b/.idea/workspace.xml
deleted file mode 100644
index a6074d9..0000000
--- a/.idea/workspace.xml
+++ /dev/null
@@ -1,292 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<project version="4">
-  <component name="ChangeListManager">
-    <list default="true" id="de1033a4-5b49-45d1-bc14-d2226c70eeb5" name="Default Changelist" comment="">
-      <change afterPath="$PROJECT_DIR$/src/hackerRank/FizzBuzzHR.java" afterDir="false" />
-      <change afterPath="$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/.idea/workspace.xml" beforeDir="false" afterPath="$PROJECT_DIR$/.idea/workspace.xml" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/Codes/StringRev_Stack.java" beforeDir="false" afterPath="$PROJECT_DIR$/Codes/StringRev_Stack.java" afterDir="false" />
-      <change beforePath="$PROJECT_DIR$/src/PatternPrint.java" beforeDir="false" />
-    </list>
-    <ignored path="$PROJECT_DIR$/classes/" />
-    <ignored path="$PROJECT_DIR$/build/classes/" />
-    <option name="EXCLUDED_CONVERTED_TO_IGNORED" value="true" />
-    <option name="SHOW_DIALOG" value="false" />
-    <option name="HIGHLIGHT_CONFLICTS" value="true" />
-    <option name="HIGHLIGHT_NON_ACTIVE_CHANGELIST" value="false" />
-    <option name="LAST_RESOLUTION" value="IGNORE" />
-  </component>
-  <component name="DefaultGradleProjectSettings">
-    <option name="isMigrated" value="true" />
-  </component>
-  <component name="FileEditorManager">
-    <leaf>
-      <file pinned="false" current-in-tab="true">
-        <entry file="file://$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java">
-          <provider selected="true" editor-type-id="text-editor">
-            <state relative-caret-position="210">
-              <caret line="14" column="8" selection-start-line="14" selection-start-column="8" selection-end-line="14" selection-end-column="8" />
-              <folding>
-                <element signature="e#0#177#0" expanded="true" />
-              </folding>
-            </state>
-          </provider>
-        </entry>
-      </file>
-    </leaf>
-  </component>
-  <component name="FileTemplateManagerImpl">
-    <option name="RECENT_TEMPLATES">
-      <list>
-        <option value="Class" />
-      </list>
-    </option>
-  </component>
-  <component name="FindInProjectRecents">
-    <findStrings>
-      <find>anagrams</find>
-    </findStrings>
-  </component>
-  <component name="Git.Settings">
-    <option name="RECENT_GIT_ROOT_PATH" value="$PROJECT_DIR$" />
-  </component>
-  <component name="IdeDocumentHistory">
-    <option name="CHANGED_PATHS">
-      <list>
-        <option value="$PROJECT_DIR$/Codility/Consecutive1TF.java" />
-        <option value="$PROJECT_DIR$/src/Consecutive1TF.java" />
-        <option value="$PROJECT_DIR$/src/hackerRank/FizzBuzzHR.java" />
-        <option value="$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java" />
-      </list>
-    </option>
-  </component>
-  <component name="ProjectFrameBounds" fullScreen="true">
-    <option name="width" value="1680" />
-    <option name="height" value="1050" />
-  </component>
-  <component name="ProjectView">
-    <navigator proportions="" version="1">
-      <foldersAlwaysOnTop value="true" />
-    </navigator>
-    <panes>
-      <pane id="Scope" />
-      <pane id="ProjectPane">
-        <subPane>
-          <expand>
-            <path>
-              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
-              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
-              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
-              <item name="Codility" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
-              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
-              <item name="src" type="462c0819:PsiDirectoryNode" />
-            </path>
-            <path>
-              <item name="Java-Practice" type="b2602c69:ProjectViewProjectNode" />
-              <item name="Java-Practice" type="462c0819:PsiDirectoryNode" />
-              <item name="src" type="462c0819:PsiDirectoryNode" />
-              <item name="hackerRank" type="462c0819:PsiDirectoryNode" />
-            </path>
-          </expand>
-          <select />
-        </subPane>
-      </pane>
-      <pane id="PackagesPane" />
-    </panes>
-  </component>
-  <component name="PropertiesComponent">
-    <property name="SHARE_PROJECT_CONFIGURATION_FILES" value="true" />
-    <property name="last_opened_file_path" value="$PROJECT_DIR$" />
-  </component>
-  <component name="RunDashboard">
-    <option name="ruleStates">
-      <list>
-        <RuleState>
-          <option name="name" value="ConfigurationTypeDashboardGroupingRule" />
-        </RuleState>
-        <RuleState>
-          <option name="name" value="StatusDashboardGroupingRule" />
-        </RuleState>
-      </list>
-    </option>
-  </component>
-  <component name="RunManager" selected="Application.FizzBuzzHR">
-    <configuration name="AnagramsHR" type="Application" factoryName="Application" temporary="true" nameIsGenerated="true">
-      <option name="MAIN_CLASS_NAME" value="AnagramsHR" />
-      <module name="Java-Practice" />
-      <method v="2">
-        <option name="Make" enabled="true" />
-      </method>
-    </configuration>
-    <configuration name="FizzBuzzHR" type="Application" factoryName="Application" temporary="true" nameIsGenerated="true">
-      <option name="MAIN_CLASS_NAME" value="hackerRank.FizzBuzzHR" />
-      <module name="Java-Practice" />
-      <extension name="coverage">
-        <pattern>
-          <option name="PATTERN" value="hackerRank.*" />
-          <option name="ENABLED" value="true" />
-        </pattern>
-      </extension>
-      <method v="2">
-        <option name="Make" enabled="true" />
-      </method>
-    </configuration>
-    <recent_temporary>
-      <list>
-        <item itemvalue="Application.FizzBuzzHR" />
-        <item itemvalue="Application.AnagramsHR" />
-      </list>
-    </recent_temporary>
-  </component>
-  <component name="SvnConfiguration">
-    <configuration />
-  </component>
-  <component name="TaskManager">
-    <task active="true" id="Default" summary="Default task">
-      <changelist id="de1033a4-5b49-45d1-bc14-d2226c70eeb5" name="Default Changelist" comment="" />
-      <created>1557599443037</created>
-      <option name="number" value="Default" />
-      <option name="presentableId" value="Default" />
-      <updated>1557599443037</updated>
-    </task>
-    <servers />
-  </component>
-  <component name="ToolWindowManager">
-    <frame x="0" y="0" width="1680" height="1050" extended-state="6" />
-    <editor active="true" />
-    <layout>
-      <window_info id="Image Layers" />
-      <window_info id="Designer" />
-      <window_info id="UI Designer" />
-      <window_info id="Capture Tool" />
-      <window_info id="Favorites" side_tool="true" />
-      <window_info active="true" content_ui="combo" id="Project" order="0" visible="true" weight="0.24969475" />
-      <window_info id="Structure" order="1" side_tool="true" weight="0.25" />
-      <window_info anchor="bottom" id="Version Control" />
-      <window_info anchor="bottom" id="Terminal" />
-      <window_info anchor="bottom" id="Event Log" side_tool="true" />
-      <window_info anchor="bottom" id="Messages" weight="0.32959184" />
-      <window_info anchor="bottom" id="Message" order="0" />
-      <window_info anchor="bottom" id="Find" order="1" weight="0.32959184" />
-      <window_info anchor="bottom" id="Run" order="2" />
-      <window_info anchor="bottom" id="Debug" order="3" weight="0.4" />
-      <window_info anchor="bottom" id="Cvs" order="4" weight="0.25" />
-      <window_info anchor="bottom" id="Inspection" order="5" weight="0.4" />
-      <window_info anchor="bottom" id="TODO" order="6" />
-      <window_info anchor="right" id="Palette" />
-      <window_info anchor="right" id="Theme Preview" />
-      <window_info anchor="right" id="Maven" />
-      <window_info anchor="right" id="Capture Analysis" />
-      <window_info anchor="right" id="Palette&#9;" />
-      <window_info anchor="right" id="Commander" internal_type="SLIDING" order="0" type="SLIDING" weight="0.4" />
-      <window_info anchor="right" id="Ant Build" order="1" weight="0.25" />
-      <window_info anchor="right" content_ui="combo" id="Hierarchy" order="2" weight="0.25" />
-    </layout>
-  </component>
-  <component name="editorHistoryManager">
-    <entry file="file://$PROJECT_DIR$/Codility/Consecutive1TF">
-      <provider selected="true" editor-type-id="text-editor" />
-    </entry>
-    <entry file="file://$PROJECT_DIR$/src/ChainInspection.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="30">
-          <caret line="4" column="13" selection-start-line="4" selection-start-column="13" selection-end-line="4" selection-end-column="13" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/Codility/Consecutive1TF.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="30">
-          <caret line="2" column="4" selection-start-line="2" selection-start-column="4" selection-end-line="2" selection-end-column="4" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/src/Consecutive1TF.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="135">
-          <caret line="9" selection-start-line="9" selection-end-line="9" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/Codes/LinkedList_Recursive.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="287">
-          <caret line="22" column="35" selection-start-line="22" selection-start-column="35" selection-end-line="22" selection-end-column="35" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/Codes/AnagramsHR.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="405">
-          <caret line="30" lean-forward="true" selection-start-line="30" selection-end-line="30" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/Codility/PairElements.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="600">
-          <caret line="40" selection-start-line="40" selection-end-line="40" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/src/PatternPrint.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state>
-          <caret column="13" selection-start-column="13" selection-end-column="13" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/Codes/Elements_LL.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="420">
-          <caret line="28" column="21" lean-forward="true" selection-start-line="28" selection-start-column="21" selection-end-line="28" selection-end-column="21" />
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/src/hackerRank/FizzBuzzHR.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="330">
-          <caret line="22" lean-forward="true" selection-start-line="22" selection-end-line="22" />
-          <folding>
-            <element signature="imports" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-    <entry file="file://$PROJECT_DIR$/src/hackerRank/LastAndSecondLastString.java">
-      <provider selected="true" editor-type-id="text-editor">
-        <state relative-caret-position="210">
-          <caret line="14" column="8" selection-start-line="14" selection-start-column="8" selection-end-line="14" selection-end-column="8" />
-          <folding>
-            <element signature="e#0#177#0" expanded="true" />
-          </folding>
-        </state>
-      </provider>
-    </entry>
-  </component>
-  <component name="masterDetails">
-    <states>
-      <state key="ProjectJDKs.UI">
-        <settings>
-          <last-edited>1.8</last-edited>
-          <splitter-proportions>
-            <option name="proportions">
-              <list>
-                <option value="0.2" />
-              </list>
-            </option>
-          </splitter-proportions>
-        </settings>
-      </state>
-    </states>
-  </component>
-</project>
\ No newline at end of file
diff --git a/.settings/.jsdtscope b/.settings/.jsdtscope
deleted file mode 100644
index fd53605..0000000
--- a/.settings/.jsdtscope
+++ /dev/null
@@ -1,5 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<classpath>
-	<classpathentry excluding="**/bower_components/*|**/node_modules/*|**/*.min.js" kind="src" path="WebContent"/>
-	<classpathentry kind="output" path=""/>
-</classpath>
diff --git a/.settings/org.eclipse.jdt.core.prefs b/.settings/org.eclipse.jdt.core.prefs
deleted file mode 100644
index 0c68a61..0000000
--- a/.settings/org.eclipse.jdt.core.prefs
+++ /dev/null
@@ -1,7 +0,0 @@
-eclipse.preferences.version=1
-org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
-org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
-org.eclipse.jdt.core.compiler.compliance=1.8
-org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
-org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
-org.eclipse.jdt.core.compiler.source=1.8
diff --git a/.settings/org.eclipse.wst.common.component b/.settings/org.eclipse.wst.common.component
deleted file mode 100644
index 76b9c7a..0000000
--- a/.settings/org.eclipse.wst.common.component
+++ /dev/null
@@ -1,8 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?><project-modules id="moduleCoreId" project-version="1.5.0">
-    <wb-module deploy-name="Java-Practice">
-        <wb-resource deploy-path="/WEB-INF/classes" source-path="/src"/>
-        <wb-resource deploy-path="/WEB-INF/classes" source-path="/Codes"/>
-        <property name="context-root" value="Java-Practice"/>
-        <property name="java-output-path" value="/Java-Practice/build/classes"/>
-    </wb-module>
-</project-modules>
diff --git a/.settings/org.eclipse.wst.common.project.facet.core.xml b/.settings/org.eclipse.wst.common.project.facet.core.xml
deleted file mode 100644
index f4ef8aa..0000000
--- a/.settings/org.eclipse.wst.common.project.facet.core.xml
+++ /dev/null
@@ -1,4 +0,0 @@
-<?xml version="1.0" encoding="UTF-8"?>
-<faceted-project>
-  <installed facet="java" version="1.8"/>
-</faceted-project>
diff --git a/.settings/org.eclipse.wst.jsdt.ui.superType.container b/.settings/org.eclipse.wst.jsdt.ui.superType.container
deleted file mode 100644
index 3bd5d0a..0000000
--- a/.settings/org.eclipse.wst.jsdt.ui.superType.container
+++ /dev/null
@@ -1 +0,0 @@
-org.eclipse.wst.jsdt.launching.baseBrowserLibrary
\ No newline at end of file
diff --git a/.settings/org.eclipse.wst.jsdt.ui.superType.name b/.settings/org.eclipse.wst.jsdt.ui.superType.name
deleted file mode 100644
index 05bd71b..0000000
--- a/.settings/org.eclipse.wst.jsdt.ui.superType.name
+++ /dev/null
@@ -1 +0,0 @@
-Window
\ No newline at end of file
diff --git a/Codes/Elements_LL.java b/Codes/Elements_LL.java
index 6bbe063..b87e648 100644
--- a/Codes/Elements_LL.java
+++ b/Codes/Elements_LL.java
@@ -1,3 +1,4 @@
+/*
 // Counting the Number of Elements in a Linked List.
 //Iterative Solution
 class Node
@@ -41,3 +42,4 @@ public static void main(String[] args)
                            llist.getCount());
     }
 }
+*/
diff --git a/Codes/LinkedList_Recursive.java b/Codes/LinkedList_Recursive.java
index 0820bea..515a380 100644
--- a/Codes/LinkedList_Recursive.java
+++ b/Codes/LinkedList_Recursive.java
@@ -1,4 +1,5 @@
-// Recursive Java program to count number of nodes in 
+/*
+// Recursive Java program to count number of nodes in
 // a linked list
 
 class Node
@@ -40,4 +41,4 @@ public static void main(String[] args)
         System.out.println("Count of nodes is " +
                            lList.getCount());
     }
-}
\ No newline at end of file
+}*/
diff --git a/Codes/StringRev_Stack.java b/Codes/StringRev_Stack.java
deleted file mode 100644
index 4c6ff7b..0000000
--- a/Codes/StringRev_Stack.java
+++ /dev/null
@@ -1,30 +0,0 @@
-// String reverse using stack.
-
-package stringpractice;
-
-import java.util.Scanner;
-import java.util.Stack;
-
-public class StringRev_Stack {
-
-	public static void main(String[] args) {
-		// TODO Auto-generated method stub
-		Stack<Character> st = new Stack<Character>();
-		Scanner in = new Scanner(System.in);
-		System.out.println("Enter the string: ");
-		String s = in.nextLine();
-		
-		for(char c : s.toCharArray()){
-			st.push(c);
-		}
-		System.out.println("Stack is: "+st );
-
-		String output = "";
-		while(!st.isEmpty()){
-			char ch = st.pop();
-			output = output + ch;
-		}
-		System.out.println(output);
-	}
-
-}
diff --git a/README.md b/README.md
index b1e4162..d3038d7 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,3 @@
-# Java-Practice
+# Java-practice
 
 Contains Various programming questions asked in interviews and from various coding challanges sites.
diff --git a/src/codewars/OddOccuranceArrayElement.java b/src/codewars/OddOccuranceArrayElement.java
index 939ad0b..d2f6242 100644
--- a/src/codewars/OddOccuranceArrayElement.java
+++ b/src/codewars/OddOccuranceArrayElement.java
@@ -1,4 +1,44 @@
+/**
+ * return the input integer with odd occurrences
+ */
+
 package codewars;
 
+import java.util.HashMap;
+import java.util.Map;
+
 public class OddOccuranceArrayElement {
+
+    public static int findIt(int[] a) {
+        int odd = 0;
+
+        Map<Integer, Integer> resMap = new HashMap<>();
+
+        for(int i= 0;i<a.length;i++) {
+            if(resMap.containsKey(a[i])) {
+                int count = resMap.get(a[i]);
+               resMap.put(a[i], count+1);
+            } else
+                resMap.put(a[i], new Integer(1));
+        }
+
+        for(Map.Entry<Integer, Integer> entry : resMap.entrySet()) {
+            if(entry.getValue() %2 == 1) {
+                odd = entry.getKey();
+            }
+        }
+
+        return odd;
+    }
+
+
+
+    public static void main(String[] args) {
+        System.out.println(findIt(new int[]{20,1,-1,2,-2,3,3,5,5,1,2,4,20,4,-1,-2,5}));
+        System.out.println(findIt(new int[]{1,1,2,-2,5,2,4,4,-1,-2,5}));
+        System.out.println(findIt(new int[]{20,1,1,2,2,3,3,5,5,4,20,4,5}));
+        System.out.println(findIt(new int[]{10}));
+        System.out.println(findIt(new int[]{1,1,1,1,1,1,10,1,1,1,1}));
+        System.out.println(findIt(new int[]{5,4,3,2,1,5,4,3,2,10,10}));
+    }
 }

From 4767c82beace0843371ed575c332201079594c2e Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Sat, 20 Jul 2019 20:41:10 -0400
Subject: [PATCH 27/35] java practive from code wars

---
 src/codewars/GetMiddleChar.java   | 32 +++++++++++++++++++++
 src/codewars/MoneyMoneyMoney.java | 47 +++++++++++++++++++++++++++++++
 src/codewars/SumOfNumbers.java    | 42 +++++++++++++++++++++++++++
 src/codewars/YourOrderPlease.java | 30 ++++++++++++++++++++
 4 files changed, 151 insertions(+)
 create mode 100644 src/codewars/GetMiddleChar.java
 create mode 100644 src/codewars/MoneyMoneyMoney.java
 create mode 100644 src/codewars/SumOfNumbers.java
 create mode 100644 src/codewars/YourOrderPlease.java

diff --git a/src/codewars/GetMiddleChar.java b/src/codewars/GetMiddleChar.java
new file mode 100644
index 0000000..8a7bb9a
--- /dev/null
+++ b/src/codewars/GetMiddleChar.java
@@ -0,0 +1,32 @@
+/**
+ * You are going to be given a word. Your job is to return the middle character of the word. If the word's length is odd, return the middle character.
+ * If the word's length is even, return the middle 2 characters.
+ */
+
+
+package codewars;
+
+public class GetMiddleChar {
+
+    public static String getMiddle(String word) {
+
+        int a;
+        if (word.length() == 1 || word.length() == 2) {
+            return word;
+        }
+
+        if (word.length() % 2 == 0) {
+            return word.substring((word.length() / 2) - 1, (word.length() / 2) + 1);
+        } else {
+            a = (int) Math.ceil(word.length() / 2);
+            return word.substring(a, a+1);
+        }
+    }
+
+    public static void main(String[] args) {
+        System.out.println(getMiddle("testing"));
+        System.out.println(getMiddle("test"));
+        System.out.println(getMiddle("A"));
+        System.out.println(getMiddle("middle"));
+    }
+}
diff --git a/src/codewars/MoneyMoneyMoney.java b/src/codewars/MoneyMoneyMoney.java
new file mode 100644
index 0000000..0056592
--- /dev/null
+++ b/src/codewars/MoneyMoneyMoney.java
@@ -0,0 +1,47 @@
+/**
+ * Mr. Scrooge has a sum of money 'P' that wants to invest, and he wants to know how many years 'Y' this sum has to be kept in the bank in order for this sum of money to amount to 'D'.
+ *
+ * The sum is kept for 'Y' years in the bank where interest 'I' is paid yearly, and the new sum is re-invested yearly after paying tax 'T'
+ *
+ * Note that the principal is not taxed but only the year's accrued interest
+ *
+ * Example:
+ *  Let P be the Principal = 1000.00
+ *   Let I be the Interest Rate = 0.05
+ *   Let T be the Tax Rate = 0.18
+ *   Let D be the Desired Sum = 1100.00
+ *
+ *
+ * After 1st Year -->
+ *   P = 1041.00
+ * After 2nd Year -->
+ *   P = 1083.86
+ * After 3rd Year -->
+ *   P = 1128.30
+ */
+
+
+package codewars;
+
+public class MoneyMoneyMoney {
+
+    public static int calculateYears(double principal, double interest, double tax, double desired) {
+
+        double interestYearly;
+        double taxRes;
+        int counter = 0;
+
+        while (principal < desired) {
+            counter++;
+            interestYearly = principal * interest;
+            taxRes = interestYearly * tax;
+            principal = principal + (interestYearly - taxRes);
+        }
+        return counter;
+    }
+
+    public static void main(String[] args) {
+        System.out.println(calculateYears(1000, 0.05, 0.18, 1100));
+        System.out.println(calculateYears(1000,0.05,0.18,1000));
+    }
+}
diff --git a/src/codewars/SumOfNumbers.java b/src/codewars/SumOfNumbers.java
new file mode 100644
index 0000000..9bd9dfc
--- /dev/null
+++ b/src/codewars/SumOfNumbers.java
@@ -0,0 +1,42 @@
+/**
+ * Given two integers a and b, which can be positive or negative, find the sum of all the numbers between including them too and return it.
+ * If the two numbers are equal return a or b.
+ *
+ * Note: a and b are not ordered!
+ */
+
+
+
+package codewars;
+
+public class SumOfNumbers {
+
+    public static int getSum(int a , int b) {
+        int result = 0;
+
+        if(a == b ){
+            return a;
+        }
+
+        if(a > b) {
+            for(int i= b ; i<=a; i++) {
+                result = result+i;
+            }
+        }else {
+            for(int i=a;i<=b;i++){
+                result = result+i;
+            }
+        }
+        return result;
+    }
+
+    public static void main(String[] args) {
+        System.out.println(getSum(0,-1));
+        System.out.println(getSum(0,1));
+        System.out.println(getSum(1,2));
+        System.out.println(getSum(0,1));
+        System.out.println(getSum(1,1));
+        System.out.println(getSum(-1,0));
+        System.out.println(getSum(-1,2));
+    }
+}
diff --git a/src/codewars/YourOrderPlease.java b/src/codewars/YourOrderPlease.java
new file mode 100644
index 0000000..3621061
--- /dev/null
+++ b/src/codewars/YourOrderPlease.java
@@ -0,0 +1,30 @@
+/**
+ * Your task is to sort a given string. Each word in the string will contain a single number. This number is the position the word should have in the result.
+ * <p>
+ * Note: Numbers can be from 1 to 9. So 1 will be the first word (not 0).
+ * <p>
+ * If the input string is empty, return an empty string. The words in the input String will only contain valid consecutive numbers.
+ */
+
+package codewars;
+
+public class YourOrderPlease {
+
+    public static String order(String words) {
+
+        String[] word = words.split(" ");
+        StringBuilder sb = new StringBuilder();
+
+        for (int i = 1; i <= word.length; i++) {
+
+            for (String str : word) {
+                if (str.contains(Integer.toString(i))) sb.append(str).append(" ");
+            }
+        }
+        return sb.toString().trim();
+    }
+
+    public static void main(String[] args) {
+        System.out.println(order("is2 Thi1s T4est 3a"));
+    }
+}

From 68120285234cea527e40ebd229cb9e97d04d0357 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Sun, 21 Jul 2019 18:12:21 -0400
Subject: [PATCH 28/35] code wars practice

---
 src/codewars/FindTheMissingLetter.java | 24 +++++++++++++++
 src/codewars/HighestScoringWord.java   | 42 ++++++++++++++++++++++++++
 src/codewars/WhoLikesIt.java           | 34 +++++++++++++++++++++
 3 files changed, 100 insertions(+)
 create mode 100644 src/codewars/FindTheMissingLetter.java
 create mode 100644 src/codewars/HighestScoringWord.java
 create mode 100644 src/codewars/WhoLikesIt.java

diff --git a/src/codewars/FindTheMissingLetter.java b/src/codewars/FindTheMissingLetter.java
new file mode 100644
index 0000000..65caca3
--- /dev/null
+++ b/src/codewars/FindTheMissingLetter.java
@@ -0,0 +1,24 @@
+package codewars;
+
+public class FindTheMissingLetter {
+
+    public static char findMissingLetter(char[] array) {
+
+        char letter = 'a';
+
+        for(int i= 0; i< array.length;i++) {
+            if(array[i+1] - array[i] != 1) {
+                char b = array[i];
+                int letterValue  = b + 1;
+                letter = (char) letterValue;
+                break;
+            }
+        }
+        return letter;
+    }
+
+    public static void main(String[] args) {
+        System.out.println(findMissingLetter(new char[] { 'a','b','c','d','f' }));
+        System.out.println(findMissingLetter(new char[] { 'O','Q','R','S' }));
+    }
+}
diff --git a/src/codewars/HighestScoringWord.java b/src/codewars/HighestScoringWord.java
new file mode 100644
index 0000000..cc7f501
--- /dev/null
+++ b/src/codewars/HighestScoringWord.java
@@ -0,0 +1,42 @@
+/**
+ * Given a string of words, you need to find the highest scoring word.
+ * <p>
+ * Each letter of a word scores points according to its position in the alphabet: a = 1, b = 2, c = 3 etc.
+ * You need to return the highest scoring word as a string.
+ * <p>
+ * If two words score the same, return the word that appears earliest in the original string.
+ * All letters will be lowercase and all inputs will be valid.
+ */
+
+
+package codewars;
+
+public class HighestScoringWord {
+
+    public static String high(String s) {
+
+        String[] words = s.split(" ");
+        int highestScore = 0;
+        String finalWord = "";
+
+        for (String str : words) {
+            int score = 0;
+            for (char c : str.toCharArray()) {
+                score += c - 'a' + 1;
+            }
+
+            if (score > highestScore) {
+                finalWord = str;
+                highestScore = score;
+            }
+        }
+
+        return finalWord;
+    }
+
+    public static void main(String[] args) {
+        System.out.println(high("man i need a taxi up to ubud txai"));
+        System.out.println(high("what time are we climbing up to the volcano"));
+        System.out.println(high("take me to semynak"));
+    }
+}
diff --git a/src/codewars/WhoLikesIt.java b/src/codewars/WhoLikesIt.java
new file mode 100644
index 0000000..6ab2b18
--- /dev/null
+++ b/src/codewars/WhoLikesIt.java
@@ -0,0 +1,34 @@
+/**
+ * You probably know the "like" system from Facebook and other pages. People can "like" blog posts, pictures or other items.
+ * We want to create the text that should be displayed next to such an item.
+ *
+ * Implement a function likes :: [String] -> String, which must take in input array, containing the names of people who like an item.
+ * It must return the display text as shown in the examples:
+ */
+
+
+package codewars;
+
+public class WhoLikesIt {
+
+    public static String whoLikesIt(String... names) {
+
+        switch (names.length) {
+            case 0: return "no one likes this";
+            case 1: return names[0] + " likes this";
+            case 2: return names[0] +" and "+ names[1] + " likes this";
+            case 3: return names[0] +", " + names[1] + " and" + names[2] + " likes this";
+            case 4: return names[0] +", "+ names[1] +" and " + (names.length -2)+ " likes this";
+            default:
+                return "no one";
+        }
+    }
+
+    public static void main(String[] args) {
+        System.out.println(whoLikesIt());
+        System.out.println(whoLikesIt("Peter"));
+        System.out.println(whoLikesIt("Jacob", "Alex"));
+        System.out.println(whoLikesIt("Max", "John", "Mark"));
+        System.out.println(whoLikesIt("Alex", "Jacob", "Mark", "Max"));
+    }
+}

From 33a5664dc25276076b5645f039c0ef70880ccaad Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Mon, 22 Jul 2019 18:47:47 -0400
Subject: [PATCH 29/35] scramblies codewars

---
 src/codewars/Scramblies.java | 39 ++++++++++++++++++++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 src/codewars/Scramblies.java

diff --git a/src/codewars/Scramblies.java b/src/codewars/Scramblies.java
new file mode 100644
index 0000000..7e953b6
--- /dev/null
+++ b/src/codewars/Scramblies.java
@@ -0,0 +1,39 @@
+/**
+ * Complete the function scramble(str1, str2) that returns true if a portion of str1 characters can be rearranged to match str2, otherwise returns false.
+ *
+ * Notes:
+ *
+ * Only lower case letters will be used (a-z). No punctuation or digits will be included.
+ * Performance needs to be considered
+ */
+
+
+package codewars;
+
+public class Scramblies {
+
+    public static boolean scramble(String str1, String str2) {
+
+        for (int i = 0; i < str1.length(); i++) {
+            str2 = str2.replaceFirst("" + str1.charAt(i), "");
+            if (str2.isEmpty()) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+
+    public static void main(String[] args) {
+        System.out.println(scramble("rkqodlw", "world"));
+        System.out.println(scramble("cedewaraaossoqqyt", "codewars"));
+        System.out.println(scramble("katas", "steak"));
+        System.out.println(scramble("scriptjavx", "javascript"));
+        System.out.println(scramble("scriptingjava", "javascript"));
+        System.out.println(scramble("scriptsjava", "javascripts"));
+        System.out.println(scramble("javscripts", "javascript"));
+        System.out.println(scramble("aabbcamaomsccdd", "commas"));
+        System.out.println(scramble("commas", "commas"));
+        System.out.println(scramble("sammoc", "commas"));
+    }
+}

From a3d6778846d33efb84c013ee25e1acc0ef1899b4 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Tue, 23 Jul 2019 22:36:16 -0400
Subject: [PATCH 30/35] hackerrank tests

---
 src/codewars/DeleteAndEarnHackerRank.java | 54 +++++++++++++++++++++++
 src/codewars/maxDifferenceHackerRank.java | 42 ++++++++++++++++++
 2 files changed, 96 insertions(+)
 create mode 100644 src/codewars/DeleteAndEarnHackerRank.java
 create mode 100644 src/codewars/maxDifferenceHackerRank.java

diff --git a/src/codewars/DeleteAndEarnHackerRank.java b/src/codewars/DeleteAndEarnHackerRank.java
new file mode 100644
index 0000000..00fa233
--- /dev/null
+++ b/src/codewars/DeleteAndEarnHackerRank.java
@@ -0,0 +1,54 @@
+package codewars;
+
+import java.util.Arrays;
+import java.util.HashMap;
+
+public class DeleteAndEarnHackerRank {
+
+
+    public static int deleteAndEarn(int[] nums) {
+        if (nums == null || nums.length == 0)
+            return 0;
+        else if (nums.length == 1)
+            return nums[0];
+
+        // sum and hash
+        HashMap<Integer, Integer> numMap = new HashMap<>();
+        for (int num : nums) {
+            if (numMap.containsKey(num)) {
+                numMap.put(num, numMap.get(num) + num);
+            } else
+                numMap.put(num, num);
+        }
+
+        // sorted num
+        Integer[] uniqueNums = new Integer[numMap.size()];
+        uniqueNums = numMap.keySet().toArray(uniqueNums);
+        Arrays.sort(uniqueNums);
+
+
+        int prevSum = 0;
+        int prevLSum = 0;
+        for (int i = 0; i < uniqueNums.length; i++) {
+            int temp = 0;
+            if (i - 1 >= 0 && uniqueNums[i - 1] == uniqueNums[i] - 1) {
+                temp = Math.max(prevLSum + numMap.get(uniqueNums[i]), prevLSum);
+            } else {
+                temp = prevSum + numMap.get(uniqueNums[i]);
+            }
+
+            prevLSum = prevSum;
+            prevSum = temp;
+        }
+
+        return prevSum;
+    }
+
+    public static void main(String[] args) {
+        //int[] arr = {3, 4, 2};
+        int[] arr = {5, 6, 6, 4, 11};
+
+        System.out.println(deleteAndEarn(arr));
+    }
+
+}
\ No newline at end of file
diff --git a/src/codewars/maxDifferenceHackerRank.java b/src/codewars/maxDifferenceHackerRank.java
new file mode 100644
index 0000000..ba3214d
--- /dev/null
+++ b/src/codewars/maxDifferenceHackerRank.java
@@ -0,0 +1,42 @@
+package codewars;
+
+import java.util.ArrayList;
+import java.util.List;
+
+public class maxDifferenceHackerRank {
+
+    public static int maxDiff(List<Integer> arr) {
+        int difference = 0;
+        int result = 0;
+        List<Integer> results = new ArrayList<>();
+
+        int size = arr.get(0);
+
+
+        if(arr.get(2) > arr.get(1)) {
+            difference = arr.get(2) - arr.get(1);
+            results.add(difference);
+        }
+
+        for(int i=size;i>3;i--) {
+            if(arr.get(i-1) < arr.get(i)) {
+                difference = arr.get(i) - arr.get(i-1);
+                results.add(difference);
+            }
+        }
+        System.out.println(results);
+
+        return result;
+    }
+
+
+    public static void main(String[] args) {
+        List<Integer> di = new ArrayList<>();
+        di.add(4);
+        di.add(1);
+        di.add(2);
+        di.add(6);
+        di.add(4);
+        maxDiff(di);
+    }
+}

From 7f79af2ad18e9cf20f4919a0fe065c2873b5b118 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Fri, 26 Jul 2019 23:37:44 -0400
Subject: [PATCH 31/35] hackerrank interview kit

---
 .../interviewpreparationkit/SockMerchant.java | 59 +++++++++++++++++++
 1 file changed, 59 insertions(+)
 create mode 100644 src/hackerRank/interviewpreparationkit/SockMerchant.java

diff --git a/src/hackerRank/interviewpreparationkit/SockMerchant.java b/src/hackerRank/interviewpreparationkit/SockMerchant.java
new file mode 100644
index 0000000..89b3725
--- /dev/null
+++ b/src/hackerRank/interviewpreparationkit/SockMerchant.java
@@ -0,0 +1,59 @@
+/**
+ * John works at a clothing store. He has a large pile of socks that he must pair by color for sale.
+ * Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are.
+ * For example, there are n=7 socks with colors ar = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2.
+ * There are three odd socks left, one of each color. The number of pairs is 2.
+ */
+
+
+
+package hackerRank.interviewpreparationkit;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class SockMerchant {
+
+
+    static int sockMerchant(int n, int[] ar) {
+        Map<Integer, Integer> res = new HashMap<>();
+        int result = 0;
+        int count = 0;
+
+        for (int i = 0; i < n; i++) {
+            if (res.containsKey(ar[i])) {
+                res.put(ar[i], res.get(ar[i]) + 1);
+            } else {
+                res.put(ar[i], 1);
+            }
+        }
+
+
+        for (Map.Entry entry : res.entrySet()) {
+            int a = (int) entry.getValue();
+            while (a > 0) {
+                if (a % 2 == 0) {
+                    count++;
+                    a = a - 2;
+                } else {
+                    if (a >= 1) {
+                        a = a - 1;
+                        if ((a != 0) && (a % 2 == 0)) {
+                            count++;
+                            a = a - 2;
+                        }
+                    }
+                }
+            }
+            result = count;
+        }
+        return result;
+    }
+
+
+    public static void main(String[] args) {
+        //int[] ar = {1, 1, 3, 1, 2, 1, 3, 3, 3, 3};
+        int[] ar = {10,20,20,10,10,30,50,10,20};
+        System.out.println(sockMerchant(9, ar));
+    }
+}

From c4023f5e1ade841265b842862a4aebb5baaeb8b4 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Sun, 28 Jul 2019 17:34:42 -0400
Subject: [PATCH 32/35] Hackerrank counting valleys

---
 .../CountingValleys.java                      | 39 +++++++++++++++++++
 1 file changed, 39 insertions(+)
 create mode 100644 src/hackerRank/interviewpreparationkit/CountingValleys.java

diff --git a/src/hackerRank/interviewpreparationkit/CountingValleys.java b/src/hackerRank/interviewpreparationkit/CountingValleys.java
new file mode 100644
index 0000000..4551bb0
--- /dev/null
+++ b/src/hackerRank/interviewpreparationkit/CountingValleys.java
@@ -0,0 +1,39 @@
+/**
+ * Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly n steps.
+ * For every step he took, he noted if it was an uphill, U , or a downhill, D step. Gary's hikes start and end at sea level and each step up or down represents a 1 unit change in altitude.
+ * We define the following terms:
+ * 
+ * A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to sea level.
+ * A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea level.
+ */
+
+package hackerRank.interviewpreparationkit;
+
+public class CountingValleys {
+
+    static int countingValleys(int n, String s) {
+        int result = 0;
+        int level = 0;
+
+        char c[] = s.toCharArray();
+
+        for (int i = 0; i < n; i++) {
+            if (c[i] == 'D') {
+                level++;
+            } else {
+                level--;
+            }
+            if (level == 0 && c[i] == 'U') {
+                result++;
+            }
+        }
+
+
+        return result;
+    }
+
+
+    public static void main(String[] args) {
+        System.out.println(countingValleys(8, "DDUUUUDD"));
+    }
+}

From aad390fc72eac22b1c96c04e2668733113e992a7 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Thu, 1 Aug 2019 17:30:38 -0400
Subject: [PATCH 33/35] codewars

---
 src/careercup/ReorderArray.java               | 40 +++++++++++++
 src/codewars/HelptheBookSeller.java           | 57 +++++++++++++++++++
 .../CountingValleys.java                      |  2 +-
 3 files changed, 98 insertions(+), 1 deletion(-)
 create mode 100644 src/careercup/ReorderArray.java
 create mode 100644 src/codewars/HelptheBookSeller.java

diff --git a/src/careercup/ReorderArray.java b/src/careercup/ReorderArray.java
new file mode 100644
index 0000000..716c0c1
--- /dev/null
+++ b/src/careercup/ReorderArray.java
@@ -0,0 +1,40 @@
+//not done :(
+
+package careercup;
+
+public class ReorderArray {
+
+    public static int reorder(int[] arr) {
+
+        int oddI = 0;
+        int evenI = 0;
+        int count = 0;
+
+            if (evenI < arr.length && (arr[evenI] % 2 == 0)) {
+                evenI = evenI + 2;
+            }
+
+            if (oddI < arr.length && (arr[oddI] % 2 == 1)) {
+                oddI = oddI + 2;
+            }
+
+            if (evenI < arr.length && oddI < arr.length) {
+                count++;
+                int temp = arr[evenI];
+                arr[evenI] = arr[oddI];
+                arr[oddI] = temp;
+            }
+
+            for(int a : arr) {
+                System.out.println(a);
+            }
+        //System.out.println(count);
+        return 5;
+
+    }
+
+
+    public static void main(String[] args) {
+        reorder(new int[]{2, 1, 3, 4});
+    }
+}
diff --git a/src/codewars/HelptheBookSeller.java b/src/codewars/HelptheBookSeller.java
new file mode 100644
index 0000000..a7835ca
--- /dev/null
+++ b/src/codewars/HelptheBookSeller.java
@@ -0,0 +1,57 @@
+/**
+ * A bookseller has lots of books classified in 26 categories labeled A, B, ... Z. Each book has a code c of 3, 4, 5 or more capitals letters.
+ * The 1st letter of a code is the capital letter of the book category. In the bookseller's stocklist each code c is followed by a space and by a positive integer n (int n >= 0) which indicates the quantity of books of this code in stock.
+ *
+ * For example an extract of one of the stocklists could be:
+ *
+ * L = {"ABART 20", "CDXEF 50", "BKWRK 25", "BTSQZ 89", "DRTYM 60"}.
+ *  M = {"A", "B", "C", "W"}
+ *
+ *
+ *  output:
+ *  (A : 20) - (B : 114) - (C : 50) - (W : 0)
+ */
+
+package codewars;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.stream.Collectors;
+
+public class HelptheBookSeller {
+
+    public static String stockSummary(String[] lstOfArt, String[] lstOf1stLetter) {
+        Map<String, Integer> result = new HashMap<>();
+
+        for (String s : lstOfArt) {
+            String[] splitRes = s.split(" ");
+
+            String s1 = splitRes[0];
+
+            for (String x : lstOf1stLetter) {
+                if (x.equalsIgnoreCase(String.valueOf(s1.toCharArray()[0]))) {
+
+                    if (result.containsKey(String.valueOf(s1.toCharArray()[0]))) {
+                        result.put(String.valueOf(s1.toCharArray()[0]), result.get(String.valueOf(s1.toCharArray()[0])) + Integer.valueOf(splitRes[1]));
+                    } else {
+                        result.put((String.valueOf(s1.toCharArray()[0])), Integer.valueOf(splitRes[1]));
+                    }
+                }
+            }
+        }
+        String content = result.entrySet()
+                .stream()
+                .map(e ->  "("+e.getKey() + " : " + e.getValue() + ")")
+                .collect(Collectors.joining("-"));
+
+        // your code here
+        return content;
+    }
+
+
+    public static void main(String[] args) {
+        String[] art = new String[]{"ABAR 200", "CDXE 500", "BKWR 250", "BTSQ 890", "DRTY 600"};
+        String[] cd = {"A", "B" ,"E"};
+        System.out.println(stockSummary(art, cd));
+    }
+}
diff --git a/src/hackerRank/interviewpreparationkit/CountingValleys.java b/src/hackerRank/interviewpreparationkit/CountingValleys.java
index 4551bb0..bb4d78c 100644
--- a/src/hackerRank/interviewpreparationkit/CountingValleys.java
+++ b/src/hackerRank/interviewpreparationkit/CountingValleys.java
@@ -2,7 +2,7 @@
  * Gary is an avid hiker. He tracks his hikes meticulously, paying close attention to small details like topography. During his last hike he took exactly n steps.
  * For every step he took, he noted if it was an uphill, U , or a downhill, D step. Gary's hikes start and end at sea level and each step up or down represents a 1 unit change in altitude.
  * We define the following terms:
- * 
+ *
  * A mountain is a sequence of consecutive steps above sea level, starting with a step up from sea level and ending with a step down to sea level.
  * A valley is a sequence of consecutive steps below sea level, starting with a step down from sea level and ending with a step up to sea level.
  */

From 15a84529367931acda8394cbd23a161f66367915 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Thu, 1 Aug 2019 19:58:33 -0400
Subject: [PATCH 34/35] codewars

---
 src/codewars/GiveMeADiamond.java | 42 ++++++++++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 src/codewars/GiveMeADiamond.java

diff --git a/src/codewars/GiveMeADiamond.java b/src/codewars/GiveMeADiamond.java
new file mode 100644
index 0000000..ee961db
--- /dev/null
+++ b/src/codewars/GiveMeADiamond.java
@@ -0,0 +1,42 @@
+/**
+ * Jamie is a programmer, and James' girlfriend. She likes diamonds, and wants a diamond string from James.
+ * Since James doesn't know how to make this happen, he needs your help.
+ *
+ * Task
+ * You need to return a string that looks like a diamond shape when printed on the screen, using asterisk (*) characters.
+ * Trailing spaces should be removed, and every line must be terminated with a newline character (\n).
+ *
+ * Return null/nil/None/... if the input is an even number or negative, as it is not possible to print a diamond of even or negative size.
+ *
+ */
+
+
+
+package codewars;
+
+public class GiveMeADiamond {
+
+    public static String print(int n) {
+        if (n % 2 == 0 || n <= 0) return null;
+        StringBuffer sb = new StringBuffer();
+        int mid = n / 2 + 1;
+        for (int i = 1; i <= n; i++) {
+            for (int j = 1; j <= Math.abs(mid - i); j++) {
+                sb.append(" ");
+            }
+            if (i <= mid) {
+                for (int j = 1; j <= 2 * i - 1; j++)
+                    sb.append("*");
+            } else {
+                for (int j = 1; j <= 2 * (2 * mid - i) - 1; j++)
+                    sb.append("*");
+            }
+            sb.append("\n");
+        }
+        return sb.toString();
+    }
+
+    public static void main(String[] args) {
+        System.out.println(print(5));
+    }
+}

From ae1e58490fdc64da13c9218c093c6c681c402fb2 Mon Sep 17 00:00:00 2001
From: Sameer Neema <sameer.neema02@gmail.com>
Date: Fri, 16 Aug 2019 02:29:21 -0400
Subject: [PATCH 35/35] leetcode

---
 Codes/Insertion_sort.java         | 55 ++++++++++++++++---------------
 src/careercup/IndexAndNumber.java | 35 ++++++++++++++++++++
 src/careercup/Test1.java          | 24 ++++++++++++++
 src/interviews/Test.java          |  4 +++
 src/leetcode/DefangingIPAddr.java | 13 ++++++++
 5 files changed, 105 insertions(+), 26 deletions(-)
 create mode 100644 src/careercup/IndexAndNumber.java
 create mode 100644 src/careercup/Test1.java
 create mode 100644 src/interviews/Test.java
 create mode 100644 src/leetcode/DefangingIPAddr.java

diff --git a/Codes/Insertion_sort.java b/Codes/Insertion_sort.java
index 40e0ec4..6bb42ca 100644
--- a/Codes/Insertion_sort.java
+++ b/Codes/Insertion_sort.java
@@ -1,28 +1,31 @@
 public class Insertion_sort {
-	void sort(int arr[]){
-		int n = arr.length;
-		for(int i=1;i<n;i++){
-			int key = arr[i];
-			int j = i-1;
-			
-			while(j>=0 && arr[j]>key){
-				arr[j+1] = arr[j];
-				j = j-1;
-			}
-			arr[j+1] = key;
-		}
-	}
-	void printarray(int arr[]){
-		int n = arr.length;
-		for(int i=0;i<n;i++){
-			System.out.println(arr[i] + " ");
-		}
-		System.out.println();
-	}
-public static void main(String[] args) {
-		Insertion_sort ob = new Insertion_sort();
-		int arr[] = {12,11,13,5,6,1,8};
-		ob.sort(arr);
-		ob.printarray(arr);
-	}
+    void sort(int arr[]) {
+        int n = arr.length;
+        for (int i = 1; i < n; i++) {
+            int key = arr[i];
+            int j = i - 1;
+
+            while (j >= 0 && arr[j] > key) {
+                arr[j + 1] = arr[j];
+                j = j - 1;
+            }
+            arr[j + 1] = key;
+        }
+
+    }
+
+    void printarray(int arr[]) {
+        int n = arr.length;
+        for (int i = 0; i < n; i++) {
+            System.out.println(arr[i] + " ");
+        }
+        System.out.println();
+    }
+
+    public static void main(String[] args) {
+        Insertion_sort ob = new Insertion_sort();
+        int arr[] = {12, 11, 13, 5, 6, 1, 8};
+        ob.sort(arr);
+        ob.printarray(arr);
+    }
 }
\ No newline at end of file
diff --git a/src/careercup/IndexAndNumber.java b/src/careercup/IndexAndNumber.java
new file mode 100644
index 0000000..e859197
--- /dev/null
+++ b/src/careercup/IndexAndNumber.java
@@ -0,0 +1,35 @@
+/**
+ * Print number that matches with the index in non-duplicate array
+ */
+
+package careercup;
+
+public class IndexAndNumber {
+
+
+    public static void print(Integer[] arr) {
+
+
+        for (int i = 0; i < arr.length; i++) {
+            if (i == arr[i]) {
+                System.out.println(arr[i]);
+            }
+        }
+    }
+
+      /*  List<Integer> strings = new ArrayList<>(Arrays.asList(arr));
+        strings.stream()
+                .collect(HashMap::new, (h, o) -> h.put(h.size(), o), (h, o) -> {})
+                .forEach((i, o) -> {
+                    System.out.println(String.format("%d => %s", i, o));
+                });
+    }*/
+
+
+    public static void main(String[] args) {
+
+        Integer[] a = {0, 1, 20, 3, 40, 5};
+
+        print(a);
+    }
+}
diff --git a/src/careercup/Test1.java b/src/careercup/Test1.java
new file mode 100644
index 0000000..404abb0
--- /dev/null
+++ b/src/careercup/Test1.java
@@ -0,0 +1,24 @@
+package careercup;
+
+public class Test1 {
+
+
+    public static String foo(String s) {
+
+        char[] chars = s.toCharArray();
+        int right = chars.length - 1;
+        for (int left = 0; left < right; left++) {
+            char swap = chars[left];
+            chars[left] = chars[right];
+            chars[right--] = swap;
+        }
+
+        return new String(chars);
+    }
+
+    public static void main(String[] args) {
+        System.out.println(foo("hello world"));
+    }
+
+
+}
diff --git a/src/interviews/Test.java b/src/interviews/Test.java
new file mode 100644
index 0000000..8004ef2
--- /dev/null
+++ b/src/interviews/Test.java
@@ -0,0 +1,4 @@
+package interviews;
+
+public class Test {
+}
diff --git a/src/leetcode/DefangingIPAddr.java b/src/leetcode/DefangingIPAddr.java
new file mode 100644
index 0000000..5bccbed
--- /dev/null
+++ b/src/leetcode/DefangingIPAddr.java
@@ -0,0 +1,13 @@
+package leetcode;
+
+public class DefangingIPAddr {
+
+    public static String defangIPaddr(String address) {
+        return address.replace(".","[.]");
+    }
+
+
+    public static void main(String[] args) {
+        System.out.println(defangIPaddr("1.1.1.1"));
+    }
+}