Big Oh Notation Technical Trainee Interview Questions and Answers

Easy to medium DSA questions. 2 Questions are asked in this round

One OOPS based question is asked.

Questions based on your tech stack

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