[Community Puzzle] The Other Side

Puzzles
1

Coding Games and Programming Challenges to Code Better

Send your feedback or ask for help here!

Created by @Suryyy,validated by @Machiavelli_5040,@Klimpergeist and @Cakeisalie5.
If you have any issues, feel free to ping them.

1 Like
2

The validator 9 is failed for more information an idea on the matrix h*n?

3

I don’t find anything special about that validator.

4

an approach on this validator in a message

5

Hello everybody.

I pass all the test cases in the exercise, but when I submitted the solution it says its failing in validator 7, do you know a way to see why is failing in any of those validators?

6

It’s difficult to tell. If you want, you may send me your code in private message and I’ll have a look.

7

Can anybody give me the 4th valididator? I pass all tests, but fail on that validator.

8

You may send your code, I’ll send back what’s wrong.

9

Same issue on my side with validator 4… Could you help me ?

10

A custom case like this may help:

3
5
# # + + +
+ + # # +
# + + # +

Expected result being 0.

If that doesn’t solve the issue, you can DM me your code and I’ll take a look :slightly_smiling_face:

1 Like
11

Sounds good, thanks !

12

Solved, thanks for the tip !

1 Like
13

Validator 4 fails for me too, despite tests passing. On this custom case I find 1 reachable “+” (the top one) in column of index 2 (the one that contains “+ # +”). Why is the expected result 0? There is a path at the top of the grid to the rightmost column from that “+”…

14

The expected result is 0 because there exists 0 paths from the leftmost column to the rightmost column. This refers to paths starting with a + character at index 0 to index w-1.

Custom Case Analysis

In the custom case I made above, this is only path possible from the leftmost column:

# # + + +
1 2 # # +
# 3 4 # +

This path gets blocked by the # and therefore is an invalid path. The other two are immediately invalid as (0,0) and (2,0) are both # characters.

Hope this helps, If I’ve not explained it well enough or I’ve misunderstood your issue, you can dm me and we can go from there :slightly_smiling_face:

15

I think I understand what happened. The problem statement says:

count the number of + characters in the leftmost column from which there exists a path to the rightmost column.

I understood:

count the number of + characters in the (leftmost column from which there exists a path to the rightmost column).

What was meant is:

count the number of (+ characters in the leftmost column) from which there exists a path to the rightmost column.

I believe the statement is ambiguous, and maybe should be corrected. It is a remarkable coincidence I could get that far with this confusion.

Thanks!

Edit: that was the misunderstanding.