First Variation on Caesar Cipher in Java
The challenge
The action of a Caesar cipher is to replace each plaintext letter (plaintext letters are from ‘a’ to ‘z’ or from ‘A’ …
Read Article →342 articles about java development, tools, and best practices
The action of a Caesar cipher is to replace each plaintext letter (plaintext letters are from ‘a’ to ‘z’ or from ‘A’ …
Read Article →The first century spans from the year 1 up to and including the year 100, The second – from the year 101 up to and including the year …
Read Article →You have a positive number n
consisting of digits. You can do at most one operation: Choosing the index of a digit in the number, remove …
You are given a non-null array of integers. Implement the method arrayToTree which creates a binary tree from its values in accordance …
Read Article →You will have a list of rationals in the form
{ {numer_1, denom_1} , ... {numer_n, denom_n} }
or
[ [numer_1, denom_1] , ... [numer_n, …
Read Article →
Given a positive number n > 1 find the prime factor decomposition of n. The result will be a string with the following form : …
Read Article →The maximum sum subarray problem consists in finding the maximum sum of a contiguous subsequence in an array or list of integers: …
Read Article →Let’s implement the Luhn Algorithm, which is used to help validate credit card numbers.
Given a positive integer of up to 16 …
Read Article →There is an array with some numbers. All numbers are equal except for one. Try to find it!
Solution.findUniq(new double[]{ 1, 1, 1, 2, …
Read Article →
You are given an array (which will have a length of at least 3, but could be very large) containing integers. The array is either …
Read Article →Write a method that takes an array of consecutive (increasing) letters as input and that returns the missing letter in the array.
You …
Read Article →Write a function that takes a string of braces, and determines if the order of the braces is valid. It should return true
if the string …