no news, closing.

.

that's just jumping further than the number of lines of the program

I have timeout issues as well. How do you mean "jnz" can go past the end of the program?

Hi,

• description changed a bit.
• "Like where are there mov and jnz on constants" -> not understandable => ?
• "Another crucial issue not mentioned in the description is that jnz can go past the end of the program." -> done (somehow...)

Why can't the length be shorter than the width??? As long as they're all positive, their relative values shouldn't matter. The terms width/length/height are just arbitrary labels for orthogonal scalars. I ran my solution against the inputs (5, 3, 6) and had no error. What's there to fix?

throw "" will suffice.

me too :) yay

I'm stuck on the same point as you. If you move north, then west, then south and then east, then you finally will still be on x=0 and y=0.
In first example you have two "WEST" so normally you end up on x=1 and y=0, so the correct answer is one "WEST", but then you just magically revoke this rule and need to sort-out ONLY the direct pairs. This makes no sense at all. If a person go ['NORTH', 'WEST', 'SOUTH', 'EAST'] he will still end up in the same spot as was in the first place, so...?

You should delete only sequential pairs, for example : north, west, east, south, south, will be equal to south, becouse when you delete west east you will get a north south pair, which also must be delted

impossible to answer, since you do not provide the input...

When you ask for help post a question, not an issue.

That's why it's called "random" test. If you got to the 5-letter words, that's already good. There are only 3 tests for those.

these are weak passwords: maximum 5 characters long

...but there is no minimum specified! (hint)

It's asking for how many times the students all face the same direction given the sequence of commands assuming they face the same direction to start.