Sets — Uniqueness & O(1) Membership — Concept Check
Questions on Sets — Uniqueness & O(1) Membership. Sets store unique, unordered, hashable elements with O(1) membership tests and algebra operators (| & - ^) — the tool for dedupe, "seen" tracking, and intersection problems.
Questions in this quiz
8 questions on Sets — Uniqueness & O(1) Membership — Concept Check. Work through them here, then start the quiz to answer them and see your score.
1.You have a list of email addresses with potential duplicates. How can you efficiently remove duplicates while ignoring order?
- AConvert the list to a set
- BIterate and check each element
- CSort the list and remove duplicates
- DUse a dictionary to track occurrences
2.A developer uses a list to check if an email is blocked. How can they improve the membership test efficiency?
- AUse a dictionary instead of a list
- BSort the list first
- CUse a set instead of a list
- DUse a tuple instead of a list
3.Given two sets, A and B, which operation finds elements only in A but not in B?
- AA ^ B
- BA & B
- CA - B
- DA | B
4.A developer needs to check if all elements of one set are present in another. Which operation should they use?
- AIntersection (&)
- BSymmetric difference (^)
- CSubset check (<=)
- DUnion (|)
5.What will be the output of the following code? `print({'a', 'b'} <= {'a', 'b', 'c'})`
- AError: Invalid operation
- BFalse
- CNone
- DTrue
6.A developer mistakenly believes that converting a list to a set maintains the list's order. What is the correct behavior?
- ADuplicates are preserved
- BOrder is maintained
- COrder is not maintained
- DElements are sorted
7.Which of the following operations can be used to find common elements between two sets?
- AUnion (|)
- BSymmetric difference (^)
- CDifference (-)
- DIntersection (&)
8.In a two-sum problem, why is a set used to track seen numbers?
- AFor O(n^2) complexity
- BTo maintain order
- CTo allow duplicates
- DFor O(1) membership checks