Big Oh Notation Interview Questions, Process, and Tips

There were two coding questions. I solved them both using Hashmap. Solution were to be written simply on text field given. This was an online non proctored test.

This time we were given 2 more coding question to be solved in presence of hiring team this was on campus. Off campus process is different as my friend who applied off campus had an GD in second round.

Again 2 question were given to be solved in presence of hiring team.

Q1. Candidates who solved all the 6 questions of 3 rounds in given time limits were qualified for this round. They simply asked about DBMS , OOPS, DSA. and then suggested me to learn JAVA before joining and...read more
Add your answer
Q2. Implement linked list
Ans. 
A linked list is a data structure where each element points to the next one.
• Create a Node class with a value and a next pointer

• Create a LinkedList class with a head pointer and methods to add, remove, and traverse nodes

• Example: LinkedList ll = new LinkedList(); ll.add(5); ll.add(10); ll.remove(5);
Answered by AI
Add your answer
Q3. Inorder tree traversal.
Ans. 
Inorder tree traversal is a way of visiting each node in a binary tree in a specific order.
• Start at the leftmost node of the tree

• Visit the left subtree recursively

• Visit the current node

• Visit the right subtree recursively
Answered by AI
Add your answer

There was 2 Case Study Questions

The Group Discussion round was basically to analyze the analytical skills .
Firstly , They asked to Introduce
Then some situational questions were asked.

Q1. This was final round to check confidence and basic general knowledge.
Add your answer
Q2. Questions based on key skills candidate have.
Add your answer

It was a technical GD
They were asking questions on Time and Space Complexity, and more on technical concepts

ArrayList Questions based on problem solving and basics of DSA

Q1. Questions based on flutter and android , concepts of OS and Java
Ans. Topic on flutter and concepts should be known for application developer etc
Answered Anonymously
Add your answer
Q2. Question on recursion(Palindrome using recursive function)
Add your answer

2 coding questions on hash map(DSA)

Worst GD, it was not even a GD the interviewer told us to unmute & speak only when asked to. During the whole GD, I had not got a single chance to speak even if I knew the answers of some of questions. He was asking the same number of persons the questions again and again. Equal chance to speak was way back thing he didn't even asked many of us the questions. It was totally a waste of time sitting their and listening the same people. I never have seen such GD in my life !
At last only one student from so many got selected for next round and that person was the same who he was asking the questions.