Optiver Interview Questions

Design a double-ended queue (deque) data structure that supports efficient insertion and deletion from both ends. Explain the operations and their time complexities.

Describe how you would implement a queue data structure.

How would you implement a queue? As a follow-up, actually build a queue using an array.

What is the difference between UDP and TCP?

Given a string representation of a binary tree, write a function to parse the string and construct the tree. Then, identify and return a list of errors found in the tree, such as nodes with more than two children, more than one root, or duplicate parent-child pairs.

What is memory fragmentation, and how can it impact performance?

Given randomly generated sequences of digits of increasing lengths, displayed one digit at a time, memorize each sequence and then recall and re-enter the sequence in sorted order.