Oracle Interview Experience | OAL | IC3 | Reject
Summary
I applied for a Senior AI engineer role at Oracle's OAL team and went through an OA with machine learning and coding challenges. Despite solving the coding question optimally, I faced challenges in the interview round where I struggled with a backtracking question. However, I performed well on LRU cache and Top Kth Element problems. The puzzle about measuring 9 minutes with hourglasses was solved correctly. Overall, I didn't receive positive feedback and was rejected.
Full Experience
I applied for a Senior AI engineer role at Oracle's OAL team through Naukri. The OA included topics like Machine Learning, LLM, Prompt Engineering, Aptitude, and Problem Solving. There were 10 MCQs and one coding question where I had to find the index to remove from an array so that the sum of even and odd positions equals. I initially used a brute force approach but then optimized it to pass all test cases.
In the first interview round, there were two interviewers, one being the Hiring Manager. The HM asked a backtracking coding question about generating number strings where the sum of digits equals a lucky number K. I struggled with this and bombed it. The other interviewer asked questions about my resume and then moved on to two coding problems: LRU cache using a doubly linked list and Top Kth Element using a min heap. I answered these well. The HM also asked a puzzle about measuring 9 minutes with 7 and 4-minute hourglasses, which I solved in 5 minutes. However, the HR informed me I didn't get positive feedback and was rejected, likely due to the initial challenges.
Interview Questions (5)
Given an array of numbers, remove one number at any index such that the sum of values at even and odd positions becomes equal. Return the index of the array. If multiple indices are present, return the first one. If no such index exists, return -1.
Given a string length N and a lucky number K, return all number strings where the sum of digits equals K. For example, for N=4 and K=9, valid outputs include "0009" and "5742".
Implement an LRU cache using a doubly linked list.
Find the Kth largest element in an array using a min heap.
You have two hourglasses: one that measures 7 minutes and another that measures 4 minutes. You need to measure exactly 9 minutes.