Minimum path in squares in Java
The challenge
You’re given a square consisting of random numbers, like so:
var square = [
[1,2,3],
[4,8,2],
[1,5,3]
];
Your job is …
Read Article →In-depth guides, insights, and best practices for modern software engineering
You’re given a square consisting of random numbers, like so:
var square = [
[1,2,3],
[4,8,2],
[1,5,3]
];
Your job is …
Read Article →Create a function that returns an array containing the first l digits from the nth diagonal of Pascal’s triangle.
n = 0 should …
Given an unsorted array of integer values, find the maximum positive sum of any contiguous range within the array.
An array containing …
Read Article →You’re going to provide a needy programmer a utility method that generates an infinite sized, sequential IntStream which contains …
In this challenge you must convert integers numbers from and to a negative-base binary system.
Negative-base systems can accommodate all …
Read Article →Consider the following series:
0,1,2,3,4,5,6,7,8,9,10,22,11,20,13,24...There is nothing special between numbers `` and 10.
Let’s …
Read Article →The palindromic number 595 is interesting because it can be written as the sum of consecutive squares: 6^2 + 7^2 + 8^2 + 9^2 + 10^2 + …
Implement a function that receives two IPv4 addresses, and returns the number of addresses between them (including the first one, …
Read Article →Given two different positions on a chess board, find the least number of moves it would take a knight to get from one to the other. The …
Read Article →Write a function that makes a list of strings representing all of the ways you can balance n pairs of parentheses
Your task in order to complete this challenge is to write a function which formats a duration, given as a number of seconds, in a …
Read Article →Consider the following expansion:
// because "ab" repeats 3 times
solve("3(ab)") == "ababab"
// because …
Read Article →