# Flipkart Interview Questions

## Flipkart Interview Questions – Set 6

I had interview with Flipkart for SDE . There was two technical round both guys was cool and interview process was very nice when i got stuck they provide me hint. Round 1: Q1. You have a infinite stream of repeated number find top K frequent number from this stream and discussion on this question Read More →

## Flipkart Interview Questions – Set 5

I recently interviewed for Senior Software Engineer at Flipkart. This is my interview experience. Technical Interview Rounds :- Round 1: Q1. Tell me if binary tree is BST? Q2. Given a stream of integers, give me median at any time. Q3. Given a sorted array, being rotated; Find an element in it. Round 2: Q1. Read More →

## Flipkart Interview Questions – Set 4

Company: Flipkart Technical Interview Questions: Q1. Write code to find sum of two numbers stored as linked list.(LSB at last node) and head of each list is given. Q2. Write code to print elements on the path from root to leaf node having the maximum sum. Q3. What is the complexity of retrieving min element from Read More →

## Flipkart Interview Questions – Set 3

Company : Flipkart I was interviewed for Flipkart SDE 2 role few days back. I want to share interview experience with other geeks. Written Test: It was online coding round on interview street. (1Hr) Technical Rounds: Q1. Check whether given Binary Tree is a Binary Search Tree. Discuss various approaches? Q2. Given a large list Read More →

## Flipkart Interview Questions – Set 2

I have recently appeared for Flipkart Recruitment process for SDE position. I  would like to share interview questions. Flipkart Interview Process :- Telephonic Round : 1 F2F : 3 Rounds Technical Interview Questions :- Q1. A sentence is given which contains lowercase English letters and spaces. It may contain multiple spaces. Get first letter of Read More →

## Flipkart Interview Questions – Set 1

I recently have appeared for flipkart interview process. I would like to share it with crazyforcode and help others. Round 1 Q1. Write a code to check if a tree is BST or not. Q2. Modify this code to find the maximum subtree in tree which is a BST. Maximum subtree means subtree goes upto Read More →