InterviewBit Interview Questions and Answers

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. 
Given two numbers represented as arrays, calculate their sum and return the result as an array.
• Iterate through the arrays from right to left, adding digits and carrying over if necessary

• Handle cases where one array is longer than the other by considering remaining digits

• Ensure the final sum array does not have any leading zeros
Answered by AI
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. 
Find the maximum path sum in a binary tree by considering any path of adjacent nodes.
• Traverse the binary tree to find the maximum path sum by considering all possible paths.

• Keep track of the maximum sum encountered during traversal.

• Update the maximum sum if a new path with a higher sum is found.

• Consider both left and right child nodes while calculating the path sum.

• Handle null nodes represented by -1 in the input.
Answered by AI
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. 
I was tasked with building a website for a small business, including features like a homepage, product pages, contact form, and online payment integration.
• Homepage design with company logo and brief description

• Product pages with images, descriptions, and pricing

• Contact form for customers to reach out

• Online payment integration for seamless transactions
Answered by AI
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?
Ans. 
I would add a real-time chat feature to enhance communication among users.
• Implementing a chat system using web sockets for instant messaging

• Adding features like read receipts, emojis, and file sharing

• Integrating notifications for new messages
Answered by AI
Add your answer