Oracle Screening Round: Experience: 5 years | Role: IC3 | Location: Bangalore
Summary
I participated in an Oracle screening round where I attempted two coding problems but was unable to fully solve them.
Full Experience
A recruiter messaged me on LinkedIn, I shared my resume, and got invited a week later. The interviewer began by explaining the agenda and how the round would proceed. He then gave a short introduction about himself: he works on Oracle Health, on a product for the German market. After that, he asked about my experience, and I walked him through it. He asked a few basic questions from my resume, covering my TCS and Accenture experience. Next, he shared a HackerRank link (the same one from the interview invite email), and we both joined it. He then shared the questions. 1. Remove All Adjacent Duplicates in String II (LeetCode 1209) The problem was framed as a slightly unusual story, but I later realized it was this question. I tried a hashing approach, which didn't work. The interviewer then hinted that I should use a stack, but I wasn't able to complete it. 2. Employee attendance Given a List<String> of attendance records and an integer m (the number of employees), I had to find for how many consecutive days all employees were present. For example, with m = 3, n = 5 (the number of days) and the list ['YYY', 'YYY', 'YNN', 'NNN', 'YNY'], the answer is 2, because all three employees were present on the first two days. I solved this only partially. My solution passed around 7 of 23 test cases.
Interview Questions (2)
Remove All Adjacent Duplicates in String II
Given a string s and an integer k, repeatedly delete any group of k identical adjacent characters from the string. Return the final string after no more deletions can be made.
Employee attendance
Given a List<String> of attendance records for n days and an integer m representing the number of employees, determine the number of consecutive days where all m employees were present. Each character in a record is either 'Y' (present) or 'N' (absent). For example, with m = 3, n = 5 and the list ['YYY', 'YYY', 'YNN', 'NNN', 'YNY'], the answer is 2 because all three employees were present on the first two days.