Upload Button Icon Add office photos

Filter interviews by

Urban Company Software Developer Interview Questions, Process, and Tips

Updated 24 Sep 2024

Top Urban Company Software Developer Interview Questions and Answers

  • Q1. 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 ...read more
  • Q2. 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 ...read more
  • Q3. 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 ...read more
View all 17 questions

Urban Company Software Developer Interview Experiences

8 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Netaji Subhas Institute of Technology (NSIT) and was interviewed in Jul 2024. There were 4 interview rounds.

Round 1 - Coding Test 

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

Round 2 - Technical 

(2 Questions)

  • 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...
  • Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Round 3 - One-on-one 

(1 Question)

  • 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 ...
Round 4 - HR 

(1 Question)

  • Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • 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
  • 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
Round 2 - System Design 

(2 Questions)

  • Q1. General about project
  • 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...

  • Answered by AI

Skills evaluated in this interview

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Nagarro
Q4. Crazy Numbers Pattern Challenge Ninja enjoys arranging numbers in ... read more
asked in PhonePe
Q5. Form a Triangle Problem Statement You are given an array of integ ... read more
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • 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
  • Q2. Inter process communication and project?

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

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

Round 2 - Technical 

(1 Question)

  • Q1. I have asked 2 DSA questions in my interview

Urban Company interview questions for designations

 Software Engineer

 (1)

 IOS Developer

 (1)

 Senior Software Engineer

 (1)

 Software Development Engineer II

 (2)

 Software Development Engineer 1

 (1)

 Business Developer

 (1)

 Lead Consultant

 (1)

 IT Infrastructure Analyst

 (1)

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Indira Gandhi Delhi Technical University for Women, Delhi and was interviewed in Sep 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Seat reservation system
bit manipulation
binary tree related

Round 3 - Technical 

(1 Question)

  • Q1. Bfs / dfs traversal question

Get interview-ready with Top Urban Company Interview Questions

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

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", ...
  • 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 ...
  • Answered Anonymously
  • 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 ...

  • 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...

  • Answered Anonymously
Round 2 - Face to Face 

(1 Question)

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...

  • 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.
    • ...
  • Answered Anonymously
Round 3 - HR 

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

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Guru Gobind Singh Indraprastha University. I applied for the job as SDE - 1 in HyderabadEligibility criteriaAbove 8 CGPAUrban Clap interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPS, Operating System, DBMS, Greedy Algorithms, Computer NetworksTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : I prepared all topics from my Coding Ninjas Course - Competitive Programming
Tip 2 : I practiced 300+ questions on CodeZen ( Coding Ninjas Platform), LeetCode, InterviewBit
Tip 3 : I took part in contests on CodeForces.
Tip 4 : Apart from Data Structures and Algorithms , I also studied DBMS, OOPs and other course subjects

Application resume tips for other job seekers

Tip 1 : Keep Resume up to date for the role you are applying.
Tip 2 : Mention atleast 1 project or past work experience.
Tip 3 : Try to keep a 1 pager resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

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...

  • 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
  • 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...

  • 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
  • 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...

  • 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
Round 2 - Video Call 

(3 Questions)

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...
  • 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
  • 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...
  • 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
  • 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 ...

  • 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
Round 3 - Video Call 

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 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

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

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in GurgaonEligibility criteriaNoneUrban Clap interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic programming, Algorithms, DBMS, OSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.

Application resume tips for other job seekers

Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

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 ...
  • Ans. Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
  • Answered Anonymously
  • 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...

  • 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...

  • Answered Anonymously
  • 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...

  • 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...
  • Answered Anonymously
Round 2 - Video Call 

(1 Question)

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 ...

  • 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 ith bit depicts whether the ith 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 ...

  • Answered Anonymously
Round 3 - Video Call 

(1 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.

  • 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...

  • 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...
  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA and more than 70% in 10th and 12thUrban Clap interview preparation:Topics to prepare for the interview - Object-Oriented Programming, Data Structures, Dynamic Programming, Operating System, Database Management System, System DesignTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in Sep 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Tree question dsa
  • Q2. Fibonacci sequence question

Interview Preparation Tips

Interview preparation tips for other job seekers - Round 1 - Technical: The first round involved solving one tree-based question and one array-based question. I was also asked about object-oriented programming concepts, Git commands, and SQL queries. In addition, I faced questions based on my resume projects, and I was asked to explain the difference between a primary key and a unique key.

Round 2 - Technical: The second round focused more on system design and APIs. I was asked to explain the difference between PUT and POST in REST APIs, design the database schema of one of my projects, and discuss inheritance and access modifiers (public, private, protected). Git commands were also covered. A scenario-based question was presented: "How would you send an email to a million users, ensuring that if an email fails, the system retries sending it three times? If the retries fail, the system should move on to the next email. Additionally, if the system crashes after sending 1000-2000 emails, how would you ensure that upon restart, it resumes from where it left off without resending emails?"

The HR was friendly, clearly explained the next steps, and provided constructive feedback. Overall, it was a positive interview experience.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

The exam duration is one and a half hours.

Round 2 - Coding Test 

The total exam time is one and a half hours.

Round 3 - Group Discussion 

It encompasses all topics related to full stack development.

Round 4 - Technical 

(2 Questions)

  • Q1. Asks questions on SQL
  • Q2. Asks question in typical topics
Round 5 - HR 

(1 Question)

  • Q1. Where do you see yourself in two years?
  • Ans. 

    In two years, I see myself as a senior software developer leading a team on innovative projects.

    • Advancing to a senior software developer role

    • Leading a team on new and innovative projects

    • Continuing to enhance my technical skills through ongoing learning and training

  • Answered by AI

Urban Company Interview FAQs

How many rounds are there in Urban Company Software Developer interview?
Urban Company interview process usually has 2-3 rounds. The most common rounds in the Urban Company interview process are Technical, Coding Test and HR.
What are the top questions asked in Urban Company Software Developer interview?

Some of the top questions asked at the Urban Company Software Developer interview -

  1. Stock buy and sell with at most 2 transact...read more
  2. what is threa...read more
  3. Binary search to find tar...read more

Tell us how to improve this page.

Urban Company Software Developer Interview Process

based on 5 interviews

1 Interview rounds

  • Coding Test Round
View more
Urban Company Software Developer Salary
based on 19 salaries
₹12 L/yr - ₹40 L/yr
215% more than the average Software Developer Salary in India
View more details

Urban Company Software Developer Reviews and Ratings

based on 6 reviews

4.0/5

Rating in categories

3.5

Skill development

3.8

Work-life balance

2.7

Salary

3.8

Job security

3.6

Company culture

2.4

Promotions

3.3

Work satisfaction

Explore 6 Reviews and Ratings
Category Manager
532 salaries
unlock blur

₹4.2 L/yr - ₹13 L/yr

Business Development Associate
482 salaries
unlock blur

₹1.8 L/yr - ₹5.4 L/yr

Senior Category Manager
133 salaries
unlock blur

₹8 L/yr - ₹24 L/yr

Beautician
131 salaries
unlock blur

₹1 L/yr - ₹9 L/yr

Senior Associate
129 salaries
unlock blur

₹2.5 L/yr - ₹7.5 L/yr

Explore more salaries
Compare Urban Company with

Housejoy

4.2
Compare

Urban Ladder

3.7
Compare

Qube Services

4.4
Compare

Zimmber

3.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview