Upload Button Icon Add office photos

Urban Company

Compare button icon Compare button icon Compare

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. 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
  • 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 ...read more
  • Q3. 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 e ...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 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 Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... 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

What people are saying about Urban Company

View All
kyachahiye
1w
A Software Developer
Ab didi gaon jaenge to mummy ko tension nahi hoegi😂
I feel that this service is a good idea. What do you think?
FeedCard Image
Got a question about Urban Company?
Ask anonymously on communities.
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

 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 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 appeared for an interview 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. 

    Implement a function to find the index of the first occurrence of one string within another string.

    • Iterate through the second string and check if a substring of the same length as the first string matches the first string.

    • Return the index of the first occurrence of the first string within the second string, or -1 if not found.

    • Handle edge cases like empty strings or when the first string is longer than the second string

  • Answered by AI
  • 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. 

    Search for integers in a rotated sorted array efficiently.

    • Implement binary search to find the target integer in the rotated array.

    • Handle the rotation by checking which side of the array is sorted before performing binary search.

    • Return the index of the target integer if found, else return -1.

    • Time complexity of O(logN) is required for each query.

  • Answered by AI
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. 

    Calculate the number of distinct subsequences in a string with possible duplicates.

    • Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

    • Consider the cases where the current character is included or excluded in the subsequence.

    • Handle duplicates by considering the previous occurrence of the character.

    • Return the count of distinct subsequences modulo 10^9 + 7.

  • Answered by AI
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 appeared for an interview 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. 

    Determine the minimum number of conference rooms needed to schedule meetings without overlap.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of the rooms in use.

    • If a meeting starts after another ends, it can reuse the same room.

    • If a meeting starts before another ends, a new room is needed.

    • Return the maximum number of rooms in use at any point.

  • Answered by AI
  • 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. 

    Find an integer Y such that XOR operation with X yields maximum value within given constraints.

    • Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.

    • To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.

    • Ensure the final Y does not exceed (2^61) - 1.

    • Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.

    • Examp...

  • Answered by AI
  • 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. 

    Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.

    • Sort the array in non-decreasing order.

    • Iterate through the array and calculate the difference between adjacent elements.

    • Remove elements to minimize the maximum difference.

    • Return the minimized maximum difference.

  • Answered by AI
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. 

    Count occurrences of a number in a sorted array efficiently.

    • Use binary search to find the first and last occurrence of the target number in the array.

    • Calculate the count of occurrences by subtracting the indices of the last and first occurrences.

    • Handle cases where the target number is not found in the array.

    • Time complexity: O(log(N)), Space complexity: O(1).

  • Answered by AI
  • 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. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases such as no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process neighboring oranges

  • Answered by AI
  • 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. 

    Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.

    • Use a hashmap to store the mapping between original nodes and cloned nodes.

    • Iterate through the original linked list to create the cloned linked list by mapping the random pointers using the hashmap.

    • Time complexity of this approach is O(N) where N is the number of nodes in the linked list.

  • Answered by AI
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 appeared for an interview 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. 

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

  • Answered by AI
  • 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. 

    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.

  • Answered by AI
  • 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. 

    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.

  • Answered by AI
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. 

    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.

  • Answered by AI
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. 

    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.

  • Answered by AI

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

I appeared for an interview before Apr 2021.

Round 1 - Telephonic Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

It was in the mid day and since I applied for a Frontend role the discussion was majorly around data structure and bit of Javascript.
The interviewer was helping and good listener.

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the values of the two linked lists and add the smaller value to the merged list

    • Move the pointer of the merged list and the pointer of the smaller value list

    • Continue this process until one of the lists is fully traversed

    • Append the remaining elements of the other list to the me

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an array of 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

    • Swap elements based on the values encountered to sort the array in-place.

    • Time complexity should be O(N) and space complexity should be O(1).

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was more of a in depth round on the framework I'm working on and problem solving.

  • Q1. What is the event loop and what is its significance?
  • Ans. 

    The event loop is a mechanism in programming that allows for asynchronous execution of code.

    • The event loop is a key component in JavaScript's runtime environment, responsible for handling asynchronous operations.

    • It continuously checks the call stack for any pending tasks and executes them in a non-blocking manner.

    • The event loop ensures that the program remains responsive by allowing other code to run while waiting for ...

  • Answered by AI
  • Q2. Can you provide examples of output-based questions in JavaScript that utilize browser APIs?
  • Ans. 

    Output-based questions in JavaScript using browser APIs

    • Example 1: Write a script that uses the Geolocation API to display the user's current location on a map

    • Example 2: Create a program that uses the Web Audio API to play a sound when a button is clicked

    • Example 3: Develop a web page that uses the Canvas API to draw a simple animation

  • Answered by AI
  • Q3. How would you design a system to support localization in a mobile app?
  • Ans. 

    Designing a system to support localization in a mobile app

    • Use resource files to store localized strings for different languages

    • Implement a language selection feature for users to choose their preferred language

    • Utilize localization libraries or frameworks to streamline the process

    • Consider cultural differences when localizing content, such as date formats and currency symbols

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 75 Minutes
Round difficulty - Hard

It was more of a fitment/managerial round.
Didn't had any coding questions, but was asked more on approaches and optimisations.
Discussions on the project you have worked on.

  • Q1. You need to find the fastest 3 horses out of a group, given that you can only race 5 horses at a time. How would you approach this problem?
  • Ans. 

    To find the fastest 3 horses out of a group with 5 horses racing at a time, we can use a tournament style approach.

    • Divide the horses into groups of 5 and race them against each other. This will give you the fastest horse in each group.

    • Take the winners from each group and race them against each other. The top 3 horses in this final race will be the fastest 3 overall.

    • Keep track of the results and compare the timings to d

  • Answered by AI
  • Q2. How do you debug the root cause of lag on a screen?
  • Ans. 

    To debug lag on a screen, analyze code, check for memory leaks, optimize rendering, and use profiling tools.

    • Analyze code to identify any inefficient algorithms or operations causing lag.

    • Check for memory leaks that could be impacting performance.

    • Optimize rendering by reducing the number of draw calls, optimizing shaders, and minimizing overdraw.

    • Use profiling tools like Xcode Instruments or Android Profiler to identify p

  • Answered by AI
  • Q3. Can you explain the architecture of the app you have recently worked on?
  • Ans. 

    The app I recently worked on is a social media platform for sharing photos and connecting with friends.

    • The app follows a client-server architecture, with the client being the mobile app and the server handling data storage and processing.

    • The client side is built using React Native for cross-platform compatibility.

    • The server side is implemented using Node.js with a MongoDB database for storing user data and photos.

    • The a...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaNo criteriaCars24 interview preparation:Topics to prepare for the interview - Data Structures Algorithms, Javascript, System DesignTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Get your JS fundamentals right (if applying for a Frontend role, https://javascript.info/ is a good start)
Tip 2 : Apart from preparing data structures, practise on the communication skills as well (prepare your introduction, be a good listener and on spot improvisation plays key roles)

Application resume tips for other job seekers

Tip 1 : highlight projects related to the job profile in your resume and mention what was your contribution in them precisely in 1/2 lines.
Tip 2 : Include URLs to applications/projects that you have build and your achievements/blog (if any)

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. The question was about Nodejs
  • Q2. The question was to build a linked list in Nodejs
Round 2 - Technical 

(2 Questions)

  • Q1. The first question was related to DSA
  • Q2. The question was related to SQL

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 - ₹32 L/yr
187% 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
558 salaries
unlock blur

₹4 L/yr - ₹14 L/yr

Business Development Associate
490 salaries
unlock blur

₹1.8 L/yr - ₹5.2 L/yr

Senior Category Manager
137 salaries
unlock blur

₹10 L/yr - ₹24 L/yr

AC Technician
135 salaries
unlock blur

₹0.7 L/yr - ₹7.2 L/yr

Beautician
134 salaries
unlock blur

₹0.8 L/yr - ₹7.8 L/yr

Explore more salaries
Compare Urban Company with

Housejoy

4.2
Compare

Urban Ladder

3.7
Compare

Udaan

3.9
Compare

Swiggy

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