Question 1

Final Prices With a Special Discount in a Shop — Dream11 Interview Question

Accepted Answer

"Final Prices With a Special Discount in a Shop" is a easy difficulty problem asked at Dream11 interviews. It covers the following topics: Array, Stack, Monotonic Stack. You can practice it on LeetCode: https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop

Question 2

Asteroid Collision — Dream11 Interview Question

Accepted Answer

"Asteroid Collision" is a medium difficulty problem asked at Dream11 interviews. It covers the following topics: Array, Stack, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/asteroid-collision

Question 3

Furthest Building You Can Reach — Dream11 Interview Question

Accepted Answer

"Furthest Building You Can Reach" is a medium difficulty problem asked at Dream11 interviews. It covers the following topics: Array, Greedy, Heap (Priority Queue). You can practice it on LeetCode: https://leetcode.com/problems/furthest-building-you-can-reach

Question 4

Gas Station — Dream11 Interview Question

Accepted Answer

"Gas Station" is a medium difficulty problem asked at Dream11 interviews. It covers the following topics: Array, Greedy. You can practice it on LeetCode: https://leetcode.com/problems/gas-station

Question 5

3Sum — Dream11 Interview Question

Accepted Answer

"3Sum" is a medium difficulty problem asked at Dream11 interviews. It covers the following topics: Array, Two Pointers, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/3sum

Question 6

Minimum Number of Increments on Subarrays to Form a Target Array — Dream11 Interview Question

Accepted Answer

"Minimum Number of Increments on Subarrays to Form a Target Array" is a hard difficulty problem asked at Dream11 interviews. It covers the following topics: Array, Dynamic Programming, Stack, Greedy, Monotonic Stack. You can practice it on LeetCode: https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array

#	Question Title	Difficulty	Frequency	Topics
1	Final Prices With a Special Discount in a Shop	EASY	100.0	ArrayStackMonotonic Stack
2	Asteroid Collision	MEDIUM	78.8	ArrayStackSimulation
3	Furthest Building You Can Reach	MEDIUM	72.2	ArrayGreedyHeap (Priority Queue)
4	Gas Station	MEDIUM	72.2	ArrayGreedy
5	3Sum	MEDIUM	72.2	ArrayTwo PointersSorting
6	Minimum Number of Increments on Subarrays to Form a Target Array	HARD	72.2	ArrayDynamic ProgrammingStack+2
7	Minimum Falling Path Sum	MEDIUM	62.8	ArrayDynamic ProgrammingMatrix
8	Shortest Common Supersequence	HARD	62.8	StringDynamic Programming
9	Number of Ways to Select Buildings	MEDIUM	62.8	StringDynamic ProgrammingPrefix Sum
10	Partition Equal Subset Sum	MEDIUM	62.8	ArrayDynamic Programming

Explore 450+ Companies

Companies

Dream11

Want to see more?

Dream11 Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Dream11

Want to see more?

Dream11 Interview Questions

Ai Assistant Kas