Oracle Sdet Automation Test Engineer Interview Questions and Answers

Basic Easy Level LeetCode Questions.

Medium Level Questions from LeetCode along with questions on String and one scenario based DS question.

Q1. Manager Round where he asked me about my past experience and some basic day to day tasks
Add your answer

Good often good in aptitude

Code test are hard and not easy to crack

Q1. Why you want to join this company
Add your answer

Q1. Discussion about their role in company
Add your answer

6 questions asked in an interview

Q1. Slider window problem
Ans. 
The slider window problem involves finding the maximum sum of a subarray of a fixed size k within an array of integers.
• Use a sliding window approach to efficiently find the maximum sum subarray.

• Keep track of the current sum within the window and update it as you slide the window.

• Maintain a variable to store the maximum sum found so far.

• Example: Given array [1, 3, -1, -3, 5, 3, 6, 7] and window size k=3, the maximum sum
Answered by AI
Add your answer
Q2. Stock buy sell problem
Ans. 
The stock buy sell problem involves finding the maximum profit that can be made by buying and selling a stock at the right times.
• Calculate the difference between each pair of consecutive prices in the array

• Find the maximum subarray sum of the differences using Kadane's algorithm

• The maximum subarray sum is the maximum profit that can be made
Answered by AI
Add your answer

Q1. Selenium and testng questions.
Add your answer
Q2. Java program to reverse a sentence
Ans. 
Java program to reverse a sentence
• Split the sentence into words using the split() method

• Create a new array to store the reversed words

• Iterate through the words in reverse order and add them to the new array

• Join the reversed words using the join() method to form the reversed sentence
Answered by AI
Add your answer

Q1. Oops and collection questions.
Add your answer
Q2. Program to find repeated character in a word.
Ans. 
Program to find repeated character in a word.
• Iterate through each character in the word

• Store each character in a data structure

• If a character is already present in the data structure, it is a repeated character
Answered by AI
Add your answer