using shift() has O(n) of time complexity when pop() has O(logn)

Could you make that font a little bigger?

Sorry about that....updated score board

Yes it's a pain having to highlight the text whenever I want to refer to the table instead of just being able to glance at it.

The "scoring" is blacked out.

I stole this from some of the brilliant minds in the solutions. I wasn't able to pass the random tests.

maybe you have indentation/padding in the end of each pyramid layer also

I couldn't even begin to understand your scrambled directions. You can do better than that.

If this is a MinHeap and we want the lowest value why pop()? Shouldn't it be shift()?

Test Passed: Value == 'Ruby is for managers'

Expected: 'Ruby is for managers', instead got: 'Nice job, you've implemented the converter!'

This is what I got for the last test after "Ruby is for managers."

Could you verify that this isn't a test error? I got everything else okay. Thanks. : )

I forgot to remove the name and country variables. I didn't use them.

I can't see how my solution looks any different from the sample test result:

Log
For width: 00-00..00-00 and height: 3

Your solution:
00-00..00-00
0000--0000....0000--0000
000000---000000......000000---000000

How it should look like:
00-00..00-00
0000--0000....0000--0000
000000---000000......000000---000000

Note: the content shown here is without the indentation.

I believe the animals to the right of a horse are not included because once a horse is eaten the old lady is dead and not eating anymore. I'm using Javascript and have been trying to use a for loop to slice() the dead eaten animals from the animals array. But that messes up the for loop counter when the array shrinks. I'm worried I don't know the formula(s) I need to do this. Is it some kind of data structure? I need a clue!

IIRC it was deleiberate but I forget why I did that. I've made it more visible now.