xD

I agree that this is exactly the best practice. Voted

Re-published. It may take time until bad solutions are invalidated.

Sorry too... It's hard to predict all the workarounds people may find.
I can avoid the kind of solutions you mention and tried to republish after tightening a bit the tests but I always time out when republishing! I will try again and let you know. Thanks for your post.

I can send you my DKA, builded for this kata, Bibik is my second account
I have been solving this for 5 or 6 days, dont you see this???

I know how you feel. I have an O(c) solution for all but one case, but I can't figure out the last step and feel I might have gone down the wrong path. After a week of effort it feels rough.

Linear time is too slow. Needs to be faster than that, and much faster than quadratic time (O(m*n)).

See my reply to a similar issue.

There is a site called interviewing.io (there, you can do a technical interview anonymously over a shared code editor and shared audio, and uncover you name at the end of the interview if you wish). Another site is called triplebyte (It's an agency. If you pass their online tests, they'll make you skip screening interviews at tech companies). And then, there is pramp.com (that site allows you to do mock tech interviews with other job hunters over video and over a shared code editor. Others interview you. And you interview them. The site provides the questions and the answers. It's a great way to get a feel for the competence of the people you might be competing with).

But otherwise, I agree with Lise. Nothing actually beats applying for jobs and seeing what happens.

Can you tell me how you think "witouth memorization" because the expexted number is nth value in "Hamming" array?