Internshala Intern Interview Questions and Answers

All the logical Qustions

Q1. They will ask you about dsa qustions
Add your answer

Basic logic based questions

Basic coding questions

Q1. Pattern based question
Add your answer
Q2. Reverse a string
Add your answer
Q3. Other technical question related to DBMS, MySQL, CN, Web Dev and AWS
Add your answer

Q1. Introduction, personal details
Add your answer
Q2. Strength and weakness
Add your answer

Q1. This was a managerial round, where he went through my resume and open my github and asked me to explain the code from different projects
Add your answer
Q2. Pattern based question (difficulty : hard)
Add your answer

Q1. Describe yourself
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing (10 am- 11 am)
For this round I had slightly more time than the last, due to the fact that the weekend fell in between.The interviewer was very very cool and helping this time, something which I kept at the last in my list of probable things that can happen during an interview. Duration of this round was around 45 minutes.

Q1. Connect n ropes with minimum cost
You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. W...read more
Ans. Brute Force Approach
Clearly, the rope which is picked up first will be having its length included more than once in the final cost. If we pick a rope of larger length earlier, then we will be adding some extra cost to our final result.
So, the idea is to pick ropes of smaller lengths initially to minimize the impact on our final cost.
So, each time we will be finding two smallest ropes, connecting them and
adding the resu...read more
Answered by CodingNinjas
View 1 more answer
Q2. Validate BST
You have been given a binary tree of integers with N number of nodes. Your task is to check if that input tree is a BST (Binary Search Tree) or not.
A binary search tree (BST) is a binary tr...read more
Ans. BST property
The approach is based on the fact that the value of each node in a BST is greater than the value of all the nodes in the left subtree and smaller than the value of all the nodes in the right subtree.
 
Here is the complete algorithm-
• For each node, we store the minimum and maximum value allowed for that node. Initially, for the root node, the minimum value would be -10^9 and the maximum value should be 10...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 30 minutes
Round difficulty - Medium

This round was on call where I was just supposed to answer the HRquestions that were asked. It started with a brief interview with one another and then moved to questions on DBMS, operating systems, computer networks and all. Almost 10-15 questions were asked and I probably answered 90% of them correctly.

Q1. Basic HR Questions
Assume you are hired, then how long would you expect to work for us?
How would you rate yourself on a scale of 1 to 10?
Ans. 
Tip 1 : Try answering in an optimistic manner
Tip 2 : relating the real life examples to support your points will be very helpful
Tip 3 : putting all the energy and showing the enthusiasm is also very important
Answered by CodingNinjas
Add your answer