Literally it's all you need to read to understand how maps work (though quite hard to get through, but defenetly worth it)

I guess you don't need to calculate the cube of each digit since an odd number will always have an odd cube and an even number will always have an even cube. The modulo 2 of the sum will always be the same.

Print the inputs at the beginning of your code.

How do you debug ? -> Amongst other things by printing the input.

Nag author long enough so they finally add the details into failed assertion messages.

how to get failed testcase details

ok. I solved it issue

Yes there are more "base" cases.
Problems with your code is not a kata issue. Sorry!

Hi, i have problem
When trying to run tests everything is OK, it handle base cases, but when i attempt i get all passed except basic cases (
Does there is any other base cases or there is some mistake ?
Is it right ?

Not a kata issue. No errors in tests. Before posting isssues note that 706 people passed the Go kata.

For Golang on passing random tests there's two test cases where both arrays are empty, and in one case it's required true, but false in another (see below)
So you couldnt pass "attempt" button with either coding both arrays to be zero as true, or coding one of array to be zero as false (which would cover any empty array presented as false).
Because either one or another test case will fail in this way

1st case:
---START---
array1: []
array2: []

Test Failed
Log
Expected
: false
to equal
: true

2nd case:
---START---
array1: []
array2: []
[]
[]
Test Failed
Log
Expected
: true
to equal
: false

Hi Raihan,

Why are you calculating ^3 of each digit as (int(c) - int('0'))?
That's some bytes/runes claculation mechanics implies?

Can you please give some details?