Skip to content

Tag Archives: Flipkart

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
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
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
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
Given two positive numbers as strings. The numbers may be very large (may not fit in long long int), the task is to find product… Read More
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
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
Given a binary tree, print it vertically. The following example illustrates vertical order traversal.  1 / \ 2 3 / \ / \ 4 5… Read More
Given an array of n integers where each value represents the number of chocolates in a packet. Each packet can have a variable number of… Read More
Given a simple expression tree, consisting of basic binary operators i.e., + , – ,* and / and some integers, evaluate the expression tree. Examples:… Read More
Given a singly linked list, delete the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the linked list… Read More
Question: Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return… Read More
Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v… Read More
Round 1: Machine Coding – 90 mins (You need to code this on the interview site)(Any programming language) Best Selling Price You need to make… Read More
I was interviewed for Software Development Engineering (SDE1) role Flipkart. Round 1: Machine Coding round: (90 minutes) Given a binary tree as a sequence of… Read More

Start Your Coding Journey Now!