Dream11 interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Dream11
upvote
share-icon
3 rounds | 6 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 4 months
Topics: Data Structures, OOPS, Algorithms, Puzzles, Dynamic programming
Tip
Tip

Tip 1 : Have an insight of the company your are applying for.
Tip 2 : Go through the previous interview questions for those companies.
Tip 3 : Practice variety of questions instead of solving same type of questions.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1 : Keep it short and precise.
Tip 2 : Should know every detail you wrote in your resume.

Interview rounds

01
Round
Medium
Face to Face
Duration45 minutes
Interview date2 Dec 2019
Coding problem3

It was a puzzle round and only one coding ques was asked which is a very famous question

1. Puzzle

A person has 3000 bananas and a camel. The person wants to transport the maximum number of bananas to a destination which is 1000 KMs away, using only the camel as a mode of transportation. The camel cannot carry more than 1000 bananas at a time and eats a banana every km it travels. What is the maximum number of bananas that can be transferred to the destination using only camel (no other mode of transportation is allowed).

Problem approach

Tip 1 : Let us divide the journey into 3 parts. First, the camel takes 1000 bananas and travels 333 KMs and puts the remaining bananas (1000-333 = 667) at first intermediate place and returns back to the source. Similarly, two more times, the camel takes 1000 bananas and travel for 333 KMs and put there remaining. Now, the total numbers of bananas are 2001 at the first intermediate place. 
Tip 2 : Again, the camel takes 1000 bananas and travels 500 KMs and puts the remaining bananas(1000-500=500) at second intermediate place and returns back to first intermediate place. Similarly one more times, the camel takes 1000 bananas and travels for 500 KMs and put there remaining bananas. Now, the total number of bananas is 1000 at the second intermediate place. 
Tip 3 : At last, the camel takes 1000 bananas and travels the remaining journey to 167 KMs. Thus, the total number of bananas is 833 at the final destination.

2. Puzzle

100 coins are lying flat on a table. 10 of them are heads up and 90 are tails up.You can’t see which one is which.How can we split the coins into two piles such that there are same number of heads up in each pile?

Problem approach

Tip 1 : Make 2 piles with 10 coins and 90 coins each. Now, flip all the coins in the smaller pile.

3. 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.
Try solving now
02
Round
Easy
Face to Face
Duration45 minutes
Interview date2 Dec 2019
Coding problem2

It was a DS algo round

1. Rod cutting problem

Moderate
40m average time
75% success
0/80
Asked in companies
Dream11UberGoldman Sachs

Given a rod of length ‘N’ units. The rod can be cut into different sizes and each size has a cost associated with it. Determine the maximum cost obtained by cutting the rod and selling its pieces.

Note:
1. The sizes will range from 1 to ‘N’ and will be integers.

2. The sum of the pieces cut should be equal to ‘N’.

3. Consider 1-based indexing.
Problem approach

We can get the best price by making a cut at different positions and comparing the values obtained after a cut. We can recursively call the same function for a piece obtained after a cut.
Let cutRod(n) be the required (best possible price) value for a rod of length n. cutRod(n) can be written as follows.
cutRod(n) = max(price[i] + cutRod(n-i-1)) for all i in {0, 1 .. n-1}

Try solving now

2. Shortest Common Supersequence

Hard
25m average time
0/120
Asked in companies
Dream11Thought WorksSamsung

Given two strings, ‘A’ and ‘B’. Return the shortest supersequence string ‘S’, containing both ‘A’ and ‘B’ as its subsequences. If there are multiple answers, return any of them.

Note: A string 's' is a subsequence of string 't' if deleting some number of characters from 't' (possibly 0) results in the string 's'.

For example:
Suppose ‘A’ = “brute”, and ‘B’ = “groot”

The shortest supersequence will be “bgruoote”. As shown below, it contains both ‘A’ and ‘B’ as subsequences.

A   A A     A A
b g r u o o t e
  B B   B B B  

It can be proved that the length of supersequence for this input cannot be less than 8. So the output will be bgruoote.
Problem approach

1) Find Longest Common Subsequence (lcs) of two given strings.
2) Insert non-lcs characters (in their original order in strings) to the lcs found above, and return the result. So “ek” becomes “geeke” which is shortest common supersequence.
Let us consider another example, str1 = “AGGTAB” and str2 = “GXTXAYB”. LCS of str1 and str2 is “GTAB”. Once we find LCS, we insert characters of both strings in order and we get “AGXGTXAYB”

Try solving now
03
Round
Easy
HR Round
Duration45 minutes
Interview date2 Dec 2019
Coding problem1

It was a behavioural round

1. Basic HR Questions

  • Introduce yourself
  • What are your hobbies?
  • How can you use your hobbies to strengthen your personality?
  • What do you know about the work culture of Dream 11?
  • Give me an instance where you showed your leadership
Problem approach

Tip 1 : Stay Honest, stick to your points

Tip 2 : Stay confident

Tip 3 : Have some pre-requisites for the company you applying to

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
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4656 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3451 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114578 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34960 views
7 comments
0 upvotes