github-split

Your mission

Return how many of the west coast's writes the east coast log can account for, in order.

today's brief

October 21, 2018. A network card fails at a GitHub data centre for 43 seconds, and that is long enough for the MySQL cluster on the east coast to promote itself. Both coasts now think they are in charge. Writes land on both sides for the length of the blip, and untangling them takes 24 hours of degraded service with staff hand checking data. Work out how far the west coast got through the east coast's log.

See it in action

replayed({1,2,3,4}, 4, {2,4}, 2)

Expected result

Your checklist

For your own tracking. Tests grade your code.

east lists en writes in the order the east coast made them, and west lists wn writes in the order the west coast made them.
Read down east from the start and match west's writes one after another: west[0] at the first place it turns up, then west[1] somewhere after that, and so on.
Return how many of west's writes get matched before east runs out.

More examples

replayed({1,2,3,4}, 4, {4,2}, 2)

Expected result

Constraints

Expected files

logs.c

Allowed functions

None. Write every helper yourself.

Back to compete

Solutions

github-split

Your mission

Return how many of the west coast's writes the east coast log can account for, in order.

today's brief

See it in action

replayed({1,2,3,4}, 4, {2,4}, 2)

Expected result

Your checklist

For your own tracking. Tests grade your code.

east lists en writes in the order the east coast made them, and west lists wn writes in the order the west coast made them.
Read down east from the start and match west's writes one after another: west[0] at the first place it turns up, then west[1] somewhere after that, and so on.
Return how many of west's writes get matched before east runs out.

More examples

replayed({1,2,3,4}, 4, {4,2}, 2)

Expected result

Constraints

Expected files

logs.c

Allowed functions

None. Write every helper yourself.

Back to compete

Solutions