Dezerv

Role: Backend Engineer

College: Not Specified

Interview Date: May 29, 2024

Interview Type: Full-Time

Result: Rejected

Difficulty: Medium-Hard

Rounds: 3 rounds (plus Online Assessment)

Topics Asked: Data Structures, Algorithms (Dynamic Programming), Low-Level Design

Experience:

The candidate applied for a Backend Engineer position at Dezerv.

Round 1 (Online Assessment): This round comprised 2 coding questions.

Round 2 (Coding Round): The candidate was given a coding question: "You are given a triangular array/list 'TRIANGLE'. Your task is to return the minimum path sum to reach from the top to the bottom row. The triangle array will have N rows and the i-th row, where 0 <= i < N will have i + 1 elements. You can move only to the adjacent number of rows below each step. For example, if you are at index j in row i, then you can move to j or j + 1 index in row i + 1 in each step. If the array given is 'TRIANGLE' = [,,,] the triangle array will look like: 1, 2,3, 3,6,7, 8,9,6,10. For the given triangle array the minimum sum path would be 1->2->3->8. Hence the answer would be 14." This is a classic Dynamic Programming problem.

Round 3 (LLD - Mandate Problem): This round focused on Low-Level Design. The problem was related to "Mandates," which act as tokens for standing instructions with banks, enabling merchants to debit money from customer's bank accounts. The candidate had to prepare the LLD to integrate with a payment gateway to set up mandates and use them in different flows, including data flow for each component, APIs, and DB schema.

Overall Experience: The candidate was rejected after these rounds.