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

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?

any hint?

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)

I already implement using dynamic programming but still execution timeout. Any suggestion for speedup?

Passed: 10 Failed: 0 Exit Code: 1
Test Results:
sum_of_squares_test
easy_test_case1
easy_test_case2
easy_test_case3
easy_test_case4
easy_test_case5
harder_test_case1
harder_test_case2
harder_test_case3
harder_test_case4
harder_test_case5
STDERR
Execution Timed Out (12000 ms)

I am pass all the test, execution timeout at random test. Any suggestion for speed up?
Test Results:
checks_word
sample_tests
extended_tests_1
extended_tests_2
extended_tests_3
random_tests
STDERR
Execution Timed Out (12000 ms)

I already use double long and the test case use 10110 which mean 10110! = 5.229e+36099 and the max capacity of double long is only 1.18973e+4932. Any suggestion?

I have passed all my example test. When I hit attempt button, I got this: Time: 1892ms Passed: 1 Failed: 0 Exit Code: 139. What is that means Exit Code 139?