Longest snake

Statement

Goal

You have found a rectangular box made of n lines with snakes jammed in it, and you want to know what is the length of the longest snake.

The box is perfectly filled with snakes from top to bottom in a zigzag manner, starting at the top left facing right. The snakes have a generally horizontal orientation, and switch direction at the left and right edges of the box. A snake may span across more than one line.

Each snake has a tail: < or > depending on the direction; a body consisting of at least one =, and a head: o.

Example:

>===o>====
o=<o=<o===

There are 4 snakes, in order of appearance:

>===o
>=======o
>=o
>=o

The answer is then 9, corresponding to the size of the second snake.

Input

Line 1: An integer n for the number of lines that make up the snake box.
Next n lines: The snake box.

Output

An integer representing the size of the longest snake in the box.

Constraints

Every snake has a body consisting of at least one =.
0 < n < 100
The width of the box is constant.
0 < width < 50

Example

Input

1
>=====o

Output

Game modes

Fastest, Shortest, Reverse

Test cases

Just one Test

Input

1 >=====o

Output

Just one val Validator

Input

1 >===o

Output

Tidy twos Test

Input

2 >==o>=o o=====<

Output

Tidy twos val Validator

Input

2 >==o>==o o======<

Output

Switching Test

Input

2 >==== o=<o=

Output

Switching val Validator

Input

2 >====== o==<o==

Output

Example-like Test

Input

2 >==o>== o==<o==

Output

Example-like val Validator

Input

2 >=o>===o>= o===<o=<o=

Output

Trimming Test

Input

3 >=====o>==== ============ =======o>==o

Output

Trimming val Validator

Input

3 >=o>==o>==== ============ =====o>====o

Output

Longer Test

Input

30 >=====o>== =====<o=== =====o>=o> =<o==<o=== =======o>= =====<o=== =====o>=== o=====<o== >==o>=o>=o ======<o=< ====o>=o>= =====<o=== o>======== ======<o== =o>===o>== ===<o===== ==o>====== =====<o=== ===o>===== ====<o==== ====o>==o> =<o======= ========== o=======<o >========o ====<o===< ===o>===== ===<o=<o== ========o> o=====<o==

Output

Longer val Validator

Input

29 >======o>= ======<o== ====o>==== ===<o===== =======o>= o====<o=== >=o>====o> ========== o>==o>=o>= o==<o===== >==o>====o o========< >===o>==== <o===<o=== =======o>= ===<o===== =o>======= =<o====<o= ======o>=o =========< =o>======= <o====<o== ========== o=======<o >====o>=== =<o======= o>======== ===<o===<o o>====o>=o

Output

Many Test

Input

85 >========= ======<o== =========o o========< >========= =<o======= ======o>== ========== =====o>=== ===<o===<o ====o>==== ======<o== ===o>===== ========== ===o>===== =====<o=== ========== ======<o== ==o>===o>= =<o======= =====o>=== ===<o===== =======o>= ========== ==o>====== ==<o====== =======o>= o========= >========= ==<o====== ========== ===<o===== ========== ====<o=<o= =o>=o>==== ========== o>======== <o======== ========== <o======== ====o>==== =<o======= ======o>== ======<o== =o>======= <o======== ========== ==<o====== ========== =====<o=== o>=======o o=<o=====< >========= ====<o==== o>======== ==<o====== ========== ====<o==== ======o>== o========= >========= ==<o====== ===o>===o> ===<o===== ========== =====<o=== ===o>===== ========== =o>======= ========== =o>======= ========== =o>======= ==<o====== ======o>== ========== ======o>== =<o======= ======o>== <o======== =========o =========< =======o>= ========== ======o>=o

Output

Many val Validator

Input

80 >========= ======<o== ========== =======<o= ===o>===== ========== ===o>===== <o======== ========== o====<o=== >========= =<o=<o==== ========o> =======<o= ===o>===== o========= >======o>= ========== ===o>===== ==<o====<o ========== =======<o= ========== ==<o==<o== ===o>===== ========== =o>==o>=== ========== ====o>==== ========== o>=======o =========< =====o>=== =======<o= =====o>=== =====<o=== =====o>=== =======<o= ===o>===== ========== ===o>===== ======<o== o>======o> ========== ========o> ========== ====o>==== ========== ==o>====== ========<o =========o =========< =o>======= =======<o= =====o>=o> ========== ===o>===== <o======== =o>======= o========= >========= ========<o =o>======= o========= >========= =<o=====<o ===o>===== ========== ==o>====== =====<o=== =====o>=== ========== ====o>=o>= ====<o=<o= o>======o> ========== o>======== ===<o===<o ========== o======<o=

Output

Solution language

Solution

Stub generator input

Rate this contribution

+17

Make the contribution public (50+ clashes played)

Comments

23 Comments

jonas_melo Unnamed CodinGamer

25 days ago

Just got this contrib in a clash and wanted to say thank you. It's one of the most creative and fun challenges I've done :D

Cometgerms Unnamed CodinGamer

almost 3 years ago

✅ Approved the contribution. Comment: It is a very interesting problem, creative while still being somewhat challenging.

Alex_Chou Unnamed CodinGamer

almost 3 years ago

✅ Approved the contribution. Comment:

5DN1L Unnamed CodinGamer

almost 3 years ago

Please always write a reason when you approve or reject a contribution. Thanks.

jddingemanse Unnamed CodinGamer

almost 3 years ago

✅ Approved the contribution. Comment: Nice one; doable but not too easy, and creative.

Rafarafa Unnamed CodinGamer

almost 3 years ago

Edit: - Changed test 2 (Tidy twos) & its validator orientation so a solution like this: gets a = $<.map{x=_1.chomp $.%2<1?x:x.reverse}.join p a.split(?o).max.size+1 will fail earlier (you shouldn't be sorting lexicographically) >======o o===<o=< became >===o>=o o======< - Rewrote the solution slightly differently for validation.

CodinBot Unnamed CodinGamer

almost 3 years ago

I hope you received enough feedback from the community to improve your contribution. Once you have made the necessary updates, publish your contribution!

KontrsK Unnamed CodinGamer

almost 3 years ago

this looks cool, but id propably not make it within 15min :(

Rafarafa Unnamed CodinGamer

almost 3 years ago

Thanks for your feedback. Any suggestion on how to make it easier? What was the hardest part for you?

Alexand_NO Unnamed CodinGamer

almost 3 years ago

nice one - upvoted !

Yrdi Unnamed CodinGamer

almost 3 years ago

nice

JOKER5 Unnamed CodinGamer

almost 3 years ago

This could be nice for a clash of code.

5DN1L Unnamed CodinGamer

almost 3 years ago

Goal section * Suggest to change the second and third paragraphs as: The box is perfectly filled with snakes from top to bottom in a zigzag manner, starting at the top left facing right. The snakes have a generally horizontal* orientation, and switch direction at the left and right edges of the box. A snake may span across more than one line. Each snake has a tail ({{<}} or {{>}} depending on the direction), a body (each segment is a {{=}}) and a head ({{o}}). (* vertical zigzag is possible, hence "horizontal" is mentioned.) Constraints section * (I haven't checked but I assume that's the case?) Suggest to add that each snake has at least one body segment (i.e. at least length 3). Stub generator * The variable name "H" differs from that used in the other sections ("n"). Cases * Perhaps the clash is doable in Reverse if there are easier cases at the beginning (e.g. first pair is just 1 snake, second pair is 1 snake in 1st line and 2 snakes in 2nd line, third pair is 1 snake spanning across 1.5 lines and 1 snake filling the remaining 0.5 line)? Thanks. P.S. There's also this puzzle: https://www.codingame.com/... But of course yours is easier.

Rafarafa Unnamed CodinGamer

almost 3 years ago

- Added your statement with some very minor punctuation changes. - (Also speficied there and in the constraints section about the body of the snake being always of length at least 1) - Changed H to n in the stub - Added the suggested examples and the reverse mode. Now the statement example became test 4, so I added that to the statement too. It's a bit confusing but it should be ok. Thanks! Edit: Yeah I forgot about that puzzle. I guess it has snakes and some ascii. I'm a fraud...

Rafarafa Unnamed CodinGamer

almost 3 years ago

Is this doable in reverse?

jddingemanse Unnamed CodinGamer

almost 3 years ago

Oh I just approved, but reading this question I realized I forgot to check it with reverse in mind. Reverse might be challenging - counting characters is always a bit annoying and here it is in combination with also the left/right dynamic. You do have quite some small examples, but it might help if there is just one more very short one, like 2 >=o>== o==<o= (answer 5) Actually your 'Example val' is a short one, but the Example itself with '8' is already a bit on the long end for counting during reverse.

Rafarafa Unnamed CodinGamer

almost 3 years ago

The 3rd test is so that it is easier to notice this doesn't work: $<.map { x = _1 ($.%2 < 1 ? x : x.reverse).chomp } Instead, this should work: $<.map { x = _1.chomp $.%2 < 1 ? x : x.reverse }

Rafarafa Unnamed CodinGamer

almost 3 years ago

Since I did this clash recently: there's this https://www.codingame.com/... that is similar, in that it has snakes on the title and there's ascii involved... I think that's fair.

ABOUT US CAREERS PRIVACY FAQ BLOG

The #1 tech hiring platform

SCREENING INTERVIEWING