I applied online. I interviewed at Oracle in Apr 2019
Interview
Applied online (Entry level hire),
Contacted by recruiter to apply for a max of 7 teams,
I was scheduled phone interviews from two teams on the same day
Interview questions [1]
Question 1
1. Technical projects, why this design, how did you handle problem x,
2. Given a head of a linked list, detect if there is a cycle, if present print the start of cycle else print null
I applied through college or university. The process took 4 weeks. I interviewed at Oracle (Redwood City, CA) in Feb 2017
Interview
there are 3 round interview. 1 phone, interviewa, 2 onsite interviews. Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
Interview questions [1]
Question 1
Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
I applied through college or university. The process took 2 weeks. I interviewed at Oracle (Redwood Shores, CA) in Mar 2019
Interview
Applied through Campus Recruitment on Handshake and got an email the next week asking me to select 7 positions from a group of 15 positions. Applied to 7 positions and got an interview call from two of them. The telephonic interview was scheduled the next week for both the teams each concluding on 30 minutes.