Flipkart Software Development Engineer 2 Interview Experience
Software Development Engineer 2
Summary
AI Powered
The Flipkart interview process comprised five rigorous rounds spanning an Online Assessment, on-site Machine Coding, Low-Level Design review, Data Structures & Algorithms, and a System Design combined with a Hiring Manager round. Across these rounds, the evaluation covered algorithmic problem solving including Trie and Graph topics, an end-to-end in-memory Buy Now Pay Later design, deep dive into microservices patterns, and behavioral competencies. The overall difficulty was medium to hard, reflecting a thorough assessment of practical coding, design architecture, and problem-solving skills.
1
2
Design and implement a Buy Now Pay Later (BNPL) system for Flipkart. The solution should be purely in-memory (no database required) and runnable/demonstrable via a driver/main program.
Required capabilities:
- **seed_inventory and view_inventory**: Load products (name, count, price) and display current inventory stock.
- **register_user**: Register a user with an assigned initial BNPL credit limit.
- **buy(user, items, payment_method, date)**: Support payment methods `PREPAID` or `BNPL`. Prevent BNPL transactions once credit limits are exhausted.
- **clear_dues(user, orderIds, date)**: Support partial or full clearance of pending balances mapped to specific orders.
- **view_dues(user, date)**: Display pending dues prior to the provided date, sorted by purchase date, marked as `PENDING` or `DELAYED` (if older than 30 days).
- **order_status(user)**: Output complete order history along with remaining BNPL credit limit.
- **Bonus**: Implement logic to blacklist users defaulting on 3 or more orders, alongside dynamic `add_inventory` and `remove_inventory` functionality.
Design and implement a Buy Now Pay Later (BNPL) system for Flipkart. The solution should be purely in-memory (no database required) and runnable/demonstrable via a driver/main program.
Required capabilities:
- **seed_inventory and view_inventory**: Load products (name, count, price) and display current inventory stock.
- **register_user**: Register a user with an assigned initial BNPL credit limit.
- **buy(user, items, payment_method, date)**: Support payment methods `PREPAID` or `BNPL`. Prevent BNPL transactions once credit limits are exhausted.
- **clear_dues(user, orderIds, date)**: Support partial or full clearance of pending balances mapped to specific orders.
- **view_dues(user, date)**: Display pending dues prior to the provided date, sorted by purchase date, marked as `PENDING` or `DELAYED` (if older than 30 days).
- **order_status(user)**: Output complete order history along with remaining BNPL credit limit.
- **Bonus**: Implement logic to blacklist users defaulting on 3 or more orders, alongside dynamic `add_inventory` and `remove_inventory` functionality.
Machine Coding
LLD
OOP
In-Memory System
Hard
3
Review and extend the Machine Coding solution implemented in Round 2:
- Conduct a code walkthrough and live demo highlighting service classes, layering, design patterns, and exception handling.
- Execute edge-case testing on live running code without throwing unhandled exceptions.
- Implement additional strategies live and accommodate newly introduced requirements.
- Sketch a UML class diagram detailing core classes, relationships, and design patterns utilized.
Review and extend the Machine Coding solution implemented in Round 2:
- Conduct a code walkthrough and live demo highlighting service classes, layering, design patterns, and exception handling.
- Execute edge-case testing on live running code without throwing unhandled exceptions.
- Implement additional strategies live and accommodate newly introduced requirements.
- Sketch a UML class diagram detailing core classes, relationships, and design patterns utilized.
Code Review
Design Patterns
LLD
UML
Hard
4
Solve a variant of the House Robber IV problem (analogous to LeetCode 2560), framed in the context of server maintenance.
Solve a variant of the House Robber IV problem (analogous to LeetCode 2560), framed in the context of server maintenance.
Dynamic Programming
Algorithms
Binary Search
Medium
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values (i.e., from left to right, then right to left for the next level and alternate between). (LeetCode 103)
Given the root of a binary tree, return the zigzag level order traversal of its nodes' values (i.e., from left to right, then right to left for the next level and alternate between). (LeetCode 103)
Binary Tree
Tree Traversal
BFS
Medium
5
Design an end-to-end system encompassing:
- Candidate-led requirement gathering (functional and non-functional requirements).
- Definition of entities, DB schema, relationships, constraints, and cardinality with justifications.
- Detailed API design including request and response schemas for all core endpoints.
- High-level architecture and inter-service communication.
- In-depth discussion of microservice patterns including Circuit Breaker, Saga, CQRS, and Event-Driven architecture.
Design an end-to-end system encompassing:
- Candidate-led requirement gathering (functional and non-functional requirements).
- Definition of entities, DB schema, relationships, constraints, and cardinality with justifications.
- Detailed API design including request and response schemas for all core endpoints.
- High-level architecture and inter-service communication.
- In-depth discussion of microservice patterns including Circuit Breaker, Saga, CQRS, and Event-Driven architecture.
Database Design
System Design
Microservices
HLD
Hard
A
Anonymous
Anonymous User
⌘/Ctrl+D
Bookmark for later