It can be solved using dynamic programming, maybe try some easier different ones if you're stuck, I don't know.

please tell me how you have done it. It doesn't make sense to me at the random test.

approved

Haskell fork

• Updated random test generation to give more coherent failure messages

C Fork providing improved feedback error messages (author inactive).

No it isn't. And you've got some basic problems with it before it'll even compile in the kata, maybe fix those first? And then when you get it running it'll tell you what test cases it fails for, which will also fail locally, and then you can debug it.

lowerCase

Interesting mathematical kata, I think the description is so clear it makes it almost easy.

python new test framework

yes i understand! thanks.

Write a function that will return

the count of

distinct case-insensitive alphabetic characters and numeric digits

that occur more than once

in the input string.

In indivisibility the letter i occurs 6 times. It is the only letter that occurs more than once. So, the correct answer to this test is 1.

#include <criterion/criterion.h>
#include <stddef.h>

size_t duplicate_count(const char* text);

Test(Sample_Cases, should_pass_these_three_tests) {
cr_assert_eq(duplicate_count("abcde"), 0);
cr_assert_eq(duplicate_count("abcdea"), 2);
cr_assert_eq(duplicate_count("indivisibility"), 6);
} these are the corrects tests , because in the original we have the second and the third one wrong , the letter i repeats 6 times but in the original say ONE ! ( i think this is wrong=)

You don't say the language you're using, and also note that's the title of the tests, not the input value.

void main() {
  test("add", () { <- test title
    expect(duplicateCount(""), equals(0));
                          ^
                       input value of that test   

Please read this: https://docs.codewars.com/training/troubleshooting#print-input

Dart Completions 970

Not a kata issue.