Idea Usher Intern Interview Questions and Answers

Basic questions divided in 4 sections of 20 min each

2-3 case study was given and asked to give answer based on that

Q1. Project discussion
Add your answer
Q2. Technical Project discussion
Add your answer

Q1. Questions on DSA were asked by the interviewer at first.
Add your answer
Q2. Some theoretical questions from DBMS and oops and also asked to write some SQL queries.
Add your answer

Q1. This round was also similar to the first technical round at first given a DSA question.
Add your answer
Q2. After that I was asked to write some SQL queries and also questions from resume were asked.
Add your answer

Q1. This was managerial round which was was offline in person interview. At first he asked sone basic DBMS and oops questions.
Add your answer
Q2. Then gave me a question and asked me to write a complex SQL query.
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

Q1. 
Inorder Traversal of Binary Tree
You are provided with a Binary Tree composed of 'N' nodes, each holding integer values. Your task is to compute the Inorder traversal of this binary tree.
Example:
For t...read more
Ans. 
The task is to find the in-order traversal of a given binary tree.
• Implement a recursive function to perform in-order traversal of the binary tree

• Start from the left subtree, then visit the root node, and finally visit the right subtree

• Use an array to store the values of the nodes in the in-order traversal
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Interview on google meet

Q1. Given two tables, how would you return an inner join on a common column (key)?
Ans. 
The inner join operation combines rows from two tables based on a common column (key).
• Use the JOIN keyword in the SQL query to perform an inner join.

• Specify the common column (key) in the ON clause of the join.

• The result will contain only the matching rows from both tables.
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted matrix, find the position of a target integer in the matrix.
• Iterate through each row and column of the matrix

• Compare the target integer with the current element

• If the target integer is found, return the position

• If the target integer is not found, return {-1, -1}
Answered by AI
Add your answer

Machine coding round

Q1. About projects, like the what stack used
Add your answer
Q2. Hr question about why to join browserstack
Add your answer

Basic questions divided in 4 sections of 20 min each

2-3 case study was given and asked to give answer based on that

There is 2 major Coding Questions using lot of major languages