Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I checked each consequent combination of (i, j, k), if it is valid according to condition. There is a catch. I had to stop an iteration if array[j] – array[i]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I calculated time in the cycle when counter value is 1: last_time_next_cycle = actual_cycle_time + 2 * (last_time_actual_cycle – last_time_previous_cycle). The difference in seconds between cycle 0 and cycle 1 is 3, which is always like that. For a given […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Create index pairs variations for all indexes that pair is unique – it means when (i, j) exists (j, i) is the same. For each pair calculate the sum of values at corresponding index. If is divisible, count them and […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution There are 2 options To split the string by regular expression”[A-Z]” and then print the length of an array returned from splitting. To iterate over all characters, count the uppercase and print their count + 1 I created solution in: […]
I participated in an another programming contest organized by Hackerrank. It was Week of Code 22 from 8.8.2016, 09:00 AM CEST to 15.8.2016 AM CEST It was my 14th contest at Hackerrank and I think I was quite successfull because I earned my second bronze medal. I was able to solve 3 challenges: Cookie Party […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Read all ratings and compare it according to the defined conditions: If ai > bi, then Alice is awarded 1 point If ai < bi, then Bob is awarded 1 point If ai = bi, then neither person receives a […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Contiguous sum – using Kadane’s algorithm Non-contiguous sum – filter all positive elements from given array and sum them. If this array is empty. Take the greatest element. I created solution in: Scala Java JavaScript Ruby All solutions are also […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution function f is an applied algebraic expression to x as in problem description function area is area of the cycle ($$\Pi r^2$$) with center 0 and radius value of function(x) function summation is applied once for function f and one […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution Until the sticks array is empty: print the length of sticks array sort the array get the minimum value as first element of the array cut the array filtering only values greater than minimum I created solution in: Scala Java […]
Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We have to prevent timeout, because there is big upper constraint. For a given numbers a and b we can find out all square numbers with formula: . There is a special case when a and b are […]