Skip to content

Tag Archives: Flipkart

Online Coding round Find all the Node at the distance K from a given node in a Binary tree. Print them in any order. Design… Read More
Online Round: Don’t remember the questions, but they were of medium level, not tough as such. Basic knowledge will help you in clearing that round… Read More
Before the advent of QWERTY keyboards, texts and numbers were placed on the same key. For example, 2 has “ABC” if we wanted to write… Read More
Given a binary tree, print it vertically. The following example illustrates the vertical order traversal. 1 / \ 2 3 / \ / \ 4… Read More
I recently attended Flipkart interviews(off-campus). I would like to share my experience with everyone. Round 1 : Telephonic Interview Print the left view of a… Read More
  Given a binary tree, a target node in the binary tree, and an integer value k, print all the nodes that are at distance… Read More
Given a binary tree, print it vertically. The following example illustrates vertical order traversal.   1 / \ 2 3 / \ / \ 4 5… Read More
Company: Flipkart Profile: SDE 1 Experience: 7 months Round 1: Online Coding Exam (2 hour on interviewstreet) (Need to pass 4 test cases + if… Read More
Recently I appeared for Flipkart Interview. I would like to share my experience.    Round-1: Telephonic (45 mins)  Given an array of n distinct integers… Read More
Hi, I had Flipkart interviews for SDE 1. I would like to share my experience. Online Coding Round (1 hour 30 minutes): On interviewstreet, there… Read More
Hi, I have interviewed for Flipkart SDE 2 role 2 months back. I want to share interview experience with other geeks. Telephonic Interview (45 minutes)… Read More
Given an undirected graph, how to check if there is a cycle in the graph? Example,  Input: n = 4, e = 4 Output: Yes Explanation: 0 1, 1… Read More
Given a stream of characters, find the first non-repeating character from stream. You need to tell the first non-repeating character in O(1) time at any… Read More
Given a Binary Tree, print left view of it. Left view of a Binary Tree is set of nodes visible when tree is visited from… Read More
Given k sorted arrays of size n each, merge them and print the sorted output. Example:  Input: k = 3, n = 4 arr[][] = { {1,… Read More