Oracle Senior Software Engineer Interview Questions, Process, and Tips for Experienced

Q1. Sort the array of 0,1,2
Ans. 
Sort an array of strings containing '0', '1', and '2'.
• Use counting sort algorithm to count the occurrences of '0', '1', and '2'.

• Create a new array based on the counts of each element.

• Return the sorted array.
Answered by AI
Add your answer
Q2. All c++ core concepts and oops concept. Find second greatest element in an array without sorting.
Ans. 
Find the second greatest element in an array without sorting using C++ concepts.
• Iterate through the array to find the greatest element.

• While iterating, keep track of the second greatest element.

• Return the second greatest element once the iteration is complete.
Answered by AI
Add your answer

Q1. Design quick ecommerce site.
Ans. 
Designing a quick ecommerce site involves creating a user-friendly interface with easy navigation and secure payment options.
• Focus on a clean and intuitive user interface

• Implement a robust search functionality for products

• Include secure payment gateways like PayPal or Stripe

• Optimize site speed for quick loading times

• Ensure mobile responsiveness for on-the-go shopping

• Integrate customer reviews and ratings for trust-buil...read more
Answered by AI
Add your answer
Q2. Consumer producer multithreading program.
Ans. 
Consumer producer multithreading program involves multiple threads sharing a common buffer to produce and consume data.
• Use synchronized data structures like BlockingQueue to handle thread synchronization.

• Implement separate producer and consumer classes with run methods.

• Use wait() and notify() methods to control the flow of data between producer and consumer threads.
Answered by AI
Add your answer
Q3. Find missing and repeating element in an array of 1 to n elements. N is the size of array. Solve in O-n time and O-1 space.
Ans. 
Find missing and repeating element in an array of 1 to n elements in O(n) time and O(1) space.
• Iterate through the array and for each element, mark the element at index equal to its value as negative. If the element is already negative, it is the repeating element.

• After marking all elements, the positive element's index + 1 is the missing element.

• Example: Array ['1', '2', '3', '3', '5'] - Repeating element is '3' and mi
Answered by AI
Add your answer

Q1. What is expected compensation
Ans. 
Expected compensation should be based on industry standards, experience, skills, and location.
• Research industry standards for Senior Software Engineer salaries

• Consider your level of experience and skills

• Take into account the cost of living in the location of the job

• Negotiate based on your value to the company
Answered by AI
Add your answer

DSA questions
1. Sort array containing only 0,1,2 as elements inplace.
2. Identify and remove linked list

DSA questions based on graphs
Asked to implement Variant of Dijikstra algorithm
Vertical order traversal
Several puzzle

Q1. LLD round Questions on work in current company Questions on projects
Add your answer
Q2. Tech stack and micro services architecture in company.
Add your answer

Q1. Hiring manager round HLD of google drive Advanced data structures questions General technical questions
Add your answer

Q1. Longest non repeating subsequence in a string
Ans. 
Find the longest subsequence in a string without repeating characters.
• Use a sliding window approach to keep track of the characters seen so far.

• Update the start index of the window when a repeating character is encountered.

• Keep track of the longest subsequence length seen so far.
Answered by AI
View 1 more answer
Q2. Conceptual based on Java
Add your answer

Q1. Questions on basic Java, OOP and Multithreading
Add your answer
Q2. Rotate k elements to the right in an array
Ans. 
Rotate k elements to the right in an array
• Create a new array with the same length as the original array

• Copy elements from the original array to the new array starting from index (k % array length)

• Copy remaining elements from the original array to the new array

• Return the new array as the rotated array
Answered by AI
Add your answer
Q3. Count nodes in a binary tree without using recursion
Ans. 
Count nodes in a binary tree without using recursion
• Use a stack to keep track of nodes to visit

• Pop nodes from the stack and increment count for each node visited

• Continue until stack is empty
Answered by AI
Add your answer

Q1. Longest Palindromic Substring in a given String
Ans. 
Find the longest palindromic substring in a given string.
• Use dynamic programming to check if substrings are palindromes.

• Start with single characters as potential palindromes and expand outwards.

• Keep track of the longest palindrome found so far.
Answered by AI
Add your answer
Q2. Questions on Java, SpringBoot and RestAPIs
Add your answer

Q1. Questions on my projects
Add your answer
Q2. SubString implementation
Add your answer