Got the offerSenior Application Developer at Oracle
- Difficulty
- Process took
- 2-3 Weeks
- Rounds
- 4
- Format
- Hybrid
- Applied via
- Other
How it went
- Every round had a purpose, some tested logic, others creativity or depth. Go in expecting anything between basic string handling to tree-based recursion to API-based questions.
- When facing custom questions, don’t panic, break it down, talk aloud, and build a clean approach, even if you don’t reach a full implementation.
What they would tell you
- Every round had a purpose, some tested logic, others creativity or depth. Go in expecting anything between basic string handling to tree-based recursion to API-based questions.
- When facing custom questions, don’t panic, break it down, talk aloud, and build a clean approach, even if you don’t reach a full implementation.
How to prepare
- Brush up on tree-based recursive problems.
- Understand array fundamentals like Kadane’s algorithm, as it often appears in different forms.
Round by round
- 1
DSA Round 160 min
The interview started with a string manipulation task, Design a function to encode and decode a string such that the encoded version is not easily readable at a glance. And a similar question that I have mentioned.
- 2
DSA Round 260 min
Given a binary string, identify all substrings of length > 2 that are repeating consecutively, and count the number of repetitions. Input: "010110111" Output: 101 → 2 011 → 2 And a standard array problem, but the interviewer wanted the most optimized solution along with its explanation.
- 3
Leadership + Logical Problem Solving45 min
This was more relaxed and focused on how I approach problem solving in real-world scenarios. After a few conversations around my current role and contributions, the interviewer gave me this: Given a starting date and a number of days, return the final date after adding the given number of days. Input: 01/03/2025, Days = 1000 Output: 25/11/2027 We discussed leap years, month boundaries, and how to use java.time.LocalDate or custom calendar logic in Java/Python.
- 4
Techno-Managerial + DSA + SQL60 min
This final round was a blend of resume discussion, behavioral questions, and two small technical challenges. Given a list of numbers, find all possible combinations that sum up to a target value. A variation of the Combination Sum problem, focus was on recursive/backtracking logic and pruning invalid paths. SQL Question: Given table: (emp_id, date_of_salary, salary_amount) Write a query to find employees whose cumulative salary has exceeded 10,00,000. The round ended with questions around team collaboration, handling deadlines, and challenges faced in my previous projects.
What came up
A candidate-reported account, lightly edited. Interview processes change by team and date.