Filter interviews by
I applied via Job Portal and was interviewed in Nov 2021. There was 1 interview round.
Top trending discussions
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...
I applied via Walk-in and was interviewed in Sep 2023. There were 3 interview rounds.
Arithmetic and reasoning
Python is a high-level programming language known for its simplicity and readability.
Python is interpreted, not compiled
It supports multiple programming paradigms like procedural, object-oriented, and functional programming
Python has a large standard library and a thriving community for support and resources
Python has a bright future due to its simplicity, versatility, and strong community support.
Python is widely used in web development, data science, artificial intelligence, and automation.
Its simple syntax and readability make it a popular choice for beginners and experienced developers alike.
The large community of Python developers ensures continuous improvement and support for the language.
Python's extensive standard...
MySQL is a popular open-source relational database management system with a strong community and continuous development.
MySQL continues to evolve with new features and improvements in each release.
It supports various storage engines, including InnoDB, MyISAM, and NDB Cluster.
MySQL 8.0 introduced many enhancements like window functions, common table expressions, and improved JSON support.
It is widely used in web develop...
posted on 28 May 2022
I was interviewed in Jun 2022.
Round duration - 70 Minutes
Round difficulty - Hard
The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.
You are tasked with finding the shortest path between two houses in the city of Ninjaland, represented as an unweighted graph. The city has N
houses numbered from 1 ...
This is a straight forward application of Floyd Warshal algorithm
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a
and b
. Your task is to determine if ...
This was a modified version of DFS on tree and storing the results in a dp to avoid recalculation.
Round duration - 60 Minutes
Round difficulty - Medium
It contained two programming questions.
Given the root of a complete binary tree, calculate the total number of nodes in this tree.
A complete binary tree is defined as a binary tree...
The basic solution of this problem is easy. You just need to do a level order traversal of the tree and wherever you find the first vacant spot, you can enter the node there.
The trick was to find the optimal solution. You need to use the property of almost full binary tree. Knowing the value of the node to enter, you can directly eliminate one side of the tree and just traverse the other side of the tree.
Given an array ARR
consisting of non-negative integers, rearrange the numbers to form the largest possible numerical value. You are not permitted to alt...
This was a standard array manipulation problem. You just need to find the cases that should be satisfied by the second largest number.
Round duration - 60 Minutes
Round difficulty - Medium
This was more of a interaction round with some technical skills.
Tip 1 : Focus on the basics of DBMS
Tip 2 : Try applying the DBMS concepts on the problems at hand.
Tip 1 : Focus on different varieties of problems, quality of problems matter greater than the quantity.
Tip 2 : Focus on design thinking, that will help in rounds other than problem solving.
Tip 1 : Focus on demonstrating your academic excellence and course projects
Tip 2 : Mention internship details with clarity
posted on 28 May 2022
I was interviewed in Feb 2022.
Round duration - 90 minutes
Round difficulty - Easy
Consisted of 3 DSA questions and MCQ on python proficiency
Given a string S
, your task is to return all distinct palindromic substrings of the given string in alphabetical order.
A string is considered a pal...
Round duration - 60 minutes
Round difficulty - Medium
It was a pure DSA round and interviewer was very helpful with providing significant hints to solve the given problems
Given a binary grid representation of a map of an island, calculate the perimeter of the island. The grid uses '0' for water and '1' for land.
The grid has only one i...
Round duration - 60 minutes
Round difficulty - Hard
DSA+OS
Ninja lives in a city called Byteland where a festive event is being organized. To make space for this event, Ninja is tasked with clearing a nearby forest. The fores...
Tip 1 : Practice at least 250 questions
Tip 2 : Do at least two projects
Tip 1 : Should be covered in One page
Tip 2 : Project description should be professional
Logical, Expertise, Relevant and Communication
posted on 14 Sep 2021
I was interviewed in Dec 2020.
Round duration - 60 minutes
Round difficulty - Easy
This was the qualification round which comprised of several MCQs and 3 coding questions.
It was held on Hackerearth from 3:00 PM to 4:00 PM.
Use of any other IDE was prohibited.
Given an arbitrary binary tree, a node of the tree, and an integer 'K', find all nodes that are at a distance K from the specified node, and return a list of th...
Round duration - 90 minutes
Round difficulty - Medium
I was shared a link of Google Meet and the Google Docs was shared where there was 1 coding problem to be coded there and then the code was run on an IDE to check the sample tests.
Then the interview was followed by a lot of Operating System and Computer System Architecture Questions.
There were 2 Interviewers and both were helpful.
The timing was from 2:30 PM to 4:00 PM
Determine the length of the largest subarray within a given array of 0s and 1s, such that the subarray contains an equal number of 0s and 1s.
Input beg...
Round duration - 45 minutes
Round difficulty - Easy
The round was held on Google Meet with HR from 2:30 PM to 3:15 PM.
The HR was friendly and asked the basic questions.
Tip 1 : Practice daily 4-5 medium level problems on sites like Leetcode, CodeZen, Hackerearth
Tip 2 : Even though Data Structures and Algorithms is the base but study Course Subjects like DBMS,OS,OOPS too.
Tip 3 : Try to Participate in Contests on LeetCode,Codeforces.
Tip 1 : Mention the projects you worked on in your past work experience and how it helped your company.
Tip 2 : Keep your resume up to date in accordance with the role you are applying for
Tip 3 : Don't put false things on your resume.
based on 2 reviews
Rating in categories
Team Lead
29
salaries
| ₹7.5 L/yr - ₹15 L/yr |
Assistant Manager
25
salaries
| ₹9.3 L/yr - ₹17.5 L/yr |
Team Developer
18
salaries
| ₹5.5 L/yr - ₹9.7 L/yr |
Manager
10
salaries
| ₹14.1 L/yr - ₹25 L/yr |
Senior Manager
9
salaries
| ₹20 L/yr - ₹30 L/yr |
Goldman Sachs
Morgan Stanley
Joannou & Paraskevaides
Citi Group Global Markets