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"]]
1, "a"
1, "c"

Thanks a lot,

Sign In or Register to comment.

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!