You are adding duplicate pair-wise entires to the output list (specifically this line --> new List<long[]> { new long[] { (int)a, b }, new long[] { b, (int)a } )

Retired.

This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/110.
Please join the discussion to help us identify duplicate kata and retire them.

Ruby 3.0 should be enabled, read this to learn how to do it

Please organize the structure of test fixture as following (although it has been mentioned in the attached link, I'm repeated here again)

describe "<This message should describe the categories of test groups inside this block>" do
  it "<A short message describing this test group>" do
    expect(...).to eq(...) #Assertions
    #Or Test.assert_equals(user_response, reference_response)
  end
end

For some reason my code gets 1 't' to less, everything else works properly.. i really cant tell why?!

Edit: Never mind. For everyone else, who is wondering y they miss one 't', it's bc of your code probably doesn't count the capitl 'T' at the very beginnig of the str.

Hi. I enjoyed this Kata! Helped improve my logical thinking, which is always a good thing :)

Hello guys. I'm having troubles to do this Kata. I can see a way to solve this problem. I already have the unique letters in strings, and the output for only non-alpha characters, but I can't see how to make an output like '1a2b3c...'

Can anyone help me?

Same for me. My program counts s twice, although it clearly is one

Take care of case :)

my program is not counting t's properly

if its contains 3t it shows 2 always 1 less than original

Done.

1. Even if it does appear in samples, it could be fair to precise the output chars have to be alphabetically sorted.
2. I find the statement "The string shouldn't contain zeros; leave them out." ambiguous. I first thought that the char "0" had to be removed from the output.

Nice twist getting the value preceed the key in the return string

the second test should be 5t? instead of 6?

Approved.