o9 Solutions Applications Engineer Interview Questions and Answers

1 DP Question, 1 Rest API, 10 Aptitude MCQs, 10 English MCQs

Q1. Linked list based include cycle detection and bottom pointer,DBMS
Add your answer

It was roughly around 70 min. one sql query one coding some mcqs

Q1. Two coding question but easy
Add your answer

Q1. Normal oops question. But one scheduling algorithms But it was different from person to person.
Add your answer

Aptitude questions along with coding questions

Q1. 3 Leet code medium level coding questions
Add your answer
Q2. Resume deep dive
Add your answer

Q1. 2 Leet code medium level questions
Add your answer
Q2. Probability basics
Add your answer

Q1. Behavioural questions
Add your answer

Total of 4 rounds, all based on problem solving and DSA.

Q1. This was also based on problem solving.
Add your answer

Q1. Given an array of strings, print all the possible combinations of strings created by picking one character from each string of the array. The individual strings do not contain any duplicates. Ex: {ABC, DE...read more
Ans. 
Print all possible combinations of strings by picking one character from each string in the array.
• Iterate through each character of the first string and combine it with each character of the second string.

• Repeat the process for all strings in the array to get all possible combinations.

• Use nested loops to generate combinations efficiently.
Answered by AI
Add your answer
Q2. Given an array of size n, print the indices , i which have an equilibrium point around them defined as sum of i-p to i-1 elements = sum of i to t+p-1 elements (equal sum on left side and right side of the ...read more
Add your answer

Q1. Check if given string has Balanced Parentheses.
Ans. 
Check if a string has balanced parentheses.
• Use a stack to keep track of opening parentheses.

• Iterate through the string and push opening parentheses onto the stack.

• When a closing parenthesis is encountered, pop from the stack and check if it matches the closing parenthesis.

• If stack is empty at the end and all parentheses are matched, the string has balanced parentheses.
Answered by AI
Add your answer
Q2. Modified Balanced Parentheses where a character can be matched with any other character, i.e. / with &, ! with ? and so on.
Ans. 
Modified Balanced Parentheses where characters can be matched with any other character.
• Use a stack to keep track of opening characters

• When encountering a closing character, check if it matches the top of the stack

• If it matches, pop from the stack, else return false

• Continue until end of string, return true if stack is empty
Answered by AI
Add your answer
Q3. Very similar to print the spiral order traversal of a matrix
Add your answer

Q1. Given a date in string format, write a java program to return the date n days after the given date. Solve the question without using DateTimeFormatter or any similar Date parsing libraries.
Ans. 
Java program to calculate date n days after given date without using Date parsing libraries.
• Parse the input date string to extract day, month, and year components.

• Calculate the total number of days represented by the input date.

• Add the specified number of days to the total days calculated.

• Convert the final total days back to day, month, and year components to get the new date.
Answered by AI
Add your answer

Q1. Java OOP questions: Function overloading and overriding, use of static function, difference between final, finally and finalize keywords.
Add your answer
Q2. Print all Pythagorean triplets within a given range.
Ans. 
Print Pythagorean triplets within a given range.
• Iterate through all possible combinations of a, b, and c within the given range

• Check if a^2 + b^2 = c^2 for each combination

• Print the triplets that satisfy the Pythagorean theorem
Answered by AI
Add your answer
Q3. Print all combinations of numbers in an array which sum up to a number k. Ex : Arr={3,1,4,5} k=5 Ans : {{1,4},{5}}
Ans. 
Use backtracking to find all combinations of numbers in an array that sum up to a given number.
• Start by sorting the array in non-decreasing order to easily identify combinations.

• Use backtracking to recursively find all combinations that sum up to the target number.

• Keep track of the current combination and the remaining sum as you traverse the array.

• Add the current combination to the result when the sum equals the targe
Answered by AI
Add your answer
Q4. Standard behavioural questions: Why Oracle? Where do you see yourself in 5 years? Your strengths and weaknesses.
Add your answer