• ###### guntbertcreated an issue for "Smallest possible sum " kata

Correction: upon further reading I see that there are no transposed digits but the whole text is somewhat misleading

I'd expect to have the

• input in the first line, followed by the appropriate calculations,
• the first result in the second line
and so on.

Python: The description and example contain two pairs of transposed digits ( `21 <-> 12`)

• description: The text states "...of the elements of input `X = [6, 9, 21]` is detailed below:" but the code starts with `X_1 = [6, 9, 12]`
• example (in essence the same): we call `solution([6, 9, 21]) #-> 9` but the detailed steps start with `[6, 9, 12]`

The code shown assumes the correct values

• ###### Chrono79commented on "Smallest possible sum " kata

From `X`, `X_1` is the array after the first transformation.

``````X   = [6, 9, 21] after the first transformation becomes X_1
X_1 = [6, 9, 12] because X_1[2] = X[2] - X[1] = 21 - 9 = 12
``````
• ###### ritvij-saxenacommented on "Smallest possible sum " kata

For instance, the successive transformation of the elements of input X = [6, 9, 21] is detailed below:

X_1 = [6, 9, 12] # -> X_1[2] = X[2] - X[1] = 21 - 9

I don't understand where 21 came from?
X = [6,9,21]

X_1 = [6,9,12] should 12 be 21 in this case?

• ###### wowthecodercommented on "Smallest possible sum " kata

Nice kata!
Just a small tip: compare the result array and the original array and try to find a pattern.
Good luck to future challengers!

ok thanks

• ###### Chrono79commented on "Smallest possible sum " kata

100 random tests (97 of 97 Assertions)

It passed all the tests until it timed out. There are 209 tests in Python.

• ###### MuhammadAli18commented on "Smallest possible sum " kata

Timed OutPassed: 106Failed: ?Exit Code: 1
Test Results:
Fixed Tests
Should pass example tests (9 of 9 Assertions)
Random Tests
100 random tests (97 of 97 Assertions)

what is the problem it passed all exames

• ###### icetorch2001commented on "Smallest possible sum " kata

To pass the test, the solution should have about linear time complexity and less 600 ms 1 million values.

• ###### CatchMeIfYouCancommented on "Smallest possible sum " kata

im pretty sure that the buffer size error is caused my you printing stuff

• ###### Unnamedcreated an issue for "Smallest possible sum " kata

Incorrect test structure in Crystal: "Basic tests" are not in an `it `block.

• ###### Unnamedcommented on "Smallest possible sum " kata

No overflows now, but

There are performance tests consisted of very big numbers and arrays of size at least 30000.

Look at this...

• ###### ӜЯℱӁℒᚹcommented on "Smallest possible sum " kata

I've reduced them drastically, can you still reproduce them?

• ###### Unnamedcreated an issue for "Smallest possible sum " kata

Not fixed. The random tests in Crystal sometimes crash with

Arithmetic overflow
/solution_spec.cr:20:16 in 'sol'

• ###### ӜЯℱӁℒᚹresolved an issue on "Smallest possible sum " kata

I've checked your solution and my solution around 10 times, I didn't faced any such issue anymore.

Now?