# Tag Archives: Flipkart

## Flipkart SDE Interview Experience | Set 45 (On Campus)

Round 1: Online coding test (90 mins) 3 questions, 90 mins on Hackerrank platform. Questions 1 :  Find the number of connected components in a… Read More »

## Flipkart Interview Experience | Set 44 (On-campus for SDE-1)

Round 1: Coding Round – 90 minutes – Hackerrank Problem 1 : Given an array of N integers. Find number of sub-arrays with M number of odd integers.… Read More »

## Minimum number of increment-other operations to make all array elements equal.

We are given an array consisting of n elements. At each operation you can select any one element and increase rest of n-1 elements by… Read More »

## Flipkart SDE Interview Experience | Set 43 (On-campus for Internship)

Recently Flipkart came to my college for SDE interns. GeeksForGeeks helped me a lot in preparing for the coding tests as well as for interviews.… Read More »

## Merge two sorted lists (in-place)

Given two sorted lists, merge them so as to produce a combined sorted list (without using extra space). Examples: Input : head1: 5->7->9 head2: 4->6->8… Read More »

## Flipkart Interview Experience | Set 42 (On Campus for SDE 1)

Round 1: Online Coding Round There were 3 questions and 90 minutes. 1. Question was based on union find algorithm (all test cases passed only… Read More »

## Connect Nodes at same Level (Level Order Traversal)

Write a function to connect all the adjacent nodes at the same level in a binary tree. Example: Input Tree A / \ B C… Read More »

## Queue based approach for first non-repeating character in a stream

Given a stream of characters and we have to find first non repeating character each time a character is inserted to the stream. Examples: Input… Read More »

## Union and Intersection of two linked lists | Set-3 (Hashing)

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »

## Union and Intersection of two linked lists | Set-2 (Using Merge Sort)

Given two Linked Lists, create union and intersection lists that contain union and intersection of the elements present in the given lists. Order of elements… Read More »

## K-th Element of Two Sorted Arrays

Given two sorted arrays of size m and n respectively, you are tasked with finding the element that would be at the k’th position of… Read More »

## Multiply Large Numbers represented as Strings

Given two numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find product of… Read More »

## Sum of dependencies in a graph

Given a directed and connected graph with n nodes. If there is an edge from u to v then u depends on v. Our task… Read More »

## Gold Mine Problem

Given a gold mine of n*m dimensions. Each field in this mine contains a positive integer which is the amount of gold in tons. Initially… Read More »

## Print a Binary Tree in Vertical Order | Set 3 (Using Level Order Traversal)

Given a binary tree, print it vertically. The following example illustrates vertical order traversal. 1 / \ 2 3 / \ / \ 4 5… Read More »