Skip to content
DeepForgeby svx
All problems
EasyOptimizationop-089

Crossover Mask Seeded

Problem

Generate a reproducible uniform crossover mask.

After random.seed(seed), return a list of n entries: 1 when random.random() < rate, else 0. An n of 0 returns [].

Hint

Reseed before generating the mask so it is reproducible.

Test cases

case 1
in: [5,0.5,0]
expected: [0,0,1,1,0]
case 2
in: [8,0.3,42]
expected: [0,1,1,1,0,0,0,1]
case 3
in: [0,0.5,7]
expected: []
case 4
in: [4,1,1]
expected: [1,1,1,1]
Starter codePython
def crossover_mask(n, rate, seed):
    # Your code here
    pass

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