Urban Company Interview Questions, Process, and Tips

Air brush makeup is so long lasting

Squid game is it good reflection of society or not.

Q1. Why a plumber should sign up for urban company by paying rupees 2500
Ans. 
Plumbers should sign up for Urban Company by paying Rs 2500 because it offers a wide customer base, marketing support, and access to advanced tools and technology.
• Urban Company provides a large customer base, allowing plumbers to reach more potential clients.

• The platform offers marketing support, helping plumbers promote their services and attract more customers.

• By signing up, plumbers gain access to advanced tools and...read more
Answered by AI
View 1 more answer

Q1. Circuit repair and intall ac
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. 
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
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. 
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
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. 
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
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