Duplicate: https://www.codewars.com/kata/545cedaa9943f7fe7b000048

python translation with valid random tests:
https://www.codewars.com/kumite/5e4fcf3d49e8ae002f547412?sel=5e4fcf3d49e8ae002f547412

Thanks for a fun kata. I suggest expanding the test cases since there are several half-correct solutions.

• P is capitalized and occurs just once: "Pack my box with five dozen liquor jugs", potentially a problem for those that use an array and index using: "ch - 65"
• First 13 letters in both upper and lower case "ABCDEFGHIJKLMabcdefghijklm"; distinct characters is 26, but it's just 13 distinct letters
• 26 unique characters, none of which are letters "!@#$%^&*()_+1234567890-={}"
• Take existing pangrams and make them non-pangrams by swapping out unique-non-letter characters for targetted characters. For example: pangram.Replace("a", "!")

You could try a jumbling trick with LINQ:

string pangram = "Pack my box with five dozen liquor jugs";
string bar = string.Concat(foo.OrderBy(_ => random.Next()));
// for one run: bar = "vajuwoie nfg Pdoqsx  hluiti mzroe bkc y"

Thanks for pointing this out, I will adjust my solution.

Added more functional and random tests.

This isn't a valid solution. While it certainly works for most cases, it can falsely identify two strings which aren't anagrams as an anagram. I've added some edge cases to address this.

Thanks a lot for your feedback. It's the first time creating a kata so I am learning. I will consider this.

Thank you for your feedback.

Codewars Forums - Kata Best Practices - Have Full Code Coverage

Having only 4 fixed assertions in the entire test suite is unacceptable and prone to allowing logically flawed / hardcoded solutions to pass all tests. Please either (1) increase the number of unique, distinct fixed assertions to at least 20 and including edge cases (e.g. empty string) or (2) even better, write 100+ random tests as per standard Codewars practice and is generally favored over just a large number of fixed assertions.