Challenging kata. Had to go out and take a walk to come up with a solution.

Decided to tackle it recursively. Should give it an other to see if I can come up with something more 'stack-friendly'.

Anyways, kudos :)

In the requirements:

"If there is no strong winner, then candidates with least votes is removed and all procedure is repeated."

I could pass the tests without doing the elimination round. Here's a test that does make sure elimination takes place:

var a = 'a', b = 'b', c = 'c';

var votes1 = [
  [c, a, b], 
  [b, a, c],
  [a, c, b], 
  [c, a, b]
];

winner = Condorcet(votes1).winner();

Test.assertEquals(winner, null);

 "If there is no strong winner, then candidates with least votes is removed and all procedure is repeated."

I can currently pass the tests without doing the elimination round. Will try and implement it nonetheless.

Got the same issue, though my elimination technique differs.

Hard to figure out whether or not i misinterpreted the instructions.

+1 for efficient and easy to read

+1 : easy to understand

I could still pass the 'submission' with a similar 'adjecent end values' bug. I posted a comment about it below my solution.

Btw, it is a nice kata, kudos!

I made an error in my solution. In the last step of my 'generator' i yield the seed rather than the accumulated sum.

Might need an extra test to make this fail.

• 1 for readability

Same here,

_0_BasicTests
Expected: null
But was: 123
at KataTest._0_BasicTests () [0x00000] in :0
_1_RandomTests
Test Passed

After passing _0_BasicTests in the first run. Are they not the same?

I had the same problem, was wondering if i got it wrong, entered a similar solution in Python and then it passed. Something seems to be wrong with the Haskell tests.