peoplestrong logo
Peoplestrong· SDE-2

SDE-2 Interview Experience at PeopleStrong

Experience
3 years
Posted
10 Jan 2026
307 reads

Summary

I had an interview today for an SDE-2 role (~3 YOE) at PeopleStrong. The interview focused on DSA questions (including a Binary Tree problem), SQL queries, Java basics, Microservices concepts, and an in-depth discussion of my current projects, particularly Kafka and Redis. Unfortunately, I was rejected as I could not provide an optimized solution for one of the DSA problems.

How it went

Had my interview today for a SDE-2 role (~3 YOE) at PeopleStrong

Interview covered:

  • 2 DSA questions (LeetCode medium – Array/Prefix sum + deque & Binary Tree level of minimum sum of subtree)
  • 1 SQL query (Related to JOIN & Inner query )
  • Java basics (HashMap internals, Java 8, CompletableFuture , concurrency and multi threading )
  • Microservices concepts
  • Deep dive into current project

Project discussion (very detailed):

  • Kafka: producer-consumer flow, partitions, consumer groups, offset management, fault tolerance, broker failure scenarios
  • Redis: internal working, data structures, eviction strategies (LRU/LFU), cache consistency, Redis failure handling
  • Fault tolerance: retries, idempotency, handling duplicate events

Verdict: ❌ Rejected (Not able to give optimise solution of second problem.)

Takeaway: DSA + deep understanding of your own project (Kafka & Redis) is critical, even for backend-focused roles.

Hope this helps. All the best! 🚀

Questions asked (1)

  1. 01

    Binary Tree Level of Minimum Sum Subtree

    Data Structures & Algorithms · Medium

    Find the level of the subtree with the minimum sum in a Binary Tree.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Peoplestrong recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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