OCI Software Developer 3
Summary
I applied for an Oracle Software Developer role and went through a series of interviews. The first round was a medium-level DSA problem and resume-based questions. The subsequent loop interviews included a mix of coding, design, and behavioral questions. The final interview ended on a negative note due to the WFO policy discussion.
Full Experience
I am currently working in a top fintech company as a SDE-2. I had previously worked in one of Oracle's subsidiaries. I got the call from a recruiter one day. She scheduled the first eliminator round. I was asked a medium-level DSA problem and a lot of questions on my resume. I cleared the first eliminator round.
The recruiter then scheduled all my loop interviews on a day. Each round lasted one hour.
Loop Interview 1:
1. Write the python function which will be used to run a shell command in parallel on thousands of nodes. We need to optimize the code so that it does not overwhelm the machine where we run this code.
2. Design a volume as a service with inputs: size of volume, IOPS, mount path. Should adhere to general cloud service agreements like high availability.
The interviewer was very friendly. He said 'we' will solve this design problem. Gave a lot of hints. He also said you can browse the net if you are not sure of the syntax.
Loop Interview 2:
1. Find the longest palindromic substring in a string.
2. Follow up: If you can add a character to the substring at any place. What would be the longest palindromic substring?
I was able to code the brute force approach. Got stuck in the follow up question tho. Messed it up !!
Loop Interview 3:
1. Why you want to switch?
2. Current Compensation Details?
3. Can you work from office 5 days?
4. Write Merge Sort
I was turned off when he said the WFO policy and started asking current compensation. Also interviewer seemed really strict.
Interview Questions (3)
Write a Python function that runs a shell command in parallel on thousands of nodes. The code should be optimized to avoid overwhelming the machine where the code is executed.
Find the longest palindromic substring in a given string. Follow up: If you can add a character to the substring at any place, what would be the longest palindromic substring?
Implement the Merge Sort algorithm.