Backend developer | Apna Mart | Interview Experience
- Experience
- 2.8 years
- Posted
- 27 Apr 2025
Summary
I interviewed for a Backend developer role at Apna Mart, where I faced DSA and System Design challenges across two rounds. Despite acing certain questions, I was ultimately ghosted after the interviews.
How it went
My YOE -> 2.8
Round 1 ->
DSA -> house robber - 2
Max water trap
System design -> distributed locking, and more high level design questions
what is race considtion
three way to avoid it
CAP theoram
replication lag
Round 2->
DSA -> https://leetcode.com/problems/longest-valid-parentheses/
give me the most optimize
what is java string pool
is there concern both string point to the same object
you have rod of 7 unit cut atmost 2 times. . give it to employyee every day by one
Aced all question about rod cutting
verdict -> Ghosted
Questions asked (9)
- 01
House Robber II
Data Structures & Algorithms · Medium
A variation of the House Robber problem, where houses are arranged in a circle, and you cannot rob adjacent houses.
- 02
Trapping Rain Water
Data Structures & Algorithms · Hard
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
- 03
Distributed Locking
System Design
Discuss distributed locking mechanisms and their implementation in a system design context.
- 04
Race Condition
System Design
Explain what a race condition is and describe three ways to avoid it.
- 05
CAP Theorem
System Design
Explain the CAP Theorem and its implications for distributed systems.
- 06
Replication Lag
System Design
Discuss replication lag in the context of distributed databases or systems.
- 07
Longest Valid Parentheses
Data Structures & Algorithms · Hard
Open the problemGiven a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. Provide the most optimized solution.
- 08
Java String Pool
Other
Explain what the Java String Pool is and discuss any concerns regarding multiple string references potentially pointing to the same object within the pool.
- 09
Rod Cutting Problem (Variant)
Data Structures & Algorithms
You have a rod of 7 units. You can cut it at most 2 times. The objective is to give a piece of the rod to an employee every day, one by one.