Uber Software Engineer interview experience

One prompt asked for the k-th largest subarray bitwise OR, and I used the key observation that as you consider subarrays from a fixed index, the OR values behave in a non-decreasing way—so the number of distinct OR results stays limited.

Another question felt like a textbook application of a “walk” approach on a segment tree, which made the solution pattern more about knowing the right technique than improvising. The final coding part was an MST problem where either Prim or Kruskal could work, but there was an important modification needed for the way the problem defined weights and