Skip to content
Gblog Must Do Coding Questions for Product Based Companies
As the placement season is back, GeeksforGeeks is here to help you crack the interview. We have selected some most commonly asked and MUST DO… Read More
1st round: Two sets: First set consisted of basic c question (output based) Second set was mcq based on computer science subjects like os,ds etc.… Read More
I recently had flipkart interview on-site, Bangalore. This interview has 4 rounds. Three technical and one manager. Round 1: Machine coding: 1 hour 30 min… Read More
I recently got a call from Akosha Bangalore for on-site interview. This Interview had three round, two technical and one manager round. Round 1: Written… Read More
Hi, Recently i was interviewed for Amazon SDE-1 Position in Hyderabad.There a telephonic round followed by 4 F2F rounds. Telephonic Round: 1. Given a array… Read More
Telephonic Round – 1: 1) Inversion count in an array – 2) Iterative pre order traversal. Telephonic Round – 2: 1) Given an array… Read More
Given singly linked list with every node having an additional “arbitrary” pointer that currently points to NULL. Need to make the “arbitrary” pointer point to… Read More
Given an array of integers, write a function that returns true if there is a triplet (a, b, c) that satisfies a2 + b2 =… Read More
Three questions asked. The test duration was 3 hours and was conducted on hackerearth. 1. Write a sql parser to properly parse queries for a… Read More
Round One: 1. Find Min and Max of an array in only one traversal. 2. Given a chessboard find maximum number of squares present. 3.… Read More
I was interviewed at Flipkart. Following was my interview experience. Initially there was one telephonic screening round. then I was called at their bangalore office.… Read More
In daily share trading, a buyer buys shares in the morning and sells them on the same day. If the trader is allowed to make… Read More
What is Handshaking Lemma? Handshaking lemma is about undirected graph. In every finite undirected graph, an even number of vertices will always have odd degree… Read More
Given a graph with both directed and undirected edges. It is given that the directed edges don’t form cycle. How to assign directions to undirected… Read More
I applied here from their career page and was asked to attend 5 rounds and I cleared all of them and landed into a full… Read More
Given a list of word lists How to print all sentences possible taking one word from a list at a time via recursion? Example:  Input: {{"you",… Read More