Merge branch 'master' into master

interviewQuestions/SubarrayWithZeroSum.java

@@ -32,8 +32,9 @@ public static void main(String[] args) {
 		for (int element : a) {
 			set.add(sum);
 			sum += element;
-			if(set.contains(sum-k)) {//Zero sum will only exist if the cumulative sum of the elements excluding the current element
-				                  //and after including the current element are equal
+      //Zero sum will only exist if the cumulative sum of the elements excluding the current element
+      //and after including the current element are equal
+			if (set.contains(sum - k)) {
 				found = true;
 				break;
 			}

linkedLists/MainLinkedList.java

@@ -7,13 +7,16 @@ public class MainLinkedList {
 	public static void main(String[] args) {
 
 		MyLinkedList<String> myLL = new MyLinkedList();
-
-		for(int i = 0; i<10; i++) {
-			myLL.add(i+"added"); // add method use to add a element in the last node of the linked list
-		}
 
+
+		for (int i = 0; i < 10; i++) {
+			// add method use to add a element in the last node of the linked list
+      myLL.add(i + "added");
+
+		}
+// print method use to print the linked list
 		myLL.print();
 	}
 
 }
-	
+

linkedLists/MyLinkedList.java

@@ -2,21 +2,27 @@
 
 public class MyLinkedList<E> {
 
-	Node<E> head; //E is the Class defining the type of the inputs accepted
-
+
+//E is the Class defining the type of the inputs accepted
+	Node<E> head;
+
 	public void add(E data) {
 		Node<E> toAdd = new Node<E>(data);
 
 		if (isEmpty()) {
 			head = toAdd;
 			return;
 		}
-
-		Node<E> temp = head;//initialising temp as head to traverse the Linked list without breaking the chain
-		while(temp.next != null) {// control from loop exits as soon as next element becomes null
+
+//initialising temp as head to traverse the Linked list without breaking the chain
+		Node<E> temp = head;
+      // control from loop exits as soon as next element becomes null
+		while (temp.next != null) {
+
 			temp = temp.next;
 		}
-		temp.next = toAdd;// adding the new node after reacing to the end of linked list
+    // adding the new node after reaching to the end of linked list
+		temp.next = toAdd;
 	}
 
 	void print() {
@@ -67,8 +73,10 @@ public E getLast() throws Exception {
 	public static class Node<E> {
 		public E data;
 		public Node<E> next;
-
-		public Node(E data) { //constructor
+
+//constructor
+		public Node(E data) {
+
 			this.data = data;
 			next = null;
 		}

vectorAndStacks/MainClass.java

@@ -5,12 +5,18 @@ public class MainClass {
 	public static void main(String[] args) throws Exception {
 
 		MyStack<Integer> stack = new MyStack<>();
-
-		int popped = stack.pop();// delete the top element of the stack.
-
-		System.out.println(popped);//print the last popped element of the stack.
-
-		System.out.println(stack.peek());//print the top element of the stack.
+
+    // delete the top element of the stack.
+		int popped = stack.pop();
+
+    //print the last popped element of the stack.
+		System.out.println(popped);
+
+    //print the top element of the stack.
+		int peeked = stack.peek();
+
+		System.out.println(peeked);
+
 	}
 
 }

vectorAndStacks/MyStack.java

@@ -11,15 +11,19 @@ void push(E e) {
 	}
 
 	E pop() throws Exception {
+//handling the empty linked list while trying to pop
 		if(ll.isEmpty()) {
-			throw new Exception("Popping from empty stack is not allowed");//handling the empty linked list while trying to pop
+			throw new Exception("Popping from empty stack is not allowed");
+
 		}
 		return ll.removeLast();
 	}
 
 	E peek() throws Exception {
+//handling the empty linked list while trying to peek
 		if(ll.isEmpty()) {
-			throw new Exception("Peeking from empty stack is not allowed");//handling the empty linked list while trying to peek
+			throw new Exception("Peeking from empty stack is not allowed");
+
 		}
 		return ll.getLast();
 	}