Code arranged

Author: manjunatha

Diff for: algorithms/graph/backtracking/CountNoOfPaths.java

@@ -2,7 +2,6 @@
 
 /**
  * Count number of paths from source(0,0) to (r-1, c-1)
- * @see https://www.geeksforgeeks.org/count-number-ways-reach-destination-maze/
  * @author Manjunath Asundi
  */
 public class CountNoOfPaths {

Diff for: algorithms/graph/shortest/Floydwarshall.java

@@ -2,7 +2,6 @@
 
 /**
  * @author Manjunath Asundi
- * @see https://www.geeksforgeeks.org/floyd-warshall-algorithm-dp-16/# 
  * Find all shortest paths from each vertex
  */
 public class Floydwarshall {

Diff for: datastructure/hashmap/ArrayContainsContiguousElements.java

@@ -29,7 +29,6 @@ static boolean isArrayContainsContiguousIntegers(int arr[]) {
 
 /**
  * ArrayContainsContiguousElements
- * link https://www.geeksforgeeks.org/check-array-contains-contiguous-integers-duplicates-allowed/
  */
 public class ArrayContainsContiguousElements {
 

Diff for: datastructure/hashmap/DifferenceOfMaxMinFrequency.java

@@ -33,7 +33,6 @@ static int differenceBetweenMaxMinFrequency(int arr[]) {
 
 /**
  * DifferenceOfMaxMinFrequency link
- * https://www.geeksforgeeks.org/difference-between-highest-and-least-frequencies-in-an-array/
  */
 public class DifferenceOfMaxMinFrequency {
     public static void main(String[] args) {

Diff for: datastructure/hashmap/DivisibleByOneAnother.java

@@ -30,7 +30,6 @@ static Set<Integer> findSpecialNumbers(List<Integer> list) {
 
 /**
  * DivisibleByOneAnother
- * link https://www.geeksforgeeks.org/divisibility-check/
  */
 public class DivisibleByOneAnother {
 

Diff for: datastructure/hashmap/EmpMgrCount.java

@@ -54,7 +54,6 @@ static int populateResult(String emp, Map<String, List<String>> mgrEmp, Map<Stri
 
 /**
  * EmpMgrCount
- * link https://www.geeksforgeeks.org/find-number-of-employees-under-every-manager/
  */
 public class EmpMgrCount {
 

Diff for: datastructure/hashmap/FindABCD.java

@@ -29,7 +29,6 @@ static void findFourElements(List<Integer> list) {
 
 /**
  * find A+B=C+D
- * Link https://www.geeksforgeeks.org/find-four-elements-a-b-c-and-d-in-an-array-such-that-ab-cd/
  */
 public class FindABCD {
     public static void main(String[] args) {

Diff for: datastructure/hashmap/LargestSubArrayWithSumZero.java

@@ -26,7 +26,6 @@ static int printLargestSubArrayWithSumZero(int arr[]) {
 
 /**
  * LargestSubArrayWithSumZero Link
- * https://www.geeksforgeeks.org/find-the-largest-subarray-with-0-sum/
  */
 public class LargestSubArrayWithSumZero {
     public static void main(String[] args) {

Diff for: datastructure/hashmap/MaxLengthOfConsSequence.java

@@ -26,7 +26,6 @@ static int findMaxLengthOfConsecutiveSequence(int arr[]) {
 
 /**
  * MaxLengthOfConsSequence
- * link https://www.geeksforgeeks.org/longest-increasing-consecutive-subsequence/
  */
 public class MaxLengthOfConsSequence {
     public static void main(String[] args) {

Diff for: datastructure/hashmap/PrintMaxLengthConSeq.java

@@ -30,7 +30,6 @@ static void findMaxLengthOfConsecutiveSequence(int arr[]) {
 
 /**
  * PrintMaxLengthConSeq
- * link https://www.geeksforgeeks.org/printing-longest-increasing-consecutive-subsequence/
  */
 public class PrintMaxLengthConSeq {
 

Diff for: datastructure/hashmap/SumOfTwo.java

@@ -4,19 +4,22 @@
 import java.util.Set;
 
 /**
- * @author Manjunath Asundi 
+ * @author Manjunath Asundi
  */
 public class SumOfTwo {
 
     static void sumOfTwoElements(int arr[], int sum) {
         Set<Integer> set = new HashSet<Integer>();
         for (int i = 0; i < arr.length; i++) {
-            if(set.contains(sum-arr[i])) System.out.println(arr[i] + " "+ (sum-arr[i])); 
-            else set.add(arr[i]);
+            if (set.contains(sum - arr[i]))
+                System.out.println(arr[i] + " " + (sum - arr[i]));
+            else
+                set.add(arr[i]);
         }
     }
+
     public static void main(String[] args) {
-        int arr[] = {3,2,4,5,7,11,9,8,3,13};
+        int arr[] = { 3, 2, 4, 5, 7, 11, 9, 8, 3, 13 };
         int sum = 12;
         sumOfTwoElements(arr, sum);
     }

Diff for: datastructure/hashmap/hard/TripletsSumEqualToK.java

@@ -3,7 +3,9 @@
 import java.util.Arrays;
 
 /**
- * @author Manjunath Asundi Print all triplets those sum equal to K
+ * Print all triplets those sum equal to K
+ * 
+ * @author Manjunath Asundi
  */
 public class TripletsSumEqualToK {
     public static void findTripletsSumEqualToK(int arr[], int k) {

Diff for: datastructure/heap/ConnectRopesWithMaxCost.java

@@ -5,9 +5,7 @@
 
 /**
  * ConnectRopesWithMinCost
- * 
  * @apiNote Connect N ropes with maximum cost
- * @see https://www.geeksforgeeks.org/connect-n-ropes-minimum-cost/
  * @author Manjunath Asundi
  */
 public class ConnectRopesWithMaxCost {

Diff for: datastructure/heap/ConnectRopesWithMinCost.java

@@ -7,7 +7,6 @@
  * ConnectRopesWithMinCost
  * 
  * @apiNote Connect N ropes with minimum cost
- * @see https://www.geeksforgeeks.org/connect-n-ropes-minimum-cost/
  * @author Manjunath Asundi
  */
 public class ConnectRopesWithMinCost {

Diff for: datastructure/heap/MaxHeap.java

@@ -1,7 +1,7 @@
 package datastructure.heap;
 
 /**
- * @author Manjunath Asundi
+ * @author Manjunath Asundi MinHeap
  */
 class InnerMaxHeap {
 
@@ -35,9 +35,6 @@ static void heapify(int arr[]) {
     }
 }
 
-/**
- * MinHeap
- */
 public class MaxHeap {
     public static void main(String[] args) {
         int arr[] = { 4, 10, 3, 5, 1 };

Diff for: datastructure/heap/MinHeap.java

@@ -1,6 +1,7 @@
 package datastructure.heap;
 
 /**
+ * MaxHeap
  * @author Manjunath Asundi 
  */
 class InnerMinHeap {
@@ -23,8 +24,8 @@ static void buildMinHeap(int arr[], int root, int n) {
 
     static void heapify(int arr[]) {
         int n = arr.length;
-        for (int i = (n -1) / 2; i >= 0; i--)
-            buildMinHeap(arr, i, n-1);
+        for (int i = (n - 1) / 2; i >= 0; i--)
+            buildMinHeap(arr, i, n - 1);
 
         for (int i = n - 1; i >= 0; i--) {
             buildMinHeap(arr, 0, i);
@@ -42,9 +43,6 @@ static void printArray(int arr[]) {
     }
 }
 
-/**
- * MaxHeap
- */
 public class MinHeap {
     public static void main(String[] args) {
         int arr[] = { 4, 10, 3, 5, 1 };

Diff for: datastructure/linkedlist/FindMiddleNode.java

@@ -1,38 +1,39 @@
 package datastructure.linkedlist;
 
 /**
- * @author Manjunath Asundi 
+ * Find middle node from linkedlist
+ * 
+ * @author Manjunath Asundi
  */
 class Node {
     int data;
     Node next;
+
     public Node(int data) {
         this.data = data;
         this.next = null;
-    }    
+    }
 }
 
-/**
- * FindMiddleNode
- */
 public class FindMiddleNode {
 
     static void findMiddleElement(Node list) {
-        Node fastPointer = list, slowPointer = list; 
-        while(fastPointer.next!=null && fastPointer!=null) {
+        Node fastPointer = list, slowPointer = list;
+        while (fastPointer.next != null && fastPointer != null) {
             slowPointer = slowPointer.next;
             fastPointer = fastPointer.next.next;
-        }  
-        System.out.println("Middle Element:"+ slowPointer.data);
+        }
+        System.out.println("Middle Element:" + slowPointer.data);
     }
 
     static void printList(Node list) {
-        while(list!=null) {
+        while (list != null) {
             System.out.print(list.data + " ");
             list = list.next;
         }
         System.out.println();
     }
+
     public static void main(String[] args) {
         Node list = new Node(1);
         list.next = new Node(2);

Diff for: datastructure/tree/bst/KthSmallest.java

@@ -3,7 +3,7 @@
 import datastructure.tree.Node;
 
 /**
- * @author Manjunath Asundi 
+ * @author Manjunath Asundi
  */
 class InnerKthSmallest {
     static int count = 0;
@@ -23,7 +23,6 @@ static void findKthSmallest(Node<Integer> tree, int k) {
 
 /**
  * KthSmallest link
- * https://www.geeksforgeeks.org/find-k-th-smallest-element-in-bst-order-statistics-in-bst/
  */
 public class KthSmallest {
     public static void main(String[] args) {

Diff for: problemsolving/DivideAbyB.java

@@ -4,7 +4,9 @@
 import java.util.Map;
 
 /**
- * Divide A by B without using float data type and repeating floating point string should need to be enclosed by parenthesis
+ * Divide A by B without using float data type and repeating floating point
+ * string should need to be enclosed by parenthesis
+ * 
  * @author Manjunath Asundi
  */
 public class DivideAbyB {
@@ -40,5 +42,6 @@ public static void main(String[] args) {
         System.out.println(divide(1, 97));
         System.out.println(divide(4, 11));
         System.out.println(divide(18, 13));
+        System.out.println(divide(10, 7));
     }
 }