Leet Code Archives

3rd April 2020

Max Subarray Problem – Kadane’s Algorithm (Dynamic Programming)

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 found here Test Cases Input Output [-2,1,-3,4,-1,2,1,-5,4] 6 Solution The way to solve this problem is use Kadane’s algorithm: The way that this algorithm works is...

Java/Leet Code Comments: 0

2nd April 2020

How to split an int number into separate digits?

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 number 524, how can we split the number into it’s individual digits e.g. 5, 2, 4. The simplest way of doing this is through using the...

Java/Leet Code Comments: 0

31st March 2020

Find maximum for every window of size k in an array – Google Interview Question

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, compute the maximum values of each subarray of length k and print the max values. Test Cases Input Output [10, 5, 2, 7, 8, 7] 10,...

Leet Code Comment: 1

15th March 2020

Use Recursion to Create a Range of Numbers

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 the Free Code Camp website. Video Tutorial Test Cases Input Output StartNum = 6, EndNum = 9 6, 7, 8, 9 StartNum = 1, EndNum =...

Leet Code/Tutorial Comment: 1

JakTech

Tag: Leet Code

Max Subarray Problem – Kadane’s Algorithm (Dynamic Programming)

How to split an int number into separate digits?

Find maximum for every window of size k in an array – Google Interview Question

Use Recursion to Create a Range of Numbers