Filter interviews by
I applied via Campus Placement and was interviewed in Nov 2020. There were 4 interview rounds.
Top trending discussions
posted on 26 Jun 2017
I appeared for an interview before Jun 2016.
The question asks to construct a k-ary tree using the given k and DFS traversal string.
Iterate through the DFS traversal string
If the current character is 'P', create a parent node
If the current character is 'L', create a leaf node
Link the nodes according to the DFS traversal order
To determine if a graph has a node with n degree, iterate through all nodes and count their edges.
Iterate through each node in the graph
Count the number of edges connected to each node
If any node has n edges, then the graph has a node with n degree
posted on 13 Feb 2025
I appeared for an interview before Feb 2024.
I prefer a mix of both working from the office and working from home.
I believe in the benefits of face-to-face collaboration and communication that come with working from the office.
At the same time, I appreciate the flexibility and productivity that working from home offers.
I think a hybrid approach, where employees have the option to choose between WFO and WFH based on their tasks and preferences, is ideal.
I have exp...
posted on 13 Feb 2025
I appeared for an interview before Feb 2024.
First round was a coding test which has 2 problem solving questions and 3 subjective questions based on C++
More of a subjective round, highly focused on OS, networking and computer architecture.
posted on 7 Nov 2024
2 coding questions based on DSA.
posted on 28 May 2022
I appeared for an interview in May 2022.
Round duration - 45 Minutes
Round difficulty - Easy
The interviewer was friendly. Explained the question well. Allowed to use any preferred platform to write code.
Given an array prices
representing the prices of a stock where each element indicates the price at a given minute, determine the maximum profit you can ac...
Find the maximum profit by buying and selling a stock once based on given prices.
Iterate through the prices array and keep track of the minimum price seen so far and the maximum profit achievable.
Calculate the profit by subtracting the current price from the minimum price and update the maximum profit if needed.
Return the maximum profit, ensuring it is not negative.
Example: prices = [2, 100, 150, 120], Buy at 2, sell a
Round duration - 60 Minutes
Round difficulty - Medium
Imagine you are helping Ninja, a dance coach, who needs to form dance pairs from the available boys and girls in a studio. Given the number of boys N
, the number of girls M
, a...
The challenge involves forming dance pairs from available boys and girls based on potential pairings to maximize the number of pairs.
Parse the input to get the number of test cases, boys, girls, and potential pairings.
Iterate through the potential pairings and form pairs based on the given indexes.
Output '1' if a set of maximum possible pairs is returned, else output '0'.
There can be multiple valid configurations of pa...
Multiprocessing involves multiple processes running concurrently, while multithreading involves multiple threads within a single process.
Multiprocessing utilizes multiple processes to execute tasks simultaneously.
Multithreading involves multiple threads within a single process sharing the same memory space.
Multiprocessing is typically used for CPU-bound tasks, while multithreading is more suitable for I/O-bound tasks.
E...
Round duration - 60 Minutes
Round difficulty - Hard
Splitwise is a system for managing shared expenses among groups of people.
Classes: User, Expense, Group
Functions: addExpense(), settleUp(), calculateBalance()
Round duration - 60 Minutes
Round difficulty - Hard
Tip 1 : Practice at least 5 questions of each topic of various difficulty levels
Tip 2 : Read out theory articles about your preferred language showing your proficiency in the same.
Tip 3 : Hard work is overrated, consistency is the key.
Tip 1 : Own everything you have there, do not add random skills that you are not proficient in.
Tip 2 : Keep it clean and try to give out minimal but most of the relevant information for the role.
posted on 16 Sep 2024
I applied via Recruitment Consulltant and was interviewed in Mar 2024. There were 2 interview rounds.
DSA medium level questions were asked.
MakeMyTrip is a travel booking application that allows users to book flights, hotels, and holiday packages.
Include features like flight/hotel search, booking, payment gateway integration, and user profiles.
Implement filters for search results, reviews/ratings for hotels, and notifications for booking updates.
Integrate maps for location tracking, weather forecasts, and customer support chatbot.
Offer discounts, loyalty p...
posted on 10 May 2021
I applied via Naukri.com and was interviewed before May 2020. There was 1 interview round.
posted on 21 Jun 2022
3 coding questions
A time series database stores data points with timestamps for efficient retrieval and analysis.
Choose a suitable data model for the database
Use a time-based partitioning scheme for efficient data retrieval
Implement compression techniques to reduce storage requirements
Support for querying and analyzing time-based data
Ensure data consistency and durability
Consider scalability and high availability
Examples: InfluxDB, Time
posted on 29 Jan 2024
I applied via Campus Placement and was interviewed in Dec 2023. There were 4 interview rounds.
There was basic GD topic
Count the number of words and their frequency
Split the given text into words using whitespace as delimiter
Create a dictionary to store the word frequency
Iterate through each word and update the frequency in the dictionary
Return the dictionary with word frequency
Count the frequency of characters in a given string.
Iterate through the string and use a hash map to store the count of each character.
Initialize the count of each character to 0 and increment it as you encounter the character.
Finally, iterate through the hash map to get the frequency of each character.
Reverses an array of strings
Use a loop to iterate through half of the array
Swap the elements at the current index with the corresponding element from the end of the array
Implementing the comparator function for sorting an array of strings.
Use the built-in sort() function in most programming languages.
Define a custom comparator function that compares two strings.
Return a negative value if the first string should come before the second, a positive value if it should come after, and 0 if they are equal.
Example: ['apple', 'banana', 'cherry'] can be sorted in alphabetical order using the co
based on 3 reviews
Rating in categories
Software Engineer
19
salaries
| ₹5.9 L/yr - ₹18 L/yr |
Business Analyst
11
salaries
| ₹11 L/yr - ₹16 L/yr |
Senior Software Engineer
8
salaries
| ₹9 L/yr - ₹25.6 L/yr |
Devops Engineer
5
salaries
| ₹10 L/yr - ₹28 L/yr |
UI/UX Designer
4
salaries
| ₹2.2 L/yr - ₹10.4 L/yr |
Belstar Investment and Finance
Cholamandalam Securities
Link Intime
MENSA