GeeksforGeeks Question · Jul 2016 · Los Angeles

Oku Tech (Bro Ex) Interview Experience | Set 1 (On-Campus)

SWE Phone Screen Intern Easy

Question Details

1st Round :- It consisted of 3 SQL queries and 4 coding questions - 2 were difficult and 2 were of moderate level. If you solve all the queries and 3 coding questions then...

Full Details

1st Round :- It consisted of 3 SQL queries and 4 coding questions - 2 were difficult and 2 were of moderate level. If you solve all the queries and 3 coding questions then you will easily clear the First round. 2nd Round - Technical Interview. Asked basic introductory questions and a few Puzzles like the 9 balls problem. A few questions asked were - 1) delete a node from a linked list 2) check if the given number is an armstrong number or not 3) search a node in a Binary Tree using Level order Traversal 4) Find the first non recurring character in a string (using Hash Map ) 3rd Round - Technical Interview. Asked basic questions related to my projects and Internship and my areas of interest. questions asked : - 1) Find the maximum sub array sum in a given array with time complexity O(n) 2) find local minima in an array ( element whose next and previous elements are greater than this number ) . This had to be solved with time Complexity O(logn) Also asked easy sorting and searching questions. I was not selected after this Round. Best of Luck !!!

Free preview — 6 questions shown. Unlock all Oku Tech questions →

About This Question

This is a reported interview question from a oku tech interview for a swe role (intern level) during the phone screen round reported in 2016.

It covers the following topics: Linked List, Trees, Strings, Binary Tree, Sql, Sorting, Hash Table, Arrays .

Difficulty rating: Easy

About Oku Tech Interview Reports

This question was reported by a candidate who interviewed at Oku Tech. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.

Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Oku Tech are the higher-signal extractions to take from this report.

For broader preparation context, the Oku Tech interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.

How To Practice This Type of Question

Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.

Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Oku Tech reports consistently are the ones worth investing in; one-off niche problems are not.

During Your Oku Tech Round

Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.

The single most predictive failure mode in Oku Tech reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.