Added more solutions inside Practice>Algorithms category

Author: kanahaiya

.project

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>Hackerrank-Solutions</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+	</buildSpec>
+	<natures>
+	</natures>
+</projectDescription>

HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/dynamicprogramming/TheMaximumSubarray.java

@@ -0,0 +1,40 @@
+package com.javaaid.hackerrank.solutions.algorithms.dynamicprogramming;
+
+import java.util.Scanner;
+
+public class TheMaximumSubarray {
+
+	static int[] maxSubarray(int[] arr) {
+		int max_so_far = Integer.MIN_VALUE, max_end_here = 0, maxSum = 0;
+		int ans[] = new int[2];
+		for (int i = 0; i < arr.length; i++) {
+			if (arr[i] > 0)
+				maxSum += arr[i];
+			max_end_here += arr[i];
+			max_end_here = Math.max(max_end_here, arr[i]);
+			max_so_far = Math.max(max_so_far, max_end_here);
+		}
+		ans[0] = max_so_far;
+		ans[1] = max_so_far < 0 ? max_so_far : maxSum;
+		return ans;
+
+	}
+	public static void main(String[] args) {
+		Scanner in = new Scanner(System.in);
+		int t = in.nextInt();
+		for (int a0 = 0; a0 < t; a0++) {
+			int n = in.nextInt();
+			int[] arr = new int[n];
+			for (int arr_i = 0; arr_i < n; arr_i++) {
+				arr[arr_i] = in.nextInt();
+			}
+			int[] result = maxSubarray(arr);
+			for (int i = 0; i < result.length; i++) {
+				System.out.print(result[i] + (i != result.length - 1 ? " " : ""));
+			}
+			System.out.println("");
+
+		}
+		in.close();
+	}
+}

HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/recursion/RecursiveDigitSum.java

@@ -0,0 +1,45 @@
+package com.javaaid.hackerrank.solutions.algorithms.recursion;
+
+import java.math.BigInteger;
+
+public class RecursiveDigitSum {
+
+	// method 1 -> recursive solution
+	static int digitSum(String n, int k) {
+		long superDigit = getSuperDigit(n);
+		long n1 = getSuperDigit(superDigit);
+		long k1 = getSuperDigit(k);
+
+		long result = n1 * k1;
+
+		while (result / 10 != 0) {
+			result = getSuperDigit(result);
+		}
+
+		return (int) result;
+	}
+
+	private static long getSuperDigit(String n) {
+		if (n == null || n.isEmpty())
+			return 0;
+		return (n.charAt(0) - '0') + getSuperDigit(n.substring(1));
+	}
+
+	private static long getSuperDigit(long n) {
+		if (n / 10 != 0)
+			return (n % 10) + getSuperDigit(n / 10);
+		return (n % 10);
+	}
+
+	// method 2 > Iterative solutions hint -->http://applet-magic.com/digitsummod9.htm
+	static int digitSumUsingMathTrick(String n, int k) {
+		BigInteger n1 = new BigInteger(n);
+		n1 = n1.multiply(new BigInteger(k + ""));
+		n1 = n1.remainder(new BigInteger("9"));
+		return n1.intValue() == 0 ? 9 : n1.intValue();
+
+	}
+	
+	
+
+}

README.md

@@ -180,7 +180,9 @@
 |         Strings  	      | [Caesar Cipher: Encryption](https://www.hackerrank.com/challenges/linkedin-practice-caesar-cipher/problem)         					| [CaesarCipherEncryption.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/strings/CaesarCipherEncryption.java)        							      |
 |         Strings  	      | [Game of Thrones - I](https://www.hackerrank.com/challenges/game-of-thrones/problem)         										| [GameOfThronesI.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/strings/GameOfThronesI.java)        							     				  |
 |         Strings  	      | [Sherlock and the Valid String](https://www.hackerrank.com/challenges/sherlock-and-valid-string/problem)         					| [SherlockAndTheValidString.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/strings/SherlockAndTheValidString.java)        							  |
+|   	 Recursion  	  | [Recursive Digit Sum](https://www.hackerrank.com/challenges/recursive-digit-sum/problem)         						   			| [RecursiveDigitSum.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/recursion/RecursiveDigitSum.java)        							     		  |
 |   Dynamic Programming   | [Fibonacci Modified](https://www.hackerrank.com/challenges/fibonacci-modified/problem)         						   				| [FibonacciModified.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/dynamicprogramming/FibonacciModified.java)        							      |
+|   Dynamic Programming   | [The Maximum Subarray](https://www.hackerrank.com/challenges/maxsubarray/problem)         						   					| [TheMaximumSubarray.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/dynamicprogramming/TheMaximumSubarray.java)        							  |
 |    Bit Manipulation     | [Lonely Integer](https://www.hackerrank.com/challenges/lonely-integer/problem)         						   						| [LonelyInteger.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/bitmanipulation/LonelyInteger.java)        							      			  |
 |    Bit Manipulation     | [Bit Manipulation: Lonely Integer](https://www.hackerrank.com/challenges/ctci-lonely-integer/problem)         						| [BitManipulationLonelyInteger.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/bitmanipulation/BitManipulationLonelyInteger.java)        			  |
 |    Bit Manipulation     | [Sum vs XOR](https://www.hackerrank.com/challenges/sum-vs-xor/problem)         						   							    | [SumvsXOR.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/Algorithms/src/main/java/com/javaaid/hackerrank/solutions/algorithms/bitmanipulation/SumvsXOR.java)        							      				      |
@@ -221,7 +223,7 @@
 |      Arrays     | [Left Rotation](https://www.hackerrank.com/challenges/array-left-rotation)                                                                           		  | [LeftRotation.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/arrays/LeftRotation.java)                                                        			  		|
 |      Arrays     | [Big Sorting](https://www.hackerrank.com/challenges/big-sorting/problem)                                                                             		  | [BigSorting.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/arrays/BigSorting.java)                                                            			  		|
 |      Arrays     | [Sparse Arrays](https://www.hackerrank.com/challenges/sparse-arrays/problem)                                                                         		  | [SparseArrays.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/arrays/SparseArrays.java)                                                        			  		|
-|      Arrays     | [Array Manipulation](https://www.hackerrank.com/challenges/crush/problem)                                                                         	  		  | [ArrayManipulation.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/arrays/ArrayManipulation.java)                                                 						|
+|      Arrays     | [Array Manipulation](https://www.hackerrank.com/challenges/crush/problem)                                                                         	  		  | [ArrayManipulation.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/arrays/ArrayManipulation.java)                                                 				|
 |      Stacks     | [Maximum Element](https://www.hackerrank.com/challenges/maximum-element)                                                                             		  | [MaximumElement.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/stacks/MaximumElement.java)                                                    			  		|
 |      Stacks     | [Balanced Brackets](https://www.hackerrank.com/challenges/balanced-brackets)                                                                         		  | [BalancedBrackets.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/stacks/BalancedBrackets.java)                                                			  		|
 |      Stacks     | [Equal Stacks](https://www.hackerrank.com/challenges/equal-stacks/problem)                                                                           		  | [EqualStacks.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/stacks/EqualStacks.java)                                                          			  		|
@@ -246,7 +248,7 @@
 |   Linked List   | [Get Node Value](https://www.hackerrank.com/challenges/get-the-value-of-the-node-at-a-specific-position-from-the-tail/problem)                       		  | [GetNodeValue.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/GetNodeValue.java)           													  		|			
 |   Linked List   | [Delete duplicate-value nodes from a sorted linked list](https://www.hackerrank.com/challenges/delete-duplicate-value-nodes-from-a-sorted-linked-list/problem)| [DeleteDuplicateValueNodesFromASortedLinkedList.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/DeleteDuplicateValueNodesFromASortedLinkedList.java) |			
 |   Linked List   | [Cycle Detection](https://www.hackerrank.com/challenges/detect-whether-a-linked-list-contains-a-cycle/problem)                       		  				  | [CycleDetection.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/CycleDetection.java)           														|			
-|   Linked List   | [Find Merge Point of Two Lists](https://www.hackerrank.com/challenges/find-the-merge-point-of-two-joined-linked-lists/problem)                       		  | [FindMergePointOfTwoLists.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/FindMergePointOfTwoLists.java)           								|			
+|   Linked List   | [Find Merge Point of Two Lists](https://www.hackerrank.com/challenges/find-the-merge-point-of-two-joined-linked-lists/problem)                       		  | [FindMergePointOfTwoLists.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/FindMergePointOfTwoLists.java)           									|			
 |   Linked List   | [Inserting a Node Into a Sorted Doubly Linked List](https://www.hackerrank.com/challenges/insert-a-node-into-a-sorted-doubly-linked-list/problem)             | [InsertingANodeIntoASortedDoublyLinkedList.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/InsertingANodeIntoASortedDoublyLinkedList.java)     		|			
 |   Linked List   | [Reverse a doubly linked list](https://www.hackerrank.com/challenges/reverse-a-doubly-linked-list/problem)                       		 					  | [ReverseADoublyLinkedList.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/linkedlists/ReverseADoublyLinkedList.java)           									|			
 |      Tries      | [Contacts](https://www.hackerrank.com/challenges/contacts)                                                                                           		  | [Contacts.java](https://github.com/Java-aid/Hackerrank-Solutions/blob/master/HackerRankDashboard/CoreCS/DataStructures/src/main/java/com/javaaid/hackerrank/solutions/datastructures/tries/Contacts.java)                                                                 			  		|