Simpson's Paradox Across Subgroups

Problem

Detect Simpson's paradox between two groups. subgroups_a and subgroups_b are lists of [successes, total] per subgroup; return True when the overall winner is the group that loses in every subgroup, False otherwise.

Ties, mixed subgroup directions, or empty input return False.

Hint

The paradox occurs when unequal subgroup sizes flip the aggregate comparison.

Test cases

case 1

in: [[[90,100],[10,100]],[[80,100],[0,10]]]

expected: true

case 2

in: [[[90,100],[50,100]],[[80,100],[40,100]]]

expected: false

case 3

in: [[[80,100],[0,10]],[[90,100],[10,100]]]

expected: true

case 4

in: [[],[]]

expected: false

Starter codePython

def simpson_paradox(subgroups_a, subgroups_b):
    # Your code here
    pass

4 test cases · run your code against them in the editor