Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by DistrictD || Utopian Dreams Private Limited Team. If you also belong to the team, you can get access from here

Filter interviews by

DistrictD || Utopian Dreams Private Limited Interview Questions and Answers

Updated 15 Jan 2025

DistrictD || Utopian Dreams Private Limited Interview Experiences

Popular Designations

3 interviews found

Interview Questions & Answers

user image Anonymous

posted on 11 May 2023

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

I applied via Recruitment Consulltant and was interviewed before May 2022. 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 Resume tips
Round 2 - Technical 

(1 Question)

  • Q1. What is eps, income statement , balance sheet and cfs ?
  • Ans. 

    EPS is earnings per share, income statement shows revenue and expenses, balance sheet shows assets and liabilities, CFS shows cash flow.

    • EPS is a financial metric that shows how much profit a company has earned per share of its stock

    • Income statement shows a company's revenue and expenses over a specific period of time

    • Balance sheet shows a company's assets, liabilities, and equity at a specific point in time

    • CFS shows how...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Why do you want to join

Interview Preparation Tips

Topics to prepare for DistrictD interview:
  • Financial Modelling
Interview preparation tips for other job seekers - have financial statement knowledge
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed before Jan 2024.

Round 1 - Coding Test 

Even odd, prime no. ,greatest all, skip no

Round 2 - Aptitude Test 

Easy aptitude
percentage
family question

Round 3 - Coding Test 

Basic java question like prime no ,factorial

Interview Preparation Tips

Interview preparation tips for other job seekers - work on basics ,oops , dsa

Engineer Trainee Interview Questions asked at other Companies

Q1. If 10 people had a meeting and they shake hands only once with each of the others, then how many handshakes will be there in total ?
View answer (8)
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Jul 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Sort an array of 0,1,2 in O(n)
  • Ans. 

    Dutch National Flag algorithm can be used to sort an array of 0,1,2 in O(n) time complexity.

    • Initialize three pointers - low, mid, high at the start, end, and end of the array respectively.

    • Iterate through the array and swap elements based on their values with the pointers.

    • Example: Input array: ['1', '0', '2', '1', '0'], Output array: ['0', '0', '1', '1', '2']

  • Answered by AI
  • Q2. ATM machine money retrieving program based on if else
  • Ans. 

    ATM program to retrieve money based on user input using if else statements

    • Create a function to handle the ATM money retrieval process

    • Use if else statements to check user input and dispense money accordingly

    • Handle different scenarios like insufficient funds or invalid input

    • Example: if(amount <= balance) { dispenseMoney(amount); } else { displayMessage('Insufficient funds'); }

  • Answered by AI

Interview Preparation Tips

Topics to prepare for DistrictD || Utopian Dreams Private Limited Software Developer interview:
  • DSA

Skills evaluated in this interview

Software Developer Interview Questions asked at other Companies

Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array = [34, -50, 42, 14, -5, 86] Output: 137 Explanation: The maximum sum is... read more
View answer (42)

Interview questions from similar companies

I applied via Campus Placement

Interview Preparation Tips

Round: Resume Shortlist
Experience: They selected 10 students from our college from CS and IT .They are looking for guys with extra projects done during college .App development will be a bonus ,contribution to open source and competitive programming will help for shortlisting.
Some of my friends had research papers published and they too got selected.

Round: Test
Experience: Have to write code snippet for 4 questions in 45 minutes
1.Difference between hour hand and minute hand
2.longest palindromic sub string.
3.Product Array puzzle
4.Some question related to matrix

Tips: All question were from geeksforgeeks
So practice it well ..u will make through it

Round: Test
Experience: Long Discussion on projects
They will scan each and every line of your Resume ,so dont write bullshits..
I wrote about interest in AI and got screwed..Discussion on college projects and final year project.
Then asked me to design a snake and ladder game OOPS concepts
Told me to find sum of all elements of sub matrix..(hint pre-processing the matrix)
Asked me about sessions and cookies
Gave a query to write on database indexing (dont remember exactly)
Asked me the code of the difference between hour hand and minute hand and extended it wid the second hand
Asked me as how to implement a dictionary
asked about TRIES ,CODE SNIPPET ON THE SHARED DOCS
One of my friend was asked to implement (set) of STL
Tips: The interviewer was cool guy..helped me a lot always made me comfortable.Interact with them as much as possible

Round: Test
Experience: Wid the CTO of the company .
Started wid the projects again .ACID properties,Database transactions,Concurrency Control
Optimization in database.
Then he asked me to code a function
Given a hash function applied on letters of English words ,un-hash it.Took me 45 minutes to reach the solution ,he helped me a lot.
Asked me to write the code for diameter of a binary tree
Asked me write the code for Boolean Matrix
One of my friend was asked to a question in which there was a bug in a m*n matrix and we have to find the bug(hint dfs or bfs)
Tips: keep calm ,,just keep talking ad he will help u a lot...

Round: HR
Experience: This was the toughest round for me...I had cleared all the rounds but they rejected me in the HR round ,,,dont know where I screwed..Learn every thing of Zomato..
They offered me an internship and thereafter they would look to give a PPO ...!!!lets see what happens

Skills: Coding Skills And Knowledge On Data Structures
Duration: 3
College Name: NIT Srinagar

Interview Questionnaire 

9 Questions

  • Q1. Write a regex for email validation?
  • Ans. 

    Regex for email validation

    • Start with a string of characters followed by @ symbol

    • Followed by a string of characters and a period

    • End with a string of characters with a length of 2-6 characters

    • Allow for optional subdomains separated by periods

    • Disallow special characters except for . and _ in username

  • Answered by AI
  • Q2. Parse the XML? and store the output in JSON. Discussed different approaches?
  • Q3. Print prime numbers in a given range and optimize the solution?
  • Ans. 

    Print prime numbers in a given range and optimize the solution.

    • Use Sieve of Eratosthenes algorithm to generate prime numbers efficiently

    • Start with a boolean array of size n+1, mark all as true

    • Loop through the array and mark all multiples of each prime as false

    • Print all the indexes that are still marked as true

  • Answered by AI
  • Q4. Puzzle – 25 horses – 5 lanes, find fastest 3 horses?
  • Q5. Web related questions on Sessions and cookies?
  • Q6. A lot of discussion on my resume, experience etc
  • Q7. Find angle between hour hand and minute hand in clock if time is given? Write a program or pseudo code?
  • Ans. 

    Find angle between hour and minute hand in a clock given the time.

    • Calculate the angle made by the hour hand with respect to 12 o'clock position

    • Calculate the angle made by the minute hand with respect to 12 o'clock position

    • Find the difference between the two angles and take the absolute value

    • If the angle is greater than 180 degrees, subtract it from 360 degrees to get the smaller angle

  • Answered by AI
  • Q8. A hash function was written to convert a string into a hash. Write a un-hash function to revert it(from hash to string)?
  • Ans. 

    To un-hash a string, use a reverse algorithm to convert the hash back to the original string.

    • Create a reverse algorithm that takes the hash as input and outputs the original string

    • Use the same logic as the hash function but in reverse order

    • If the hash function used a specific algorithm, use the inverse of that algorithm to un-hash the string

  • Answered by AI
  • Q9. He discussed about expectations and role. Asked me if I have any questions. He said to me “yaha aana hai to marwani padegi. tyar ho”? I smiled and asked what are the work timings? He said 9-9 and I was kin...

Interview Preparation Tips

General Tips: I applied through a recruiter. Then I got a call from Zomato HR. It was for LAMP developer profile. She asked me about my profile and also shared some expectations from the role. She asked me to come for F2F rounds to take the process further
Skills: Web development, JSON, Algorithm
College Name: na
Motivation: Overall process was not very tough. But they have start up culture. People work their for 11-12 hours a day. Sometimes on Saturday as well. So people who are geeks or have nothing in life to do except their job can go and join

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a typical DS/Algo where I was asked to solve two questions related to Binary Trees and write the pseudo code for both of them followed by some theoretical questions related to Operating Systems.

  • Q1. 

    K-th Largest Number in a BST

    Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.

    If there is no K-th la...

  • Ans. 

    Find the K-th largest element in a BST.

    • Perform reverse in-order traversal of the BST to find the K-th largest element.

    • Keep track of the count of visited nodes to determine the K-th largest element.

    • Return -1 if there is no K-th largest element in the BST.

  • Answered by AI
  • Q2. 

    Is Height Balanced Binary Tree Problem Statement

    Determine if the given binary tree is height-balanced. A tree is considered height-balanced when:

    1. The left subtree is balanced.
    2. The right subtree is bala...
  • Ans. 

    Determine if a given binary tree is height-balanced by checking if left and right subtrees are balanced and their height difference is at most 1.

    • Check if the left subtree is balanced

    • Check if the right subtree is balanced

    • Calculate the height difference between the left and right subtrees

    • Return 'True' if all conditions are met, otherwise return 'False'

  • Answered by AI
  • Q3. Can you explain the concepts of Zombie Process and Orphan Process in operating systems?
  • Ans. 

    Zombie process is a terminated process that has completed execution but still has an entry in the process table. Orphan process is a process whose parent process has terminated.

    • Zombie process is created when a child process completes execution but its parent process has not yet read its exit status.

    • Zombie processes consume system resources and should be cleaned up by the parent process using wait() system call.

    • Orphan p...

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was also a Data Structures and Algorithm round where I was asked to solve 3 medium to hard level problems along with their pseudo code within 60 minutes .

  • Q1. 

    Longest Substring Without Repeating Characters Problem Statement

    Given a string S of length L, determine the length of the longest substring that contains no repeating characters.

    Example:

    Input:
    "abac...
  • Ans. 

    Find the length of the longest substring without repeating characters in a given string.

    • Use a sliding window approach to keep track of the longest substring without repeating characters.

    • Use a hashmap to store the index of each character in the string.

    • Update the start index of the window when a repeating character is found.

    • Calculate the maximum length of the window as you iterate through the string.

    • Return the maximum le

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

    • Use binary search to efficiently search for integers in the rotated sorted array.

    • Handle the rotation of the array while performing binary search.

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

  • Answered by AI
  • Q3. 

    Count Subarrays with Sum Divisible by K

    Given an array ARR and an integer K, your task is to count all subarrays whose sum is divisible by the given integer K.

    Input:

    The first line of input contains an...
  • Ans. 

    Count subarrays with sum divisible by K in an array.

    • Iterate through the array and keep track of the prefix sum modulo K.

    • Use a hashmap to store the frequency of each prefix sum modulo K.

    • For each prefix sum, increment the count by the frequency of (prefix sum - K) modulo K.

    • Handle the case when prefix sum itself is divisible by K.

    • Return the total count of subarrays with sum divisible by K.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

In this round , I was asked to code a simple question related to BST . After that I was asked the internal implementation of a Hash Map where I was supposed to design a Hash Map using any of the Hashing Algorithms that I know . This was preety challenging for me but I got to learn so much from it.

  • Q1. 

    Ceil Value from BST Problem Statement

    Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.

    The ceil of an integer is defined as the s...

  • Ans. 

    Ceil value of a key in a Binary Search Tree (BST) is found by returning the smallest integer greater than or equal to the given number.

    • Traverse the BST to find the closest value greater than or equal to the key.

    • Compare the key with the current node value and update the ceil value accordingly.

    • Recursively move to the left or right subtree based on the comparison.

    • Return the ceil value once the traversal is complete.

  • Answered by AI
  • Q2. 

    Design a Constant Time Data Structure

    Create a data structure that maintains mappings between keys and values, supporting the following operations in constant time:

    1. INSERT(key, value): Add or update t...
  • Ans. 

    Design a constant time data structure to maintain mappings between keys and values with various operations.

    • Use a hash table to achieve constant time complexity for INSERT, DELETE, SEARCH, and GET operations.

    • Keep track of the number of key-value pairs for GET_SIZE operation.

    • Check if the hash table is empty for IS_EMPTY operation.

    • Return true or false for SEARCH operation based on key existence.

    • Return the value associated...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Hard

I found the online coding round of Flipkart to be quite difficult based on the constraints of the problem and their time limits. I coded the first problem quite easily but on the second and the third problem , my code could only pass a few test cases and gave TLE for most of them. Both the questions required very efficient solution and the last 5 to 10 Test Cases carried more weight than the rest so I didn't get through this round.

  • Q1. 

    Print the Kth Digit

    Given three non-negative integers N, M, and K, compute the Kth digit from the right in the number obtained from N raised to the power M (i.e., N ^ M).

    Input:

    The first line contains ...
  • Ans. 

    The task is to find the Kth digit from the right in the number obtained from N raised to the power M.

    • Iterate through the digits of N^M from right to left

    • Keep track of the position of the current digit

    • Return the digit at position K from the right

  • Answered by AI
  • Q2. 

    The Skyline Problem

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...

  • Ans. 

    Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.

    • Iterate through the buildings and create a list of critical points (x, y) where the height changes.

    • Sort the critical points based on x-coordinate and process them to form the skyline.

    • Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

    • Return the fin...

  • Answered by AI
  • Q3. 

    Longest Palindromic Substring Problem Statement

    You are provided with a string STR of length N. The goal is to identify the longest palindromic substring within this string. In cases where multiple palind...

  • Ans. 

    Identify the longest palindromic substring in a given string.

    • Iterate through the string and expand around each character to find palindromes

    • Keep track of the longest palindrome found

    • Return the longest palindrome with the smallest start index

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAFlipkart interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: It was a good one but both questions would have been easy if we know more libraries in java
Tips: Both the questions were related to bigint. It could have been better if both questions were from different areas
Duration: 90 minutes

Round: Technical Interview
Experience: I felt my interview went fine since i was able to answer most of their questions.They gave many hints even if i didn't get the right one
Tips: Everything was fine

Round: HR Interview
Experience: I was able to see myself how i responded to questions asked regarding me and sometimes i was just blabbering
Tips: nothing

General Tips: One must be good at datastrucures and algorithms
Skill Tips: nothing
Skills: Datastructures and Algorithms
Duration: 2
College Name: IIT Madras
Motivation: I wanted to do something for the company where I ordered many of my things
Funny Moments: No funny moments as such but I enjoyed talking to the hr interviewer

Software Developer Interview Questions & Answers

Flipkart user image RAJIVTEJA NAGIPOGU

posted on 25 Aug 2015

I applied via Campus Placement

Interview Preparation Tips

Round: Test
Experience: The test started very late due to some technical issues and space issues. So , It helped us to be far more relaxed.
Duration: 11/2 hr minutes
Total Questions: 2

Round: Technical Interview
Experience: The Overall Technical Interview was a mixture of innovation and apprehension and it really helped me to get my strengths and weaknesses out. The questions outsmarted me at the beginning, Later I did.

Round: HR Interview
Experience: HR was very friendly. He asked about my strengths and weaknesses. And then we continued talking about the nature of work and sincerity and technicality expected from my side, while taking a stroll in cool night air.

Skills: Algorithms and DataStructures
Duration: 2 months
College Name: IIT Madras
Motivation: The work specification

I applied via Campus Placement

Interview Questionnaire 

2 Questions

  • Q1. First question was about a robot and tracking his movements.Given a string of moves a robot makes check if he ends up at the location he starts from?
  • Q2. Given a list of stars and their distances from the earth.Find an efficient solution to find the k closest stars to earth?
  • Ans. 

    Efficient solution to find k closest stars to earth from a list of stars and their distances.

    • Use a priority queue to store the distances of stars from earth.

    • Iterate through the list of stars and add their distances to the priority queue.

    • Pop k elements from the priority queue to get the k closest stars to earth.

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: The online coding test is not that difficult. The questions are very easy. Only thing is that you have to come up with an efficient solution.The naive solutions are fairly obvious.
Tips: Practice some algorithms questions.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: First question was very simple. I was asked for the solution first and then to write the code on paper and show it to him.Second question requires more time to think.
Tips: A good knowledge of data structures and algorithms will help you clear the interview with ease.

Round: HR Interview
Experience: The guy asking questions makes you feel relaxed. He will give you a feedback about the test and the questions asked in the test. I appreciated the feedback. He pointed out things i could have done better.
Tips: The HR interview is relatively easy. Its just a chat about you and your interests and some other questions like "why should I hire you?".

General Tips: A good knowledge of Data structures and Algorithms will help clear the interview and the test.
Skill Tips: Practice Data structures and Algorithms questions.
Skills: Data structures and Algorithms, Coming up with efficient solutions
Duration: 2
College Name: IIT Madras
Motivation: I wanted to apply for Flipkart as I have seen its meteoric rise in the past few years. It has transformed the wasy people shop in India.

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

DistrictD || Utopian Dreams Private Limited Interview FAQs

How many rounds are there in DistrictD || Utopian Dreams Private Limited interview?
DistrictD || Utopian Dreams Private Limited interview process usually has 2-3 rounds. The most common rounds in the DistrictD || Utopian Dreams Private Limited interview process are Technical, Coding Test and Resume Shortlist.
How to prepare for DistrictD || Utopian Dreams Private Limited interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at DistrictD || Utopian Dreams Private Limited. The most common topics and skills that interviewers at DistrictD || Utopian Dreams Private Limited expect are Digital Marketing, HTML, HTML and CSS, Javascript and MySQL.
What are the top questions asked in DistrictD || Utopian Dreams Private Limited interview?

Some of the top questions asked at the DistrictD || Utopian Dreams Private Limited interview -

  1. what is eps, income statement , balance sheet and cf...read more
  2. ATM machine money retrieving program based on if e...read more
  3. Sort an array of 0,1,2 in O...read more

Recently Viewed

INTERVIEWS

Motadata

No Interviews

INTERVIEWS

Sasken

No Interviews

INTERVIEWS

Nutanix

No Interviews

INTERVIEWS

Motadata

No Interviews

INTERVIEWS

Jodo

No Interviews

INTERVIEWS

Nutanix

No Interviews

INTERVIEWS

Motadata

No Interviews

INTERVIEWS

Sasken

No Interviews

INTERVIEWS

DistrictD || Utopian Dreams Private Limited

No Interviews

INTERVIEWS

Sasken

No Interviews

Tell us how to improve this page.

DistrictD || Utopian Dreams Private Limited Interview Process

based on 2 interviews

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Flipkart Interview Questions
4.0
 • 1.3k Interviews
Paytm Interview Questions
3.3
 • 752 Interviews
Swiggy Interview Questions
3.8
 • 428 Interviews
PolicyBazaar Interview Questions
3.6
 • 348 Interviews
Zomato Interview Questions
3.8
 • 312 Interviews
Ola Cabs Interview Questions
3.4
 • 139 Interviews
Urban Company Interview Questions
3.4
 • 134 Interviews
MakeMyTrip Interview Questions
3.7
 • 122 Interviews
CapitalOne Interview Questions
3.7
 • 78 Interviews
BookMyShow Interview Questions
4.0
 • 23 Interviews
View all

Fast track your campus placements

View all

DistrictD || Utopian Dreams Private Limited Reviews and Ratings

based on 9 reviews

4.3/5

Rating in categories

3.8

Skill development

4.4

Work-life balance

4.0

Salary

4.3

Job security

4.1

Company culture

4.0

Promotions

4.1

Work satisfaction

Explore 9 Reviews and Ratings
Software Developer
14 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Financial Analyst
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Full Stack Developer
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Financial Analyst
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
3 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare DistrictD || Utopian Dreams Private Limited with

Urban Company

3.4
Compare

Swiggy

3.8
Compare

Zomato

3.8
Compare

Ola Cabs

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