CodeFights | Codes for CodeFights | Wrapper library

i got stucked in a chalenge in codeFights.my code pass the simple test and fail in just 2 from five of hidden tests her is the chalenge instruction:

Ratiorg got statues of different sizes as a present from CodeMaster for his birthday, each statue having an non-negative integer size. Since he likes to make things perfect, he wants to arrange them from smallest to largest so that each statue will be bigger than the previous one exactly by 1. He may need some additional statues to be able to accomplish that. Help him figure out the minimum number of additional statues needed.

I am coming from Python, but I have seen this code in Codefights for the C language and I cannot find with google what .arr means. I don't see there is any variable in the code either:

I am working on a problem (for fun) that is honestly making me confuse myself.

If I have a matrix like so:

I'm trying to solve the problem below from CodeFights. I left my answer in Java after the question. The code works for all the problems, except the last one. Time limit exception is reported. What could I do to make it run below 3000ms (CodeFights requirement)?

Note: Write a solution with O(n) time complexity and O(1) additional space complexity, since this is what you would be asked to do during a real interview.

Given an array a that contains only numbers in the range from 1 to a.length, find the first duplicate number for which the second occurrence has the minimal index. In other words, if there are more than 1 duplicated numbers, return the number for which the second occurrence has a smaller index than the second occurrence of the other number does. If there are no such elements, return -1.

Example

For a = [2, 3, 3, 1, 5, 2], the output should be firstDuplicate(a) = 3.

There are 2 duplicates: numbers 2 and 3. The second occurrence of 3 has a smaller index than than second occurrence of 2 does, so the answer is 3.

For a = [2, 4, 3, 5, 1], the output should be firstDuplicate(a) = -1.

Input/Output

[time limit] 3000ms (java) [input] array.integer a

Guaranteed constraints: 1 ≤ a.length ≤ 105, 1 ≤ a[i] ≤ a.length.

[output] integer

The element in a that occurs in the array more than once and has the minimal index for its second occurrence. If there are no such elements, return -1.

I am learning to code, and presently trying to solve a problem on codefights;

Consider a sequence of numbers a0, a1, ..., an, in which an element is equal to the sum of squared digits of the previous element. The sequence ends once an element that has already been in the sequence appears again.

Given the first element a0, find the length of the sequence.

Input/Output

[time limit] 4000ms (py3) [input] integer a0

First element of a sequence, positive integer.

Guaranteed constraints: 1 ≤ a0 ≤ 650.

[output] integer And here is my code:

def value(a):

So I am trying to solve this task "Digit Difference Sort" on Codefights

Given an array of integers, sort its elements by the difference of their largest and smallest digits. In the case of a tie, that with the larger index in the array should come first.

Example

For a = [152, 23, 7, 887, 243], the output should be digitDifferenceSort(a) = [7, 887, 23, 243, 152].

Here are the differences of all the numbers:

152: difference = 5 - 1 = 4;

23: difference = 3 - 2 = 1;

7: difference = 7 - 7 = 0;

887: difference = 8 - 7 = 1;

243: difference = 4 - 2 = 2.

23 and 887 have the same difference, but 887 goes after 23 in a, so in the sorted array it comes first.

I have an issue with two numbers having the same difference. Here's what I wrote so far:

I would like to extract a very specific portion of a 2D array in Python using the zip() method (and avoid messy for loop logic). I'd like to use zip to achieve something like this:

Given a tree, I'm supposed to check if it's symmetrical, or a mirror of itself down the center. I'm missing one edge case and cannot for the life of me figure out what it is. The only error I get on CodeFights is "Output limit exceeded"

Here's what the example tree looks like

This is the main function isTreeSymmetric assigns its left branch to a variable that invokes the leftBranch function and right branch to the rightBranch function which recursively return an array.

The reason I used two different functions was because it helped me compartmentalize my thinking given that on the left half of the tree I had to go right to left and vice versa for the right half so I didn't get lost in a tree hole.

The last return statement in isTreeSymmetrical then checks if the returned type values are Arrays followed by a ternary that either checks the left and right arrays or checks the equality of variables lb and rb in the case the values were not arrays.

I've been working on this for what feels like eternity! Help please.

I have been struggling to figure out why my code isn't returning correct results on the CodeFights chessBoardCellColor arcade challenge.

Given two cells on the standard chess board, determine whether they have the same color or not.

The inputs are given as two digit strings made up of one uppercase letter A-H followed by one number 1-8.