I applied online.

This was the first round of the interview. I was asked two questions: one was regarding the designing of a data structure with O(1) time complexity. The interviewer helped me a bit with hints. I was successfully able to solve this with the given constraints. For the other question, however, I couldn't arrive at an optimized approach. Maybe that's why I got rejected after the first round.

Question 1: Design a data structure with O(1) time complexity for insertion, deletion, and random access.

Question 2: Input: candidates = [2, 3, 6, 7], target = 7. Output: [[2, 2, 3], [7]]. [1] 7 [1, 1, 1...1].