How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent OKX interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
O
OKX Coding Interview Questions
3 problems · 0 Easy, 2 Medium, 1 Hard · Ranked #352 of 458
Difficulty breakdown
0 Easy
0% · avg 23%
2 Medium
67% · avg 59%
1 Hard
33% · avg 18%
Top topics
array
100%1.7x
matrix
66.7%7.5x
depth-first-search
33.3%3.7x
breadth-first-search
33.3%4x
union-find
33.3%11.3x
queue
33.3%23.1x
Interview profile
Based on 3 reported problems, OKX interviews are significantly harder than average - 33% Hard vs 18% across all companies. The majority (67%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, OKX puts unusual emphasis on matrix (66.7% of problems, 7.5x the industry average), array (100% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (100%), matrix (66.7%), depth-first-search (33.3%), breadth-first-search (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 3 problems
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Count Subarrays With Fixed Bounds You are given an integer array nums and two integers minK and maxK. | Hard | Very Likely | arrayqueuesliding-window | Solve |
Kth Smallest Element in a Sorted Matrix Given an n x n matrix where each of the rows and columns is sorted in ascending order, return the kth smallest element in the matrix. | Medium | Very Likely | arraybinary-searchsorting | Solve |
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
MediumVery Likely
arraydepth-first-searchbreadth-first-search
Count Subarrays With Fixed Bounds
SolveYou are given an integer array nums and two integers minK and maxK.
HardVery Likely
arrayqueuesliding-window
Kth Smallest Element in a Sorted Matrix
SolveGiven an n x n matrix where each of the rows and columns is sorted in ascending order, return the kth smallest element in the matrix.
MediumVery Likely
arraybinary-searchsorting
Preparing for your OKX coding interview
OKX interviews focus heavily on array, matrix, depth-first-search problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. OKX interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Frequently Asked Questions
What coding problems does OKX ask in interviews?add
OKX has been reported to ask 3 distinct coding problems. The most common topics are array, matrix, depth-first-search. 0 are Easy difficulty, 2 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are OKX coding interviews?add
Based on 3 reported problems, OKX interviews are significantly harder than average - 33% Hard vs 18% across all companies. 67% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a OKX coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, matrix, depth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Other companies to explore
Ready to ace your OKX interview?
Simulate a real OKX coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a OKX interview with AIarrow_forward