Oracle IC3 screening round
- Posted
- 1 Oct 2025
Summary
I recently had a screening round for an IC3 position at Oracle, which involved a profile discussion followed by two Data Structures and Algorithms questions.
How it went
My screening round for an IC3 role at Oracle began with a thirty-minute discussion about my professional profile. Following that, I was presented with two Data Structures and Algorithms problems. The first question was about merging overlapping intervals, and the second involved finding the longest non-repeating substring within a given string.
Questions asked (2)
- 01
Merge Intervals
Data Structures & Algorithms · Medium
Given an array of intervals
intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.For example, given
[[1,3],[2,6],[8,10],[15,18]], the output should be[[1,6],[8,10],[15,18]]. - 02
Longest Substring Without Repeating Characters
Data Structures & Algorithms · Medium
Given a string
s, find the length of the longest substring without repeating characters.For example, if
s = "abcabcbb", the answer is 3 (for "abc"). Ifs = "bbbbb", the answer is 1 (for "b").