I have a straightforward solution in bash shell, but it keeps getting timed out. Don't know how to optimize the script.

When you fork it, the differences should be highlighted.

Are you sure? I don't know where to check and imagine it would try to apply the patch, which doesn't have the shortened examples in its context, let alone content.

This now has a description conflict.

This one will try to execute the result of the substitution, not something one often wants (dangerous).

Thank you so much!

There were some kata 7 too, but it was so simple I didn't report it — the description had test cases, so it was a tiny TDD exercise in itself. I'll let you know if I stumble upon any more.

If you have to use so much factorials, have you tried memoization? The cleanest solutions take a look at the math first though.

Fixed, thanks again but I can't believe I forgot so many sample tests:-(

As usual, you have an infinite loop.

Shell is missing sample tests. This time I needed 10 before succeeding. :O

7+9 < 7+10

Sorry, seems to have forgotten... Fixed, thanks!

Shell is missing sample test cases, so one has to submit to see the format (usually friendlier than this python list). Here you go:

describe "Solution" do
  output = run_shell args: [1, 250]
  it "for 1-250 should match" do
    expect(output).to eq("[[1, 1], [42, 2500], [246, 84100]]")
  end
  output2 = run_shell args: [300, 600]
  it "for 300-600 should match" do
    expect(output2).to eq("[]")
  end
 end```

Ok, the test failures were just this bug: https://github.com/Codewars/codewars.com/issues/690