Optimus Information Interview Questions, Process, and Tips

The first round is basically a combination of the Aptitude and Coding rounds which had 22 Questions, 20 on the Quants and Aptitude and 2 Coding Questions. The first coding Question was based on a simple mathematics problem, but the second one was a little difficult which included methods like HashMap and PriorityQueue. But I cleared it in the first round.

Q1. Tell me about your internship, and what technologies you use.
Add your answer
Q2. Tell me about reacting hooks and if oops are present in js give an example
Add your answer
Q3. Difference between Natural and self-join and where we use self-join
Add your answer

Aptitude test basically contains of questions related to aptitude, behavioral questions, sql, oops concepts and coding also.

Q1. After aptitude test whomsoever get shortlisted will go for next round which is technical round. Our Technical interviewers ask questions related to technical aspects like oops, sql, sorting algorithms, run...read more
Add your answer

Q1. It is mainly related to know about the background of the shortlisted candidate related his/her family, education, hobbies, likes, dislikes etc.
Add your answer

Q1. It is basically PI round with Anil Chawla who take interwiews in every aspects it can be related to technical aspects or it can be either personal background also.
Add your answer

Q1. Oops concepts in .NET CORe
Add your answer
Q2. Design principles
Add your answer

Q1. Azure services used in last project
Add your answer
Q2. Any challenges faced
Add your answer

Q1. Why you want to switch
Add your answer
Q2. Why you want to join us
Add your answer

Basic to Medium aptitude Questions

2 coding Qustions
one is easy and another one is medium level

Q1. Reverse a linked list
Ans. 
Reverse a linked list by changing the direction of pointers
• Start with three pointers: current, previous, and next

• Iterate through the linked list, updating pointers to reverse the direction

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q2. Sorting related questions like quick sort ,Merge Sort, and their complexity
Add your answer
Q3. SQL queries related to joins
Add your answer
Q4. Patter based coding questions
Add your answer
Q5. OOPS related Questions -Abstraction, Polymorphism, Encapsulation.
Add your answer
Q6. Project related questions
Add your answer

Q1. Project related questions
Add your answer
Q2. Explain quick sort and their complexity
Ans. 
Quick sort is a sorting algorithm that uses divide and conquer strategy to sort elements in an array.
• Quick sort picks a pivot element and partitions the array into two sub-arrays based on the pivot element.

• It then recursively sorts the sub-arrays.

• The complexity of quick sort is O(n log n) on average and O(n^2) in worst case scenario.

• Example: [5, 2, 9, 3, 7, 6] -> [2, 3, 5, 6, 7, 9]
Answered by AI
Add your answer
Q3. SQL Queries - Second Maximum Salary
Add your answer
Q4. Some coding Questions
Add your answer

Q1. Project related questions
Add your answer
Q2. HTML, CSS , JavaScript related questions
Add your answer
Q3. Some SQL Queries
Add your answer

Aptitude questions were easy and to the point.

2 coding questions were asked and 1st one was medium and 2nd one was hard.

Q1. Oops realted question
Add your answer
Q2. 2 coding ques 1 was related to linkedlist and other was a pattern ques.
Add your answer

Q1. Basic ques related to family background.
Add your answer
Q2. Questions like are you able to do 8 hours work....
Add your answer

Q1. Introduction questions
Add your answer
Q2. Employment history
Add your answer

Q1. Financial review and case study
Add your answer