Okta interview questions

Tech / SWE · 7 questions · last reported Jan 2025
Report an interview →

Browse 7 Okta interview questions for software engineering and software development interview preparation. Questions in this collection are tagged for full-time roles. Explore the topics and stages below and filter the collection to plan your practice.

Interview stages in this collection
Phone screen, Onsite, Online assessment (OA)
Practice topics
array (3), design (3), hash-table (3), sorting (2), binary-search (1), doubly-linked-list (1), heap (1), linked-list (1)

Questions come from candidate contributions and online research. Reports reflect past experiences and do not guarantee what Okta will ask. Locked question details require points. Public examples below are free to read.

Read 3 free Okta interview question examples

Browse all Okta questions

7 questions

Free Okta interview question examples

Read the full problem statements and use the links to revisit or share a specific example.

Insert Delete GetRandom

Medium · Phone screen · Onsite · Full-time

This came up in my Okta technical round. Design a set that supports insert, remove, and getRandom all in O(1). The trick is using an array for the actual elements and a hash map from value to index, then swapping the element to remove with the last element before popping. The interviewer was really focused on the getRandom uniformity guarantee and asked what breaks if you use a linked list instead of an array.

Merge Intervals

Medium · Online assessment (OA) · Phone screen · Onsite · Full-time

Merge intervals showed up early in my Okta phone interview. Fairly standard but the interviewer added a twist asking about merging intervals from two separate sorted lists without combining them first. They also asked about the in-place variant where I modify the input array directly.

Find Median Stream

Hard · Phone screen · Onsite · Full-time

Design question from my Okta onsite. Build a data structure that handles a stream of integers and can return the current median at any time. I used two heaps, a max-heap for the lower half and a min-heap for the upper half, rebalancing after each insertion. The interviewer pushed on what happens when you need to remove elements from the stream too, not just add them. We discussed lazy deletion and how it affects the median correctness.