1st round was a hacker earth coding test. Problems were similar to Next Smaller Element in an Array, Number of ways to reach the bottom down corner of a matrix with obstructions.
Find a number in a sorted array which is rotated in O(log n) time in one pass.
Divide one number with another. If the resultant decimal is recurring represent it as following: Eg: 50/22 = 2.2727272727 shall be represented as 2.{27}.
The following metrics were computed from 1 interview experience for the Dream11 Backend Engineer role in Bengaluru, India.
Dream11's interview process for their Backend Engineer roles in Bengaluru, India is extremely selective, failing the vast majority of engineers.
Candidates reported having very good feelings for Dream11's Backend Engineer interview process in Bengaluru, India.