AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
WhatsApp Interview Questions and Answers
Be the first one to contribute and help others!
Interview questions from similar companies
I appeared for an interview before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .
- Q1.
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are
Nneighbors living at different points on the plane. Your goal is to visit exactlyKneighb... - Ans.
Find the K closest points to the origin in a 2-D plane using Euclidean Distance.
Calculate the Euclidean Distance of each point from the origin
Sort the points based on their distances
Return the first K points as the closest neighbors
- Q2.
Power Set Generation
Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.
A power set of a set 'ARR' i...
- Ans.
Generate the power set of a sorted array of integers with individually sorted subsets.
Use recursion to generate all possible subsets by including or excluding each element in the array.
Sort each subset before adding it to the power set.
Handle base cases for empty array and single element array.
Ensure the subsets are unique by using a set data structure.
Time complexity can be exponential due to the nature of generating
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Hard
This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .
- Q1.
Roman Numeral to Integer Conversion
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Explanation:
Roman numerals are represented by seven different symbol...
- Ans.
Convert a Roman numeral string to its integer equivalent.
Create a mapping of Roman numeral symbols to their integer values.
Iterate through the input string and add the corresponding integer values.
Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).
- Q2.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the question.
Return the sorted list of pairs.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.
- Q1.
Arithmetic Expression Evaluation Problem Statement
You are provided with a string
expressionconsisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express... - Ans.
Evaluate arithmetic expressions in infix notation with given operators and precedence rules.
Parse the infix expression to postfix using a stack.
Evaluate the postfix expression using a stack.
Handle operator precedence and parentheses while evaluating.
Ensure no division by zero cases and operands fit in 32-bit integer.
- Q2.
Remove Duplicates from Sorted Array Problem Statement
You are given a sorted integer array
ARRof sizeN. Your task is to remove the duplicates in such a way that each element appears only once. The outpu... - Ans.
Remove duplicates from a sorted array in-place with O(1) extra memory.
Use two pointers - one for iterating through the array and another for placing unique elements.
Compare current element with next element to identify duplicates and skip them.
Update array in-place by moving unique elements to the front.
Return the length of the array after removal of duplicates.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .
- Q1. How does Facebook store likes and dislikes?
- Ans.
Facebook stores likes and dislikes using a combination of databases and algorithms.
Likes and dislikes are stored in databases such as MySQL or Cassandra.
Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.
User interactions with posts, pages, and ads are tracked to determine likes and dislikes.
Likes and dislikes may also be used to personalize the user's feed and target ads mor
- Q2. How does Facebook implement graph search?
- Ans.
Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.
Facebook uses a graph database to store connections between users, pages, groups, etc.
The graph search algorithm traverses the graph to find relevant connections based on user queries.
It takes into account factors like user relationships, interests, and interactions to provide personalized sea
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.
- Q1. What is Hadoop and why is it used?
- Ans.
Hadoop is a framework for distributed storage and processing of large data sets.
Hadoop is used for storing and processing big data across a distributed network of computers.
It is based on the MapReduce programming model, which allows for parallel processing of data.
Hadoop consists of HDFS for storage and YARN for resource management.
It is used for tasks like data warehousing, log processing, recommendation systems, and...
- Q2. How does Facebook Chat work?
- Ans.
Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.
Facebook Chat uses websockets for real-time communication between the client and server.
Long polling is used to check for new messages when websockets are not supported.
Push technology is used to notify users of new messages even when the chat window is not open.
Messages are stored in a database an...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
Tips: Just try coding as much as you can in the four years of graduation.
Round: Interview
Experience: Three Coding Interview and a Behavioral Interview were conducted.
Tips: Try to get some prior knowledge about the company's infrastructure.w
General Tips: Practice as much problems as you can online or offline.
Skill Tips: Coding is the key for any software company.
Skills: Coding
College Name: IIT KHARAGPUR
Motivation: Its the best in business
himanshu arora
Interview Preparation Tips
Experience: it was a basic test, CAT level questions and can be easily cleared
Tips: keep your cool, don't panic
Duration: 60 minutes
Total Questions: 60
College Name: IIT BOMBAY
Interview Preparation Tips
Experience: English was unpredictable.. Maths was easy but it will be good if you have practice, logical reasoning requires practice but are interesting
Tips: Leave english comprehensions for the end.. Do not waste too much time on one question even if it appears easy.. attempt the paper in the order of your comfort and mark every questions in case of NO negative marking
Duration: 60 minutes
Round: HR Interview
Tips: Smile!! And think before speaking anything, else you may contradict your own point.. Prepare "Tell me about yourself" well and guide your interview by focusing on your strongest point, you may face more questions on that point.. refer to 64 HR questions book
Round: Stress Interview
Tips: If they are giving you stress, that means they like you.. Relax!! Do not get nervous, thats what they want to check.. Think for the solution to the problem normally, you know you can crack it (Stress interview may be a part of HR, technical, case or any other interview.. you may have to make it out yourself)
Skill Tips: ""
Skills: Puzzles, Speaking skills, Aptitude, guesstimates, Case solving, presentation skills
College Name: IIT Bombay
Business Analyst Interview Questions & Answers
Ola Cabs
Vishnuvardhan Reddy Kotte
posted on 21 Feb 2015
Interview Questionnaire
3 Questions
- Q1. Give some quantifiable factors you can use to rate( for comapny's purpose) among a repository of cab drivers we have?
- Ans.
Quantifiable factors to rate cab drivers for company's purpose
Customer ratings and feedback
Number of completed trips
Average trip duration
Percentage of on-time pickups
Accident and traffic violation history
Vehicle cleanliness and maintenance
Driver punctuality and professionalism
- Q2. If you are on the selection committee of BCCI what would be your criterion for choosing between Yuvraj Singh and Stuart Binny for the World Cup squad?
- Ans.
The criterion for choosing between Yuvraj Singh and Stuart Binny for the World Cup squad would be based on their recent performance, fitness, and team balance.
Evaluate recent performance of both players
Assess fitness levels of both players
Consider team balance and required skill sets
Analyze pitch and weather conditions of the tournament
Take into account the opposition teams and their strengths and weaknesses
- Q3. Some questions on programming (Pseudo Codes )
Interview Preparation Tips
Experience: There were questions on general aptitude like work and time, probability, and some questions were on data interpretation, coding and decoding, etc., most of the questions were very simple...but I felt the data interpretation questions to be a bit tricky (completely my opinion though).. ON THE BASIS OF THIS TEST THEY SHORTLISTED ROUGHLY 15 OUT OF 150 (again a rough figure)
Tips: Manage your time wisely...start with the type of questions you feel comfortable...try to attempt all the questions....improve your speed while practicing.
Duration: 45min minutes
Total Questions: 45
Round: Test
Experience: We were given 3 questions to solve in 30 min duration.Later we were told to walk them through our solution . Two of them were on probability(one random variables and the other on basic probability) and one was on estimating the area of an irregular figure , given some tools.
Tips: Get all the doubts regarding the questions clarified .As you have to explain your solution, it would be helpful if you could pen down all the steps clearly ( as it shows them that your thought process is an organised one). Use pictorial representation if needed. When they propose some other method be open to it and be open to any method they propose and be clear with the method you adopted. Even if you didn't arrive at the final answer, try to communicate your idea on solving the problem( most of the times they will listen to what you say).
Duration: 30min minutes
Total Questions: 3
Round: Other Interview
Experience: They were basically looking for quantifiable factors...so think of some quantifiable factors like the number of Times they are available to you in a day and the number of service providers they engage with. etc.,
For the second question again use quantifiable factors which make sense.
Tips: They patiently listened to what I said . So, be calm and don't be in a haste.
Skill Tips: Be a bit quick while solving the Aptitude questions....Know about the company before you go in for the interview process....No need of any prior knowledge in R language ...They just tested my Willingness to learn new things.
Skills: Aptitude Skills, Communication Skills, Structured thought process, Out of the box thinking, Basic programming skills ( very basic)
College Name: IIT KANPUR
Interview Questionnaire
3 Questions
- Q1. Some question on KMP
- Q2. Simulation Question
- Q3. Topological Sort Question
Interview Preparation Tips
Experience: Simple
Tips: Online Coding Questions
Duration: 60 minutes
Round: Technical Interview
Experience: Moderately difficult
Tips: Thorough understanding of all the algorithms is required.
Round: Technical Interview
Experience: Easy
Tips: Need to start a question afresh without attacking it the way you have solved questions in the past
Round: Technical Interview
Experience: Easy/moderately difficult
Tips: The idea was not that easy to click.
Skills: Coding
College Name: IIT BOMBAY
Motivation: Facebook has revolutionised social networking.
I applied via Campus Placement and was interviewed in Dec 2016. There were 4 interview rounds.
Interview Questionnaire
4 Questions
- Q1. Given a 2d matrix with some D doors and W walls, we need fill distance matrix with minimum distance to the nearest door
- Ans.
Given a 2D matrix with doors and walls, fill distance matrix with minimum distance to the nearest door.
Iterate through the matrix and find the doors
Use Breadth-First Search (BFS) to calculate the minimum distance from each cell to the nearest door
Update the distance matrix with the minimum distances
- Q2. Given a read-only array we want to find kth smallest element in unordered array with O(1) space
- Ans.
Find kth smallest element in unordered array with O(1) space
Use the QuickSelect algorithm to partition the array and find the kth smallest element
Choose a pivot element and partition the array into two subarrays
Recursively partition the subarray that contains the kth smallest element
Repeat until the pivot element is the kth smallest element
Time complexity: O(n) average case, O(n^2) worst case
- Q3. Design question
- Q4. Find friends of friend who already are not friends with you
- Ans.
To find friends of friends who are not already friends with you, we can first find your friends and then their friends excluding yourself and your friends.
Get your list of friends
For each friend, get their list of friends
Exclude yourself and your friends from the final list of friends of friends
Interview Preparation Tips
Experience: It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
Tips: Just walk the interviewer through the solution you're proposing.
Round: Other Interview
Experience: He started with a design question with how to stream an image such that all clients see the same image at the same time. You need to take care of delays, network problems. He kept on adding new elements like compression, streaming, utc time related issues, client rendering delays and so on.
Round: Other Interview
Experience: This was bar-raiser round.
Skills: Design, Algorithms And Data Structures, Graph Theory
College Name: IIT Madras
Skills evaluated in this interview
I appeared for an interview before Apr 2021.
(2 Questions)
Round duration - 60 minutes
Round difficulty - Medium
It started with an informal talk after he gave his introduction. We talked about the cyclone that was going to be there and what I did in my internship and my previous projects. Then we moved to questions. After solving both questions he asked if I had questions.
- Q1.
Kth Largest Element Problem Statement
Given an array of distinct positive integers and a number 'K', your task is to find the K'th largest element in the array.
Example:
Input:
Array: [2,1,5,6,3,8], K ... - Ans.
Find the Kth largest element in an array of distinct positive integers.
Sort the array in non-increasing order
Return the Kth element from the sorted array
Handle multiple test cases
- Q2.
Orange Rotting Problem Statement
Consider a grid containing oranges. Each cell in this grid can hold one of three integer values:
- Value 0: Represents an empty cell.
- Value 1: Represents a fresh orang...
- Ans.
The task is to determine the minimum time required for all fresh oranges to become rotten in a grid.
Create a queue to store the rotten oranges and their time of rotting.
Iterate through the grid to find the initial rotten oranges and add them to the queue.
Perform BFS by popping each rotten orange from the queue, rot adjacent fresh oranges, and add them to the queue with updated time.
Continue until the queue is empty, ke...
Round duration - 45 minutes
Round difficulty - Easy
This was a design round.
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Microsoft Corporation
Anonymous
posted on 20 Jan 2015
Interview Questionnaire
4 Questions
- Q1. Given a compact data structure to store strings sequentially, one byte stores length l of the string, next l bytes contain the string characters. Write a code to insert the given string at the ith place, m...
- Ans.
The code inserts a given string at the specified position in a compact data structure that stores strings sequentially.
To insert the string at the ith place, we need to shift all the strings after the ith position by the length of the new string.
We can use a loop to iterate through the data structure and find the ith position.
After finding the ith position, we can calculate the new length of the data structure and allo...
- Q2. How will you construct parse tree for ((a+b)*c)/d? what all data structures can you use?
- Ans.
Constructing parse tree for ((a+b)*c)/d using data structures.
Use stack data structure to keep track of operators and operands.
Start with the innermost parentheses and work outwards.
Create a node for each operator and operand and link them together.
The root node will be the final result of the expression.
Example: ((a+b)*c)/d can be represented as / -> * -> + -> a, b, c, d.
- Q3. Given a function f that returns true or false based on whether the input string satisfies some hidden criterion C, write a function that verifies that all sub strings satisfy C
- Q4. You hand over 'n' identical linked lists to n salespersons. After the day's work, these salesperson return the lists. Merge these lists such that all insertions, deletions, updates are taken care of, so th...
- Ans.
Merge 'n' identical linked lists from 'n' salespersons to handle insertions, deletions, and updates.
Iterate through each linked list and merge them into a single linked list
Handle insertions, deletions, and updates by traversing the merged list and making necessary changes
Repeat the process for the next day by resetting the merged list
Interview Preparation Tips
Experience: It was an online test. The company who hosted the test messed up with the interface, and a lot of people had trouble with a coding question that could not be solved because of the faulty interface. There was no retest.
The shortlisting was done after studying compile attempts, time devoted to various sections and other performance measures.
Round: Technical Interview
Experience: Told about myself, my interests, my internship projects and my work so far.
A few coding questions were asked too.
In the end, they asked if i have any questions.
Tips: Interviewers are friendly. Be calm, give your best.
General Tips: Start preparing early.
Develop priorities both sector wise and company wise.
Take sufficient water and food with you. Interviews can start at 4 am on the first day!
Have enough copies of resume and transcripts with you.
If you have been shortlisted for many companies, it is preferable to have a portfolio manager who manages your phone during the day and enables you to focus on the interviews.
College Name: IIT KANPUR
Skills evaluated in this interview
Software Developer Interview Questions & Answers
Microsoft Corporation
Anonymous
posted on 23 Mar 2015
Interview Preparation Tips
Skill Tips: geeksforgeeks is the most valuable site. The questions are generally taken from there. Careercup.com has the most common questions asked by Microsoft. Try to even brush up on OS concepts. Some interviewers ask that too. Practice all questions on linked list. This is generally the first interview question.
College Name: NIT SURATHKAL
WhatsApp Interview FAQs
Recently Viewed
INTERVIEWS
Farfetch
No Interviews
INTERVIEWS
inDriver
No Interviews
COMPANY BENEFITS
Hic Abf Special Foods
No Benefits
INTERVIEWS
ErgoMed
No Interviews
SALARIES
Hic Abf Special Foods
No Salaries
INTERVIEWS
Naspers
No Interviews
PHOTOS
Times Business Solutions
No Photos
JOBS
Times Business Solutions
No Jobs
INTERVIEWS
Hopin
No Interviews
REVIEWS
Hic Abf Special Foods
No Reviews
Tell us how to improve this page.
Interview Questions for Popular Designations
Interview Questions from Similar Companies
Amazon
Microsoft Corporation
- Home >
- Interviews >
- WhatsApp Interview Questions
