Problem The max subarray problem is a problem where you have to find the contiguous subarray (containing at least one number) which has the largest sum, and return the sum. The problem can be...
How to split an int number into separate digits is a surprisingly common question and there is no native method of doing this in Java. What we are trying to achieve is given the...
Problem This is a hard problem that was asked by Google in a software engineering interview. Given an array of integers and a number k, where 1 <= k <= length of the array,...
This tutorial we are going to go through the problem and solution for the common question of ‘Use recursion to create a range of numbers’. An example of the question can be found on...
