πŸš€ MoEngage SDE-2 Backend Interview Experience | Loyal Customer + Rate Limiter + Retry πŸ”₯

moengage logo
moengage
Β· SDE-2 (Backend Developer)
February 27, 2026 Β· 1 reads

Summary

I recently interviewed at MoEngage for an SDE-2 Backend Developer role. My Round 1 involved a coding problem focused on identifying loyal customers from log files, followed by a system design discussion related to the problem.

Full Experience

Hi Everyone πŸ‘‹

Recently, I interviewed at MoEngage for the SDE-2 (Backend Developer) role. Sharing my Round 1 experience β€” hope it helps someone preparing for backend/system design interviews πŸ’‘

🧩 Round 1 – Coding + System Design Discussion

We started with introductions, and then the interviewer jumped straight into a problem:

Interview Questions (1)

1.

Loyal Customers Identification

Data Structures & Algorithms

Let’s say we have a website and we keep track of what pages customers are viewing, for things like business metrics. Every time somebody comes to the website, we write a record to a log file consisting of Timestamp, PageId, CustomerId. At the end of the day we have a big log file with many entries in that format. And for every day we have a new file.

Every visit generates a log entry:

Timestamp, PageId, CustomerId

Each day generates a separate log file.

πŸ“‚ File 1 (Day 1 – 2025-08-22)

timestamp    pageid    customerid
2025-08-22     p1         c1
2025-08-22     p2         c2
2025-08-22     p3         c1
2025-08-22     p1         c1
2025-08-22     p2         c2

πŸ“‚ File 2 (Day 2 – 2025-08-21)

timestamp    pageid    customerid
2025-08-21     p1         c1
2025-08-21     p2         c2
2025-08-21     p2         c1
2025-08-21     p1         c1
2025-08-21     p2         c2

🎯 Goal

Generate a list of β€œLoyal Customers” who:

1️⃣ Came on both days 2️⃣ Visited at least 2 unique pages

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!