i
Impact Guru
Filter interviews by
I applied via Company Website and was interviewed in Jan 2024. There was 1 interview round.
Given two soted arrays merge them from a single sorted array with all items in non-decreassing order
I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.
3 Leetcode style questions , 2 medium , 1 hard .
A cab booking system designed using OOP principles
Create classes for Cab, Customer, Driver, and Booking
Use inheritance and polymorphism to handle different types of cabs and bookings
Implement methods for booking a cab, assigning a driver, and calculating fare
Use encapsulation to protect data and ensure data integrity
I applied via Campus Placement and was interviewed before Apr 2023. There was 1 interview round.
It was on-campus placement interview.
Two rounds of interview were there and both were of DSA (DP and sorting algo).
I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.
I applied via Walk-in and was interviewed before Feb 2021. There were 3 interview rounds.
I applied via Job Portal
SQL and Python data analysis questions
Matching data in different columns involves comparing the values in the columns and identifying similarities or patterns.
Use string matching techniques like exact match, partial match, or fuzzy matching.
Apply data cleaning and preprocessing techniques to standardize the data before matching.
Utilize advanced algorithms like Levenshtein distance or Jaccard similarity for more complex matching.
Consider using database join...
I appeared for an interview in Oct 2020.
Round duration - 90 minutes
Round difficulty - Medium
The test was conducted in the evening from 5:00 pm to 6:30 pm. Because of the covid situation, all the students attempted the test from their homes. But it was a webcam-based test to avoid any kind of cheating.
There were 3 coding problems to be done in 90 minutes.
After resume based shortlisting, 70 candidates were selected to appear for the test out of which 30 were shortlisted for interviews.
Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".
Line ...
Check if the third string contains all characters from the first and second strings in any order.
Create a frequency map for characters in the first and second strings.
Check if all characters in the third string are present in the frequency map.
Ensure the count of characters in the third string matches the count in the frequency map.
Return 'YES' if all conditions are met, otherwise return 'NO'.
You are given a connected undirected unweighted graph comprising 'N' nodes and 'M' edges. In this graph, each pair of connected nodes is linked by exactly one undirected e...
Find the length of the shortest path visiting all nodes in a connected undirected unweighted graph.
Use Breadth First Search (BFS) to find the shortest path that visits all nodes at least once.
Maintain a bitmask to keep track of visited nodes and their states.
Consider all possible permutations of nodes to find the shortest path length.
Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...
Determine the minimum number of conference rooms required for scheduling meetings.
Sort the meetings by start time.
Iterate through the meetings and keep track of rooms needed based on overlapping times.
Use a priority queue to efficiently allocate rooms.
Example: For meetings (1pm-4pm), (3pm-5pm), (4pm-6pm), 2 rooms are required.
Ensure linear time complexity by optimizing the room allocation process.
Round duration - 50 minutes
Round difficulty - Medium
This round started at 9 am and went till 4 pm.
Out of 70 students that appeared in online coding test, 30 were shortlisted for the first round (this round) of interviews.
In this round, everyone was asked one moderate level coding question. The interviewer provided the link to an IDE, where I wrote my code.
The interview started with the introduction being followed by 1 coding problem. In the end, the interviewer asked me if I wanted to ask any questions. To which I asked him my feedback so that I can improve my wear areas.
Of the 30 candidates, 17 were selected for the final interview round.
Given an array arr
containing 'N' distinct integers, your task is to generate all possible non-empty subsets of this array.
Note: While the elements within each subset should ...
Generate all possible non-empty subsets of an array of distinct integers.
Use recursion to generate all subsets by including or excluding each element in the array.
Maintain a current subset and add it to the result when reaching the end of the array.
Ensure elements within each subset are in increasing order.
Handle the input and output format as specified in the question.
Round duration - 50 minutes
Round difficulty - Easy
This was a technical + HR round. Started in the evening at 4:30 pm, this round went till 9:30 pm.
17 students were shortlisted for this final round of interview.
This interview was also virtual and involved both technical and HR-related questions. The interview started with an introduction and then questions based on my resume were asked.
Out of 17 candidates, 8 candidates got a full-time offer from Urban Company.
You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...
Find the row with the maximum number of 1's in a sorted 2D matrix.
Iterate through each row of the matrix and count the number of 1's in each row.
Keep track of the row index with the maximum number of 1's seen so far.
Return the index of the row with the maximum number of 1's.
If multiple rows have the same number of 1's, return the row with the smallest index.
Tip 1 : Coding Problems are asked from DSA, so a good practice of standard problems is a must. Revisit these problems before the interview to ace and crack the interview.
Tip 2 : To tackle the conceptual questions, you need to have thorough knowledge about the concepts, so to prepare for OS and DBMS, read one standard book.
Tip 3 : Have proper and clear knowledge about your project. Basic but tricky questions are asked based on the internship experience and the projects you have done.
Tip 1 : The best way to ace an interview is to take command of your interview in your hands. And this is done by having a balanced resume. Projects give direction to the interview and increase the probability of selection. So add at least 2 projects.
Tip 2 : Urban Company seeks team players and not just good coders. So add your achievements outside the academics to get shortlisted.
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Business Development Associate
56
salaries
| ₹2.6 L/yr - ₹7.2 L/yr |
Assistant Manager
54
salaries
| ₹3.4 L/yr - ₹10 L/yr |
Senior Business Development Associate
54
salaries
| ₹4 L/yr - ₹8 L/yr |
Senior Associate
31
salaries
| ₹2.5 L/yr - ₹6.5 L/yr |
Operations Associate
28
salaries
| ₹1.5 L/yr - ₹4.2 L/yr |
Milaap
Udaan
Swiggy
BlackBuck