@CrazyMerlyn

Thanks : )

@smile67

I've just updated the test, could you please check if it runs faster now.

Thanks

Hi

I've just updated the test, could you please check if it runs faster now.

Thanks

Hi, there seems to be a problem with the 3rd example test

The description states:

In other words, all values present from all arrays should be included in their original order, but with no duplicates in the final array.

Yet the test expects two 2s

Test.assertSimilar(uniteUnique([4, 3, 2, 2]),[4, 3, 2, 2]);

Thanks

Hi, apologies for the late reply

I'm not sure how you get that tiny-three-pass-compiler is still beta (take a look here).

And since both are approved and building-blocks is 7kyu and tiny-three-pass-compiler is 1kyu,

building-blocks comes before tiny-three-pass-compiler in the sort order.

Whoops, my apologies for that,

I think I've fixed this could you please check

Thanks

Whoops, my apologies for that

I think I've fixed this could you please check

Thanks

Thanks : )

Nice solution!!

ps. If you have the time could you please rank the kata.

Whoops! forgot about that,

It should be fixed now, please check.

Thanks

All done, Thanks!!

A real nice kata.

Do I need to treat it as a number or just as a sequence of spaces and tabs?

Two questions here,

First of all how should a label be parsed? (according to my current understanding it's as an unsigned binary integer, with [tab] for 1 and [space] for 0)

Secondly, can someone explain this statement in the flow control section:

[space][space] (label): Mark a location in the program with label n.

where should this location be?

Thanks

Thanks

There is an error in Ruby random tests : (

Testing for [[634933, 2375], [19773, 20577], [2888, 107653]]
It should work for random inputs too -  Expected: 271246014.00000006, instead got: 271246014