OKX Interview Questions
We track 4 interview questions reported from OKX: 4 in Coding & Leetcode-style Questions. They average 2.8/5 difficulty — medium for a working engineer — and every one was reported by someone who sat the loop, not written by us. The topics that come up most: design, two-pointers, array, dutch-national-flag.
Practice these on the problems board →Question mix
- Coding & Leetcode-style Questions4
Difficulty
- 2/5 — easy1
- 3/5 — medium3
Asked for SWE (4)
Topics OKX asks about
Reported OKX questions
Sort Colors
3/5This classic array reorganization puzzle, featured in coding evaluations at OKX, challenges you to group three distinct categorical elements together in place within linear time complexity without relying on built-in sorting utilities. It tests your ability to manipulate pointers efficiently through a single pass over the dataset while maintaining constant extra space. Discover the complete problem walkthrough and optimal algorithmic solution by obtaining a subscription.
Coding & Leetcode-style Questionstwo-pointersarraydutch-national-flagMin Stack (Basic Data Structure Exercise)
2/5Featured in an OKX coding evaluation, this fundamental data structure problem asks candidates to design a specialized container that supports standard stack operations alongside constant-time retrieval of its smallest element. Programmers must handle various command inputs efficiently while delivering correct responses for insertions, deletions, and lookup queries under large input scales. The challenge tests fundamental algorithmic thinking, time-complexity awareness, and clean data structure implementation. The complete problem statement, constraints, and reference solution require a paid subscription.
Coding & Leetcode-style QuestionsstackdesignRestore IP Addresses
3/5Tackling string parsing and combinatorial generation is the focus of this classic backtracking problem, noted from recent candidate experiences at OKX. Given a continuous string of numeric digits, your objective is to find every viable combination that forms a legitimate Internet Protocol address by placing separators correctly. This puzzle tests your recursive thinking, boundary condition checks, and string manipulation capabilities. Gain immediate access to the full problem text, test cases, and a comprehensive solution by upgrading to a paid subscription.
Coding & Leetcode-style QuestionsbacktrackingstringDesign Linked List
3/5This classic data structure puzzle, commonly asked by OKX, challenges programmers to construct a sequential node-based list supporting various positional insertion, deletion, and retrieval methods. The exercise tests your pointer manipulation skills, boundary condition handling, and capability to maintain internal references accurately during dynamic modifications. Interviewers rely on this question to gauge fundamental memory management and object-oriented design competency. Unlock the full prompt and verified reference implementation with a subscription.
Coding & Leetcode-style Questionslinked-listdesign
Companies that ask similar questions
OKX interview FAQ
- How many OKX interview questions are available?
- 4 reported OKX questions, the largest group being Coding & Leetcode-style Questions (4).
- How hard is the OKX interview?
- Across the questions we track, OKX averages 2.8 out of 5: 1 at 2/5, 3 at 3/5.
- What topics does OKX ask about?
- Most often design, two-pointers, array, dutch-national-flag, stack.