Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
help on the best complexity
Given a nested list [[k1, v1], [k2, v2], ..., [kn, vn]] in Python, what is the best complexity we can get to solve this:
print all the duplicate k and associated v. For example:
[[1, "a"], [2, "b"], [1, "c"]]
Thanks a lot,
0 · ·