InterviewBit Interview Questions, Process, and Tips

C,C++,#include,conio.h,void main, clrscr(),printf,scanf,getch(),{ open, } close,

Communication skills , present tence , future tence,

Q1. Programing questions
Add your answer
Q2. Coding language program
Add your answer

Q1. Why do you want to get into sales
Add your answer

Q1. What do you know about Scaler
Ans. 
Scaler is an ed-tech startup that offers online courses in technology and business skills.
• Scaler provides courses in programming, data structures, algorithms, and more.

• They offer mentorship and career guidance to help students advance in their careers.

• Scaler has a strong alumni network and partnerships with top tech companies.

• The platform focuses on practical learning and real-world projects to enhance skills.
Answered by AI
Add your answer

Q1. Situation reaction test
Add your answer

Q1. Questions were based on CV only.
Add your answer
Q2. What you have done in the past and what have you contributed?
Add your answer

Q1. Sales specific interview
Add your answer

Q1. Round with Sachit who was senior manager then, specifically on how well one can handle pressure, since this Edtech is all about agility
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round was completely based on Data structures and Algorithms.
 

Q1. 
Sum of Two Numbers Represented as Arrays
Given two numbers in the form of two arrays where each element of the array represents a digit, calculate the sum of these two numbers and return this sum as an ar...read more
Ans.  Two Pointers
1. Approach 1 would fail if the size of arrays is greater than 18 (as the maximum integer range in most of the programming languages is approximately up to 10^18.), so we need a better way to find the sum.
2. We will find the sum in the way we generally do it using a pen and paper i.e starting from the right(LSB), adding individual digits and the previous carry.
3. We can use two pointers to find the sum for each ind...read more
Answered Anonymously
Add your answer
Q2. 
Binary Tree Maximum Path Sum Problem Statement
Determine the maximum path sum for any path in a given binary tree with 'N' nodes.
Note:
• A 'path' is defined as any sequence of adjacent nodes connected...read more
Ans. Recursive Approach
The idea here is to use the recursion. For each node, We can calculate the maximum path sum by keeping track of the following paths:
• Max path sum starting from Left child + Max Path sum starting from Right child + Node’s value.
• Max path sum starting from Left child + Node’s value
• Max path sum starting from Right child + Node’s value
• Node’s value
 
We then pick the maximum one among them. The root of ev...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This was a mix of both technical and non technical questions.
It begins with few coding problems and then resume discussion.
 

Round duration - 180 Minutes
Round difficulty - Easy

Q1. Can you describe the assignment you received to build a website, including all the features and additional requirements?
Ans. 
Tip 1 : Try to cover all the requirements.
Tip 2 : Add some addition features
 
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

My project was discussed in this round, with some changes in the database structure and was given to add some new features.

Q1. What new features would you add to the project you developed?
Add your answer