RejectedOnsite

Full OCI Loop, Rejected After a Short HM Round

OracleSoftware Engineer · Onsite · Oct 2026

Phone screen: a sliding window problem, find the shortest sub-array whose sum is greater than or equal to a given target, except that duplicate numbers are only counted once (e.g. sum([3,3,2]) = 5). There was also one regular BQ question. VO: Round 1: LC 200 plus a BQ. The follow-up asked me to write it with BFS, and they also asked about Making A Large Island, where I walked through my approach.…

Shared by a candidate · reported Oct 2026. Interview formats change; use it as a guide, not a script.