Write a java program to find sum of digits of a number. Given an input number, we have to write a java code to calculate sum of digits of a number.
For example –
i)
Input : 256
Output : 13 (2+5+60
ii)
Input : 15
Output : 6 (1+5)
In this tutorial, I am going to discuss a very famous interview problem find maximum subarray sum (Kadane’s algorithm).
Given an integer array of N elements, find the maximum sum contiguous subarray (containing at least one element).
For example –
Example 1 –
Input: { 1, 2, -5, 4, 3, 8 , 5 }
Output: 20
The maximum sum of a sub–array in this array is 20. And the sub–array is (4, 3, 8, 5).
Example 2 –
Input: {-2, -1}
Output: -1
Example 3 –
Input: { 1, -3, 2, -5, 7, 6, -1, -4, 11, -23}
Output: 19
The largest sum contiguous subarray in this array is 19 ( 7, 6, -1, -4, 11).