Urban Company Software Developer Interview Questions, Process, and Tips

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...read more
Add your answer
Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Add your answer

Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...read more
Add your answer

Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Add your answer

Q1. Stock buy and sell with at most 2 transaction
Ans. 
Implement a solution to find the maximum profit from buying and selling stocks with at most 2 transactions.
• Use dynamic programming to keep track of maximum profit at each day with 0, 1, or 2 transactions.

• Consider the possibility of splitting the transactions into two separate parts.

• Calculate the maximum profit by iterating through the prices array and updating the maximum profit accordingly.
Answered by AI
Add your answer
Q2. Binary search to find target
Ans. 
Binary search is a divide and conquer algorithm that efficiently finds a target value in a sorted array.
• Divide the array in half and compare the target value with the middle element

• If the target is less than the middle element, search the left half. If greater, search the right half

• Repeat the process until the target is found or the subarray is empty
Answered by AI
Add your answer

Q1. General about project
Add your answer
Q2. Design paytm wallet
Ans. 
Design a digital wallet system similar to Paytm.
• Allow users to add money to their wallet using various payment methods like credit/debit cards, net banking, UPI, etc.

• Enable users to make payments for various services like mobile recharge, bill payments, online shopping, etc.

• Implement security measures like two-factor authentication, encryption of sensitive data, and regular security audits.

• Provide features like transac...read more
Answered by AI
Add your answer

Q1. What is thread ?
Ans. 
A thread is a lightweight process that can run concurrently with other threads within the same process.
• Threads allow for parallel execution of tasks within a single process.

• Threads share the same memory space and resources of the process they belong to.

• Threads can communicate with each other through shared memory or message passing.

• Examples: Java threads, POSIX threads (pthreads) in C/C++.
Answered by AI
Add your answer
Q2. Inter process communication and project?
Add your answer

In test I had to solve 3 dsa questions in 1 hour

Q1. I have asked 2 DSA questions in my interview
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of 2 coding Problems and it lasted for 60 minutes from 12:00 PM to 1:00 PM on Hackerearth.
Use of other IDEs was prohibited and video was on.

Q1. 
Implement indexOf Function
You are provided with two strings A and B. Your task is to find the index of the first occurrence of A within B. If A is not found in B, return -1.
Example:
Input:
A = "bc", ...read more
Ans. Brute-force
• If the length of B is less than the length of A, then we simply return -1.
• Now let’s denote the length of A as M and the length of B as N.
• Now, we run a loop from 0 to N - M and for each index i in the range of 0 to N - M, we run another loop from 0 to M. Let’s denote this inner loop counter as j.
• Then match the characters at (i + j)th index of B with (j)th index of A. If at any point characters mismatch, then ...read more
Answered Anonymously
Add your answer
Q2. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. Brute Force Approach
The idea here is to do a linear approach which apparently is a brute force way to do this.
• Visit every element one by one.
• Check if the current element that you are looking at is the key value that needs to be searched. If the element is found, return the index at which you find it.
• Once all the elements are visited and you don't find the key-value, return -1.
Space Complexity: O(1)Explanation:
O(1)
&nbs...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The round was conducted on Google Meet with 2 interviewers . They were friendly and helpful.
The timing was 12:00 to 1:00 PM.
Our Video was on .

Q1. 
Distinct Subsequences Problem Statement
You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.
Exampl...read more
Ans. Brute force
• The IDea is to call a helper function so as to create all possible subsequences of the string which will contain:
  • String CUR = the possible subsequence of the string.
  • Int ID = the index of character which will either be included or excluded.
• We maintain a set to count the distinct subsequences, each time a new subsequence is created, we add it into the set. Remember, the set does not contain duplicate elements.
• ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a Behavioral Round. It lasted for 45-50 minutes. It consisted of a discussion on my projects. The interviewer was very impressed by the way I explained my projects. She even appreciated me for that. This was followed by normal HR questions .Timing of This round was 4:00 PM to 5:00 PM

Round duration - 75 minutes
Round difficulty - Medium

The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.

Q1. 
Meeting Rooms Allocation Problem Statement
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...read more
Ans. 
Step 1 : Created 2 arrays for start time and end time and sorted them.
Step 2 : Applied merge 2 sorted arrays to get a sorted array technique to find the minimum rooms required.
https://www.geeksforgeeks.org/merge-two-sorted-arrays/
Step 3 : If the start time is less than the end time, I incremented the number of rooms required else I decremented the
number of rooms required.I also kept track of maximum rooms required at a
Answered Anonymously
Add your answer
Q2. 
Maximize XOR Value
You are provided with an integer X and are tasked with identifying an integer Y such that the bitwise XOR operation between X and Y yields the maximum possible value. The condition is t...read more
Ans. 
Step 1 : Sort the array.
Step 2 : Xor all elements of the array.
Step 3 : Remove maximum element from xor by doing xor_array ^= current_max_element.
Step 4 : return the resultant array.
Answered Anonymously
Add your answer
Q3. 
Minimize Maximum Difference Between Adjacent Elements
You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...read more
Ans. 
The first observation I had was what would I do if the first and last elements were not fixed. I was not able to solve this question completely, hence I used brute force approach(provided in above link) to pass some of the test cases.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.

Q1. 
Frequency in a Sorted Array Problem Statement
Given a sorted array ARR and a number X, your task is to determine the count of occurrences of X within ARR.
Note:
• If X is not found in the array, return...read more
Ans. 
Step 1 : Provided the linear search solution then I was asked what if the array is sorted?
Step 2 : Since the array is sorted used lower bound and upper bound to find the frequency of the given element
Answered Anonymously
Add your answer
Q2. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
I told the interviewer I had already seen this question. Hence I quickly informed here about the concept of multi-source BFS to find the minimum time such that all oranges become rotten.
Answered Anonymously
Add your answer
Q3. 
Clone Linked List with Random Pointer Problem Statement
Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...read more
Ans. 
Step 1 : Assumed that there is no random pointer present, hence I was able to easily come with the solution to clone a normal linked list.
Step 2 : I was then asked can I do it in constant space, I was able to come up with the logic but wasn't able to code it.
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.

Round duration - 60 minutes
Round difficulty - Easy

It was the culture fit round taken by the Director of Engineering.

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.

Q1. 
Amazing Strings Problem Statement
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".
Input:
Line ...read more
Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer
Q2. 
Shortest Path Visiting All Nodes
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...read more
Ans. Depth-First Search
The idea here is to do a depth-first search from all ‘N’ nodes and try all possible paths that visit all the nodes in the given graph. Out of all possible paths that start from any node ‘i’ and end at any node ‘j’, where ‘i’ and ‘j’ are from 0 to ‘N’ - 1 inclusive, we will take the path that has the shortest length, i.e., the path with the minimum number of edges and visits all the ‘N’ nodes in the gi...read more
Answered Anonymously
Add your answer
Q3. 
Meeting Rooms Allocation Problem Statement
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...read more
Ans. Brute Force
Create ARRIVAL and DEPARTURE arrays from given array INTERVALS.
1. Sort ARRIVAL and DEPARTURE arrays.
2. Traverse ARRIVAL[i] and DEPARTURE[j] for each 0<= i,j <N and check
   1. If ARRIVAL[i] <= DEPARTURE[j] a room is needed for meeting so we
      1. Increment ROOMREQUIRED by 1 and i by 1.
      2. Check if ROOMREQUIRED is more than RESULT. If yes, update RESULT to ROOMREQUIRED
   2. Else decrement the count of ROOMREQUIRED by 1 and increm...read more
Answered Anonymously
Add your answer

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.

Q1. 
Print All Subsets Challenge
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 ...read more
Ans. Power Set Using Bit-Masking
 
One of the standard and useful method of finding the power set is through bit-masking.
Consider a number with N-bits in its binary representation, if we consider that the state of i^th bit depicts whether the i^th array element is included in the current subset or not, then we can uniquely identify one of the subsets (as each number has a different binary representation).
Now we can simply ...read more
Answered Anonymously
Add your answer

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.

Q1. 
Find Row With Maximum 1's in a Sorted 2D Matrix
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...read more
Ans. Brute Force
Our intuition is to traverse the given matrix row by row, and keep on counting the number of ‘1’s in each row and compare the count with max. And finally, return the index of the row with the maximum ‘1’s. This is a brute force kind of approach.
 
Just remember one thing while considering two rows have the same number of 1’s then we need to return the row with a lower index.
Space Complexity: O(1)Explanati...read more
Answered Anonymously
Add your answer