Available question text
Implement a data structure that supports the following operations, all in O(1) time complexity:
- get(key): Returns the value associated with the given key.
- set(key, value): Sets the value for the given key.
- setAll(value): Sets all existing elements in the data structure to the specified value.
Explain your approach and how you achieve constant time complexity for the setAll() operation.
Related questions
Continue with questions that share topics or the same question type.
- All O`one Data Structure
Coding · Design · Doubly-Linked List · Hash Table
- Implement a data structure with various APIs ensuring that all APIs have an O(1) complexity
Coding
- Classic data structure and algorithm coding problems .
Coding
- Coding test: Given a simple mockup implement that UI. Some CSS is already provided and an API to fetch the data also exists. The recruiter prep doc talked about structuring the code well, making sure all functions work, write CSS and write tests. There is no way you can do it all in 1 hour, so it's probably best to ask the interviewer what they expect
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Cisco
Data Structure with O(1) Set All Operation
Reported Oct 8, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View sourceMicrosoft
Data Structure with O(1) Set All Operation
Reported Mar 12, 2026 · 1 source report
PRINCIPAL
Source snapshot: Nov 12, 2026
View source