(Haskell, maybe others)

Fixed test cases allow for solutions that do not properly check for square matrices such at this solution.

I've made a Haskell fork that adds the following test cases:

matrix = [[1,1,-3,4],
          [1,1,-2,3],
          [1,1,-4,2]]
vector = [1,1,1,1]

matrix = [[1,1,-3],
          [1,1,-2],
          [1,1,-4,5]]
vector = [0,0,0]

Not sure what to make of vector V. Are the entries b1, b2 ... bn the result of a calculation, or just some random numbers ?

Approved by someone

8 years old and only 12 solved this thing?
Very curious of what I'm getting into. :-)

Ruby translation kumited - please check and approve!

approved by someone

I can relate, lol

C translation

As mentioned by several commenters below, as of this message, the Java version of this Kata is broken. In order to pass the tests, if you compute any values that exceed the max value for an int, instead just put 2147483647 (the max value for an int) in the applicable index of the array.

I love how this beauty received 26 Best Practises upvotes, and 8 clever ones.
Too bad you have to choose: it's clearly both.

I think we should add the years before 1924 to the tests.

Water Rat (me, nice...) solved this thing in the year of the Wood Dragon.

My advice is to look into 'type coercion' and while you're at it, 'type conversion' and figure out the difference. It's quite interesting stuff.

GO sounds so special that I'm not even going to try.

Having my hands full anyway with struggling through 120,000 lines of DXL code, written by even more incompetent programmers than I am, at work.

Sorry, but I had to get that of my chest. ;-)

Dont mind me.