DevRev

1. 1

   Online test

   Online assessment: MCQs plus two DSA problems
   HackerEarth90 min7 questionshardeliminatory

   Section	Qs	Min	Topics
   MCQ	5	-	combinatorics, data structure comparison, OS basics, OOP
   DSA	2	-	heaps, prefix sums, monotonic deque, sliding window

   OS scheduling · OOP · priority queue · prefix sums · monotonic structures

   One account says about 10 MCQs and cannot recall duration; the other says 5 MCQs, 90 min, with 1-3 min limits per MCQ. Hidden test results not shown. About 8 shortlisted; solving 1.5 problems enough. DSA described as medium-hard.

2. 2

   Technical interview

   Interview round 1: DSA
   HackerEarth60 mineliminatory

   graphs · shortest path · trees · sliding window · heaps · deque

   Usually 2 DSA problems, one account got only 1. Coding on an IDE. About 3 candidates advanced to round 2.

3. 3

   Technical interview

   Interview round 2: projects and low-level design
   HackerEarth60 min

   project deep dive · OOP design · rate limiter · LSTM · databases · Docker · use of AI

   No dedicated HR round; a few behavioural questions came during the project discussion. Interviewer read the resume closely.

Advice from candidates

66 pieces of advice, in their own words. Names removed.

• Prepare your resume well especially your projects as they were pretty adamant to discuss them in my case. Prepare a good 1-2 min brief for each project, then just be ready for any questions related to them.

  Round 1 · 2023-24

• so just go with their flow

  Round 2 · 2023-24

• Prepare OOPs well. Try using class or structs appropriately in your code. It makes your code more descriptive and gives the interviewer a hint of your knowledge.

  general · 2023-24

• Go through system design once. At least acquaint yourself with basic terminologies. And be honest, don't speak more than what you know.

  general · 2023-24

Loading the other 62…

Question patterns reported

The kind of problem, not the problem itself. Our practice questions are written to match these patterns.

• Codingtext line justification
• Codingbalancing chemical equations from strings
• Technicalbuild tree from array under rule, compute depth
• Technicalpick one value per array minimising max-min spread
• Technicalmerge k sorted arrays with heap
• Onlinepick k indices maximising sum times minimum of paired values
• Onlineshortest subarray with sum at least k, negatives allowed
• Technicaltwo travellers with different speeds, best meeting node via shortest paths
• Technicalswap leaf values pairwise in a level-order tree
• Technicalwindow maximum with heap then deque
• Technicalsliding-window per-user request rate limiter class
• Technicalimplement own project's data structure with tests
• Technicalderive one tree traversal from two others
• Technicalrow with most ones in sorted-row binary matrix
• Technicalloop update rule and its complexity
• Technicalversioned stack with O(1) version switch
• Technicaltree algorithm implemented with classes and objects
• Codingdirect implementation of least-frequently-used cache
• Codinginterval DP on removing boxes
• Codingeasy LIS variants
• Technicalset with insert, remove and random element, then allow duplicates
• Technicalrow with most ones in row-sorted binary matrix, three solutions
• Technicalderive logistic regression gradient update with vector calculus
• Codingminimum moves to make positions contiguous