Reraised above ~~

Hi,

I already forget how to improve it. I am thinking about Term Frequency – Inverse Document Frequency (TF/IDF) when I saw this kata. Let me redo this kata and get back to you. I don't know about edit right. I don't even know how to create my own kata yet... :D

Hey, sorry for being absent. I was busy moving to another city.
I do not know how or if i can give you edit rights. What would be your suggested instructions?
Greetings and stay safe

I love this kata. There are several ways to improve it, though. I think the instruction need to be more detailed. How can I can edit the instructions?

Just in case anyone else would run into it, the problem is you writing too much to the stdout. Remove all printing functions.

@hobovsky Your comment is actually a little bit misleading. You need to calculate n! because it's not possible to rewrite the formula so it doesn't contain n!.
What you can do is rewrite the formula in a way you can calculate the result more efficiently but you always have to calculate n!

any hint?

it's not about DP, here. You need even more efficient.

Me, too. I programmed using dp, and timeout occured.
I don't know why, so I unlock solution, copy and paste the "best practice" code.
!!
The best practice code is occuring execution timeout.
I think some test cases are inproper.

Because "][" is an error. You should start with open square bracket.

Mine passed the static test but then gave Max Buffer Size Reached (1.5 MiB) Any suggestion?

Time: 10556ms Passed: 2 Failed: 0 Exit Code: 137
Test Results:
static_tests
STDERR
Max Buffer Size Reached (1.5 MiB)