Flipkart

Role: SDE-1 / Intern

College: Not Specified (On-Campus)

Interview Date: Not Specified (Experience posted on 2025-07-23)

Interview Type: On-Campus

Result: Selected

Difficulty: Medium (Online Coding, Technical), Conversational (Hiring Manager)

Rounds: 3 rounds (Online Coding Test, Technical Round f2f, Hiring Manager)

Topics Asked: Ad-hoc array manipulation, Recursion with memoization (coconuts problem), String manipulation (reverse vowels), Data Structures (sorting, heaps for nearest k sellers), Matrix DP, Trees, Linked List, Projects, Internship, Behavioral questions.

Experience:

Flipkart visited the campus for SDE and internship hiring.

Round 1: Online Coding Test (HackerRank, 90 minutes). Two questions were asked: a. Given an array and an integer `b`, traverse the array, and if an element equals `b`, double `b` and continue. Return the final value of `b`. (Ad-hoc approach, need to handle `long long` for `b`). b. Given `k, n, m` related to coconuts, stress levels, and shops, calculate the maximum possible mood changes (stressed to normal or vice-versa). (Recursion with memoization used).

Round 2: Technical Round f2f (45 minutes). Two questions were asked: a. Given a string, reverse the sequence of vowels in each word. (e.g., "I work for flipkart" -> "I work for flapkirt"). Full functional code and time complexity were expected. b. Given coordinates of a Flipkart fulfillment center and `n` sellers, find the nearest `k` sellers. The candidate suggested sorting, then heaps, and discussed time complexity. The interviewer challenged the heap build complexity (nlogn vs n), but it was a confidence check. The interviewer was polite. This round also involved topics like matrix DP, trees, and linked lists.

Round 3: Hiring Manager (1.5 hours). This was a conversational round about projects, college life, internship experiences, favorite/worst subjects, interest in Flipkart, role models, etc.