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

I was interviewed for windows developer. Round 1 – telephonic About yourself Work done on windows platform What is mvvm What is data binding Difference… Read More

Given a Binary Tree and a key to be searched in it, write an iterative method that returns true if key is present in Binary… Read More

I applied off-campus for internship. I got a call that my resume is shortlisted. Selection procedure consist of 4 rounds. Round 1: Online Coding Round… Read More

An interval is represented as a combination of start time and end time. Given a set of intervals, check if any two intervals intersect. Examples: … Read More

Hi, Recently I was interviewed for the SDE-I for Amazon, Chennai. Round 1(Online Round): 1. Given two linked lists. Add them. e.g 1–>2–>3 3–>4 Output:… Read More

Design a data structure that supports the following operations in Θ(1) time.insert(x): Inserts an item x to the data structure if not already present.remove(x): Removes… Read More