← Questions
Fewest deletions so a list's first k items avoid another list
0
I was asked this
No reports yet. Sign in to say where you were asked it.
You get two lists, a and b, and an integer k. Delete elements from b so that none of the first k elements of what remains also appears in a. Return the fewest deletions needed (or the resulting list), and say what happens when b runs out of elements.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding