DOne

Author: Raja Reddy K

bin/.gitignore

@@ -1 +1,18 @@
+/Practies/
+/chapter01introduction/
+/chapter02recursionandbacktracking/
+/chapter03linkedlists/
+/chapter04stacks/
+/chapter05queues/
+/chapter06trees/
+/chapter07priorityqueues/
+/chapter08disjointsets/
+/chapter09graphs/
+/chapter10sorting/
+/chapter11searching/
+/chapter12selectionalgorithms/
+/chapter15stringalgorithms/
+/chapter17greedyalgorithms/
+/chapter18divideandconquer/
+/chapter19dynamicprogramming/
 /chapter21miscconcepts/

bin/chapter03linkedlists/ReverseALinkedList.class

@@ -0,0 +1,30 @@
+package Practies;
+
+import chapter03linkedlists.ListNode;
+
+public class LoopInALinkedList2 {
+
+	public static void findLoop(ListNode head) {
+		ListNode slowpt = head;
+		ListNode fastpt = head;
+
+		boolean loopfound = false;
+		while (fastpt != null && fastpt.next != null) {
+			fastpt = fastpt.next.next;
+			slowpt = slowpt.next;
+			if (fastpt == slowpt) {
+				loopfound = true;
+				break;
+			}
+
+		}
+		if (loopfound) {
+			slowpt = head;
+			while (slowpt != fastpt) {
+				slowpt = slowpt.next;
+				fastpt = fastpt.next;
+			}
+		}
+	}
+
+}

bin/chapter04stacks/DynamicArrayStack.class

@@ -0,0 +1,53 @@
+/*Copyright (c) 26-Mar-2018 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: MiniMaxSum.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+package Practies;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class MiniMaxSum {
+
+	/*
+	 * Complete the miniMaxSum function below.
+	 */
+	static void miniMaxSum(int[] arr) {
+		int n = arr.length;
+		int valueI = 0;
+		long max = 0;
+		long min = 0;
+		Arrays.sort(arr);
+		for (int j = 0; j < n-1; j++) {
+
+			min =min+  arr[j+1];
+			max=max+arr[j];
+		}
+
+		System.out.println(min + "\t" + max );
+	}
+
+	private static final Scanner scan = new Scanner(System.in);
+
+	public static void main(String[] args) {
+		int[] arr = new int[5];
+
+		String[] arrItems = scan.nextLine().split(" ");
+
+		for (int arrItr = 0; arrItr < 5; arrItr++) {
+			int arrItem = Integer.parseInt(arrItems[arrItr].trim());
+			arr[arrItr] = arrItem;
+		}
+
+		miniMaxSum(arr);
+	}
+}

bin/chapter04stacks/SortingStack.class

@@ -0,0 +1,44 @@
+/*Copyright (c) 09-Mar-2016 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: MySetWithCollection.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+package Practies;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.TreeSet;
+import java.util.stream.Collectors;
+
+public class MySetWithCollection {
+	
+
+	public static void main(String a[]) {
+		List<String> li = new ArrayList<String>();
+		li.add("one");
+		li.add("two");
+		li.add("three");
+		li.add("four");
+		li.add("a");
+		HashMap<String, Integer> map = new HashMap<>();
+		map.put("A", 1);
+		map.put("b", 3);
+		map.put("c", 8);
+		map.put("d", 6);
+		map.put("e", 2);
+		map.put("f", 7);
+		System.out.println("List: " + li);
+		TreeSet<String> myset = new TreeSet<String>(li);
+		System.out.println("Set: " + myset);
+	}
+}

bin/chapter04stacks/StackSets.class

@@ -0,0 +1,49 @@
+/*Copyright (c) 26-Mar-2018 CareerMonk Publications and others.
+ * E-Mail           	: info@careermonk.com 
+ * Creation Date    	: 2015-01-10 06:15:46 
+ * Last modification	: 2006-05-31 
+               by		: Narasimha Karumanchi 
+ * File Name			: Staircase.java
+ * Book Title			: Data Structures And Algorithms Made In Java
+ * Warranty         	: This software is provided "as is" without any 
+ * 							warranty; without even the implied warranty of 
+ * 							merchantability or fitness for a particular purpose. 
+ * 
+ */
+
+
+package Practies;
+
+import java.util.Scanner;
+
+public class Staircase {
+
+    /*
+     * Complete the staircase function below.
+     */
+    static void staircase(int n) {
+     
+        for(int i=0;i<n;i++){
+           for(int j=1;j<=n;j++){
+               if(j<n-i){
+            System.out.print(" ");
+               }else{
+                 System.out.print("#");  
+               }
+              
+        }
+           
+             System.out.println("");
+        }
+         
+
+    }
+
+    private static final Scanner scan = new Scanner(System.in);
+
+    public static void main(String[] args) {
+        int n = Integer.parseInt(scan.nextLine().trim());
+
+        staircase(n);
+    }
+}