Your solution times out because you are generating each combination, which is beyond O(N^3).

However, you should opt for a recursive approach.

Thank you for reply, but its shows that You have not earned access to this kata's solutions Solutions are locked for kata ranked far above your rank. Rank up or complete this kata to view the solutions. That's why i can not see the solution. But no hurry in solution now. I will try it again

You need to click that button to unlock it, but you will forfeit the kata and will not be able to get honor for it.

Well, I am curious too about how you earn 1 kyu.

Training && training is the key

And why in the leader bord all people using java script ?

Now, the leaderboard is updated, you may choose the language at the topright dropdown box. You may also to see overall points / authoring && translation points / honor (gained by solving katas only)

If it were up to me, your place in heaven would be assured.
Thank you.

Thanks bro, i came here searching the explanation of this code.

you can use pythontutor.com to see it in action

but slow

That doesn't work since two '(' would cancell out one '}'... instead consider using a dictionary of counts for each. e.g.

if char in '({[': d[char] += 1

if char in '})]': d[char] -= 1

Me too

https://www.codewars.com/kata/566fc12495810954b1000030

please tell me if this is duplicate ! I hope you find this interesting and unique !

done

done

Initial solution has a typo:

NameError: name 'how_many_times' is not defined

The function name is how_many_time (missing the "s")

Problem with checker function:

test.assert_equals(how_many_times(d, a, b), solution(a, b))
TypeError: solution() missing 1 required positional argument: 'b'

Is this a maths question ? I learned product module to solve this question but it didn't work out for n=k=10 !

Ops I forgot to do that ! I thought only who have solved can see this comment !