[Community Puzzle] Offset Arrays


Send your feedback or ask for help here!

Created by @Andriamanitra,validated by @Konstant,@TBali and @awnion.
If you have any issues, feel free to ping them.

Nice puzzle, a lot of fun in solving it. Managed to solve it without using Recursion, instead I used Dictionary.

It’s interesting :slightly_smiling_face:
But i validated all test cases, yet validator 5 don’t validate…
And as i have no feedback on what’s going on with validators… i’m stuck @ 90% :frowning:

I use regex and recursion, everything works perfectly in test cases, but validator 5 must have something that is not covered in test cases…

(i’m doing it in javascript)

Validator 5 is very similar to the test “Only one element” - the difference is that the indexes are positive.

1 Like

The test case 5 “Only one element” validates… (as i said all the tests validates)
I’ve tried it in cutom changing to positive indexes and it works…
A[0…0] = 69
B[-3…-3] = 1547
C[133…133] = 55
My code returns 55

i also tried it with:
A[0…0] = -3
B[-3…-3] = 133
C[133…133] = 55
returns 55

I really don’t get where the problem is…

No idea what your problem might be :slight_smile:
Here’s the Validator 5:

A[8..8] = 722
B[54..54] = 2
C[0..0] = 4



VinceD.Ziree, It’s an easy puzzle! Try another way, without regular expressions and other complexities.

1 Like

got a ‘+’ instead of ‘*’ in my regex…(which makes no sense now that i’ve noticed it, but it worked with all test cases and validators except that validator 5 lol)
If i’d tried in custom case with positive single digit array values i would have noticed it… :confused:

My code isn’t that complex (i’m too lazy to bother with something complex lol), and the regex for this aren’t that complex either…
I’ve just been a little dumb :slightly_smiling_face:

Anyway… Thank you !