• MTDzicommented on "Rotate a square matrix in place" python solution

O, it's nothing ;)

• MTDziresolved a question on "Constructing a car #1 - Engine and Fuel Tank" kata

OK, I can now answer my own question.

This means there was a `segfault`.

• MTDzicommented on "Constructing a car #1 - Engine and Fuel Tank" kata

This comment is hidden because it contains spoiler information about the solution

• MTDzicreated a question for "Constructing a car #1 - Engine and Fuel Tank" kata

Hey,

I keep getting Error 139 (when running sample tests and the actual tests) -- has anyone else run into this problem?

• MTDzicommented on "Calculate the function f(x) for a simple linear sequence (Easy)" python solution

I think you're right, and putting aside large sequences - it can be done better.

• MTDzicommented on "Array.diff" python solution

Thx, I feel convinced.
Although, I think adding an "Optimum" score wouldn't be a very bad idea.

Also, your solution is actually the first thing I came up with and it would (probably) be the cleanest approach.

TBH, I've heard those words of wisdom once or twice, but I never really took them to heart...

Cheers :)

• MTDzicommented on "Array.diff" python solution

I'm confused...
This solution has the highest "BestPractices" (22 as of now), and I admit - it's pretty.
But is it the fastest?

For instance, one might try and sort both arrays and use binary search on array "b" to check if an element from "a" occurs in "b". And because they are both sorted, discard the part of "b" in which we know all elements are smaller/larger than the current element from "a".

Am I making any sense?

• MTDzicommented on "Find the capitals" python solution

That's a very nice thread you posted there, THX!

• MTDzicommented on "Find the capitals" python solution

This comment is hidden because it contains spoiler information about the solution