← Deutsche Bank questions

Find max and min in O(1) time using Queue

Filed under Deutsche Bank

Implement a data structure or algorithm using standard queue operations to find the maximum and minimum elements in O(1) time.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Deutsche Bank questions

Collected from public candidate posts and coding forums. Updated Nov 2026.