RepostedPeopleStrong logo

PeopleStrong · OA → Phone screen → Onsite

In process

PeopleStrong SDE OA and Interview Questions: 12 Experiences

Software engineer · UnknownOct 2021
Shared byJaneBeingJane

PeopleStrong SDE interviews in 2025–2026 mixed two medium DSA questions per round with Java, Spring, database and backend-architecture questions.

At a glance

  • Process: usually two or three technical rounds of about an hour; the 2026 campus drive opened with a paper coding test (entry 01).
  • Asked recently: medium DSA in all 6 current reports; HashMap internals (2 of 6); ACID (2 of 6); Kafka in the project talk (2 of 6); one BookMyShow low-level design (entry 04).
  • Difficulty: mostly LeetCode medium, with one hard (Word Ladder II, entry 05); an SDE-2 candidate blamed the rejection on not optimizing the second DSA problem (entry 02).
  • Practise first: LRU cache, Sliding Window Maximum and linked-list cycle entry.

Coverage: 12 reports. Current (May 2025–March 2026): 1 campus SDE, 3 experienced candidates with about three years' experience (SDE-2, SDE-1/2, Java developer), and 2 SDE-1 reports with no experience stated. Entries 05 and 06 may be one candidate. History: 6 campus and fresher reports from 2021. India.

Campus SDE (1 current report)

What came up

A paper-based coding test, then two long technical rounds that mixed DSA with Java, Spring, databases and project questions.

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Unique paths in a matrix 1 Mar 2026 (report date)
Swap nodes in "k-pairs" (rules not shared) 1 Mar 2026 (report date)
LRU cache 1 Mar 2026 (report date)
Sliding Window Maximum 1 Mar 2026 (report date)
4Sum 1 Mar 2026 (report date)
Add binary strings 1 Mar 2026 (report date)

Java, backend and database questions

Question Reports Last seen
Demonstrate compile-time polymorphism 1 Mar 2026 (report date)
Spring Boot versus Node.js; Spring's @Transactional 1 Mar 2026 (report date)
JWT structure and lifecycle 1 Mar 2026 (report date)
ACID with real-world applications; SQL versus MongoDB 1 Mar 2026 (report date)
Refactor a snippet that breaks DRY 1 Mar 2026 (report date)
Why this technology stack for your project? 1 Mar 2026 (report date)

01: paper coding, then two 70-minute technicals

Report date: March 25, 2026 · Role: Campus SDE · Campus: HBTU · Result: Not stated

Written assessment (on paper, C++)

  1. Unique paths in a matrix, "swap nodes in k-pairs" (the exact rules were not shared), and five technical MCQs.

Technical 1 (about 70 minutes)

  1. LRU cache: the coding part was waived once the candidate explained the optimal approach and its structure.
  2. Sliding Window Maximum: brute force first, then the optimization, dry runs and follow-ups.
  3. OOP pillars, with compile-time polymorphism written out; ACID with real uses; SOLID; REST; JWT structure and lifecycle; Spring Boot versus Node.js; Spring Security; why the project used its technology stack.
  4. The candidate had not prepared Java multithreading and told the interviewer so.

Technical 2 (about 70 minutes)

  1. Projects, lessons from an internship, and architecture choices.
  2. 4Sum and binary-string addition, each with optimization and dry runs.
  3. Refactor a supplied snippet that broke DRY; Singleton; SOLID; scaling to millions of users; SQL versus MongoDB; deadlocks; @Transactional.

Experienced, about three years (3 current reports)

What came up

All three got DSA plus deep backend questions; two of the three were asked about Kafka (entries 02, 03).

Topic Reports Last seen
Medium DSA coding 3 of 3 Jan 2026
SQL query or Java/Spring questions 3 of 3 Jan 2026
Kafka and messaging 2 of 3 Jan 2026
Multithreading and concurrency 2 of 3 Jan 2026
Low-level design 1 of 3 May 2025 (report date)

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Minimum-sum subtree level 1 Jan 2026
Ceiling by binary search: the key or the next greater value 1 Sep 2025 (report date)
Shortest subarray whose sum equals the target 1 May 2025 (report date)
Number of Provinces 1 May 2025 (report date)
Detect a linked-list cycle 1 May 2025 (report date)
First non-repeating character 1 May 2025 (report date)
Lowest common ancestor in a BST 1 May 2025 (report date)
Longest subarray with a given sum 1 May 2025 (report date)

SQL

Question Reports Last seen
Each company's maximum employee salary 1 Sep 2025 (report date)

Low-Level Design (LLD/OOD)

Question Reports Last seen
Design BookMyShow 1 May 2025 (report date)

Java, backend and behavioral questions

Question Reports Last seen
HashMap internals 1 Jan 2026
Kafka partitions, consumer groups, offsets and broker failure 1 Jan 2026
Redis data structures, eviction and failure handling 1 Jan 2026
A seven-day change arrives Thursday for a Monday release 1 May 2025 (report date)

02: SDE-2: Kafka, Redis and an unoptimized second problem

Interview date: January 10, 2026 · Role: SDE-2 · Experience: about three years · Result: Rejected

Technical rounds

  1. Two medium DSA questions: one built on arrays, prefix sums and a deque, and a binary-tree task about the level with the minimum subtree sum. Neither full prompt was shared.
  2. A SQL query with joins and a nested query.
  3. Java: HashMap internals, Java 8, CompletableFuture, concurrency and multithreading.
  4. The project talk: Kafka producers and consumers, partitions, consumer groups, offsets, broker failures and fault tolerance; Redis data structures, LRU/LFU eviction, consistency and failure handling; retries, idempotency and duplicate events.

The candidate put the rejection down to not optimizing the second DSA problem.


03: a binary-search clarification and an Employee/Company query

Report date: September 20, 2025 · Role: SDE-1/2 · Experience: three years · Result: No feedback after HR follow-ups

Live round

  1. Binary search that returns the key, or else the next greater value in the array, or -1. The candidate first read it as "key or key+1" and adjusted after asking; the interviewer seemed satisfied.
  2. Model Employee and Company entities and query each company's maximum employee salary.
  3. Kafka and multithreading.

The candidate described the interviewer as helpful.


04: Java developer: three rounds and BookMyShow

Report date: May 28, 2025 · Role: Java developer · Experience: 2.9 years · Result: Not stated

Round 1

  1. Java, Spring Boot and SQL.
  2. The shortest subarray whose sum equals the target and Number of Provinces.

Round 2

  1. Detect a linked-list loop, the first character that occurs once, the LCA of p and q in a BST, and the longest subarray with a given sum.

Round 3

  1. Resume discussion and a BookMyShow low-level design.
  2. A release scenario: a mandatory change arrives on Thursday, needs seven days, and the release is set for Monday. What do you do?

SDE-1, experience not stated (2 current reports)

What came up

Both September 2025 reports were shortlisted after a coding-heavy round, and both had HashMap or database internals; they may come from the same candidate.

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Linked-list cycle entry 1 Sep 2025 (report date)
Word Ladder II: all shortest paths 1 Sep 2025 (report date)
Number to words, up to 20 digits 1 Sep 2025 (report date)
Valid Parentheses 1 Sep 2025 (report date)

Java, backend and database questions

Question Reports Last seen
HashMap internals 1 Sep 2025 (report date)
How to monitor a service (host, app, database metrics) 1 Sep 2025 (report date)
Monolith versus microservices; CAP; ACID 1 Sep 2025 (report date)
Reducing API latency; Resilience4j circuit breakers 1 Sep 2025 (report date)
Index types, their tradeoffs and B+ trees; primary versus foreign keys 1 Sep 2025 (report date)
final versus finally; @RestController versus @Controller 1 Sep 2025 (report date)
JWT; authentication versus authorization 1 Sep 2025 (report date)

05: SDE-1: an online second round with three coding problems

Report date: September 16, 2025 · Role: SDE-1 · Result: Shortlisted at that stage

Second round (online)

  1. Cycle detection and the entry node: Floyd's method, then reset one pointer to the head and move both one step at a time until they meet. O(n) time, O(1) space.
  2. Word Ladder II: BFS keeping the minimum-depth parents, then DFS/backtracking to collect every shortest path.
  3. Number to words, up to 20 digits: split into thousand-sized chunks with extended scale names; O(digits) time.
  4. Edge cases discussed: empty and single-node lists, a cycle at the head or middle, no word-ladder path, large dictionaries, revisiting earlier levels, zero and all-zero chunks. Negative numbers and the word "and" were treated as optional.
  5. HashMap: buckets, collisions, load factor, resizing, equals, fail-fast iterators and JDK 8 treeification.
  6. Monitoring: host CPU, memory, disk and network; application latency, errors and requests per second; database connections, slow queries and locks; logs, alerts, Prometheus, Grafana and health checks.

06: Java backend: the first round

Report date: September 11, 2025 · Role: SDE-1, Java backend · Result: Shortlisted at that stage

First round

  1. Self-introduction and a resume walkthrough, with follow-up questions taken from the resume.
  2. Valid Parentheses, with dry runs, test cases and edge cases supplied by the interviewer.
  3. Architecture: monoliths versus microservices, CAP, ACID, reducing API latency, and Resilience4j circuit breakers.
  4. Databases: clustered, nonclustered, covering and composite indexes, their pros and cons, B+ trees; primary versus foreign keys.
  5. Java and backend: final versus finally, JWT, authentication versus authorization, @RestController versus @Controller.

Common questions

How many rounds is the PeopleStrong SDE interview?

Two or three technical rounds in the current reports: two after a paper test for campus (entry 01), three for a Java developer (entry 04).

What DSA questions does PeopleStrong ask?

Mostly LeetCode medium: LRU cache and Sliding Window Maximum (entry 01), linked-list cycles (entries 04, 05), Word Ladder II (entry 05), and subarray-sum problems (entry 04).

Does PeopleStrong ask system design for SDE-2?

The reports show low-level design rather than full system design: BookMyShow for a Java developer (entry 04), and Kafka and Redis failure handling inside the project talk for SDE-2 (entry 02).

History (before 2023)

Six campus and fresher reports from 2021, outside the counts and tables above.

H01: campus SDE-1, selected

Interview date: October 5–6, 2021 · Role: Fresher SDE-1 · Result: Selected

  1. OA (105 minutes): Aggressive Cows, shortest unweighted path, total set bits from 1 to N modulo 10^9 + 7.
  2. Technical 1: reverse word order with space cleanup; reverse complete k-node groups, leaving the short last group; semaphores, virtual memory, normalization, BCNF, ACID.
  3. Technical 2: projects, remove consecutive duplicates, maximum falling-path sum (moves down, down-left or down-right).

H02: campus SDE on Teams

Interview date: October 2021 · Role: Campus SDE · Result: Not stated (two selected overall)

  1. Two-hour OA on arrays, binary search and segment trees; about 16 advanced.
  2. Technical 1: running median and recursive linked-list addition; OOP and data-structure costs.
  3. Technical 2: reverse a stack recursively, character permutations; normalization tradeoffs and SOLID.

H03: associate developer, selected

Interview date: 2021 (report date October 12, 2021) · Role: Associate developer · Result: Selected (15 of 110)

  1. Webcam-monitored OA: bit manipulation, DP and backtracking; solved two of three.
  2. Technical 1 (60 minutes): expression tree and a deletion-score task (take x, earn x, lose every x-1 and x+1); DROP versus TRUNCATE, constructors, abstraction.
  3. Technical 2 (75 minutes): third-largest element in one pass, character permutations, longest palindromic substring; threads and RDBMS storage.

H04: BIT Mesra SDE-1, rejected after technical 2

Interview date: September 2021 · Role: Campus SDE-1 · Result: Rejected

  1. HackerRank OA on strings, linked lists and disjoint sets; all three solved in about 90 minutes.
  2. Technical 1: a project, then longest increasing subsequence, plus OS questions.
  3. Technical 2: unnamed medium graph and sliding-window questions, both answered; the candidate suspected their web-development background hurt.

H05: associate software engineer, internship plus full-time offer

Interview date: September 2021 · Role: Associate software engineer · Result: Offer (one of five)

  1. OA: array/math, graph/DP, and swap array elements in Python only.
  2. Technical 1: count subarrays with sum k, Next Greater Element, DBMS and OS basics.
  3. Technical 2: running median, Push Dominoes, BSTs, indexes, deadlocks, tries, threads.

H06: fresher full-stack OA, rejected

Interview date: August 2, 2021 · Role: Fresher full-stack developer · Result: Rejected

  1. OA (90 minutes): Permutation in String; minimum travel time with traffic lights (junction i turns green every P[i]; road times 2 and 4 with periods [2,3,4] give 7); Rat in a Maze.
  2. JavaScript and jQuery basics, and an Angular version comparison.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

No comments yet — be the first to share what you know.