good at the end you did it

you could enter it there but then I would not oblige you to know the keyword partial. please try another algorithm more efficient, ps said between us the characters that I use the final test are the same as in the basic test.

the challenge is not impossible, already other people have already finished it

more if you notice the BruteForce class is partial this means that you have access to the following information

private Func<string, bool> Test; 
private static string Charset = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".ToLower() + "ABCDEFGHIJKLMNOPQRSTUVWXYZ"  + "^.";
public delegate void OnTrue(String TestPassed);
public event OnTrue OnTrueEvent = (item) => { }; 

if you do not pass the tests it's probably because your algorithm is not performing enough, codewars imposes a certain maximum execution time, if you implement a sufficiently efficient code, you can do it in the required time

TIME (T1, T2, T3): ~ 1250 / ~ 1350 ms

TIME (T1, T2, T3): ~ 1200 / ~ 1300 ms

All Fixed

c# is fixed, today I provide java

you want to try again (in c#)?

in c# I'm blocked it

I thank you for the indication, but you could tell me what an error you've found, so I can provide for the correction.

the additional part of my code that requires an algorithm very performed, like the one you have done, if you use a recursive it will not be good, there it requests the solution also from you asked

I corrected it