Urban Company (UrbanClap) interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Urban Company (UrbanClap)
upvote
share-icon
4 rounds | 7 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: Data Structures, Algorithms, OOPS, System Design, Graphs, DP
Tip
Tip

Tip 1 : Prepare Graphs & DP. Atleast up to beginner level.
Tip 2 : Definitely prepare Arrays well. Sorting & Searching in arrays is a must.
Tip 3 : Prepare questions on resume projects & internship experiences.

Application process
Where: Linkedin
Resume Tip
Resume tip

Tip 1 : Mention technologies only on which you're thorough as you'll be grilled on those.
Tip 2 : Prepare questions on projects

Interview rounds

01
Round
Medium
Face to Face
Duration60 minutes
Interview date15 May 2020
Coding problem2

Timing: 11AM
It was an office environment, everyone was working and interview was conducted in one of the meeting rooms.

1. Trapping Rain Water

Moderate
15m average time
80% success
0/80
Asked in companies
RazorpayMorgan StanleyUber

You have been given a long type array/list 'arr’ of size 'n’.


It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.



Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].

Output: 10

Explanation: Refer to the image for better comprehension:

Alt Text

Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach

First, used a brute force approach to find water on each building.
Then built an auxillary array to store the maxLeft and maxRight. Then applied the formula: water on building = max(maxLeft, maxRight) - height of building.

Try solving now

2. Cycle Detection in a Singly Linked List

Moderate
15m average time
80% success
0/80
Asked in companies
GrabThalesSterlite Technologies Limited

You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.


A cycle occurs when a node's next points back to a previous node in the list.


Example:
In the given linked list, there is a cycle, hence we return true.

Sample Example 1

Problem approach

It's a very generic and regular problem.
Used rabit and hare algorithm. Rabit pointer skips 1 node each time, hare doesn't. If they meet then we have a cycle.

Try solving now
02
Round
Easy
Face to Face
Duration60 minutes
Interview date15 May 2020
Coding problem1

Timing : 2PM
Office environment

1. Android Questions

  • Explain the working of a recycler view in Android
  • Explain activity lifecycle and view lifecycle
  • What is AIDL? Which data types are supported by AIDL?
  • What is AndroidManifest.xml file and why do you need this?
  • Explain the difference between Implicit and Explicit Intent.
Problem approach

First I told why recycler view was introduced when we already had list view.
Then explained how recycling works.
Then told some drawbacks of recycler view.
Then finally I explained the View Holder pattern of recycler view.

And for the rest of the questions, my android concepts were good enough. So, Brush up your android concepts

03
Round
Easy
Face to Face
Duration60 minutes
Interview date15 May 2020
Coding problem3

This round was conducted very late. Around 8PM. Had to wait a long long time for the interviewer as she was in a meeting.
It was a whiteboard interview.

1. Search In Rotated Sorted Array

Moderate
30m average time
65% success
0/80
Asked in companies
FreshworksExpedia GroupPayPal

Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1, 2, 3, 4, 5] and if he rotates it by 2, then the array becomes: [4, 5, 1, 2, 3].

After rotating a sorted array, Aahad needs to answer Q queries asked by Harshit, each of them is described by one integer Q[i]. which Harshit wanted him to search in the array. For each query, if he found it, he had to shout the index of the number, otherwise, he had to shout -1.

For each query, you have to complete the given method where 'key' denotes Q[i]. If the key exists in the array, return the index of the 'key', otherwise, return -1.

Note:

Can you solve each query in O(logN) ?
Problem approach

First created an example array.
Then gave the logic of the problem. I had already solved this problem before.
Then wrote pseudocode and explained the dryrun.

Try solving now

2. Is It A Tree?

Moderate
20m average time
75% success
0/80
Asked in companies
BarclaysGoldman SachsCIS - Cyber Infrastructure

Given a graph with 'V' vertices numbered from 0 to 'V' - 1 and 'E' edges. Determine if it is a tree or not?

Problem approach

I did the same problem on a online platform previously. So, as soon as I show the question the approach I used there was in my mind and I solved it easily

Try solving now

3. Project Queries

  • Explain the project you worked on in your internship
  • What are the features that you want to change in it if you are given a chance today
  • What was your role in the project making team?
  • What you did to give your best in that role?
Problem approach

Tip 1 : Prepare questions on your internship work.
Tip 2 : Be ready to explain about your contribution to the team.
Tip 3 : Give some concrete example of both above.

04
Round
Medium
Face to Face
Duration60 minutes
Interview date16 May 2020
Coding problem1

It was a VP round, around 12 AM. Was made to wait a little since VP was late to the office, but was ok.

1. System Design

  • Tell me about yourself
  • Tell me about your communication skills.
  • What is the one thing you would change about the company if you could today?
  • Explain how you design any of the system you worked on in internship
  • Why do you want to join UC?
Problem approach

Tip 1 : Prepare questions about your past experience.
Tip 2 : Do some research about the company
Tip 3 : Confidence & communication skills matter in this round.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Urban Company (UrbanClap)
3461 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Urban Company (UrbanClap)
0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Urban Company (UrbanClap)
779 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Urban Company (UrbanClap)
810 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes