Answered: def remove_after_kth(items, k=1):…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

That's enough of you!
def remove_after_kth(items, k=1):

Given a list of items, some of which may be duplicated, create and return a new list that is otherwise the same as items, but only up to k occurrences of each element are kept, and all occurrences of that element after those first k are discarded.

Hint: loop through the items, maintaining a dictionary that remembers how many times you have already seen each element. Update this count as you go, and append each element to the result list only if its count is still at most equal to k.

Note the counterintuitive and yet completely legitimate edge case of k==0 that has the well defined and unambiguously correct answer of an empty list! Once again, an often missed and yet so very important part of becoming a programmer is learning to perceive zero as a number...

items
k
Expected result
[42, 42, 42, 42, 42, 42, 42]
3
[42, 42, 42]
'bob', 'bob',
['tom', 42,
'bob', 'tom', 'tom', 99]
99,
2
['tom', 42, 'bob',
'bob', 99, 'tom', 99]
[1, 2, 3, 4, 5, 4, 3, 2, 1, 2,
3, 4, 5, 4, 3, 2, 1]
1
[1, 2, 3, 4, 5]
[1, 2, 3, 4, 5, 4, 3, 2, 1, 2,
[1, 2, 3, 4, 5, 4, 3,
2, 1, 2, 3, 4, 5, 1, 5]
3
3, 4, 5, 4,
3, 2, 1, 2, 3,
4, 5]
[42, 42, 42, 99, 99, 17]

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions