All Hard Articles
Flipkart Interview Experience | Set 30 (For SDE 2)
Machine Coding Round: (1 hour) —————————————– Implement a finite state machine. – The machine should have one start state and can have multiple end states – It should be… Read More
Flipkart
Experiences
Interview Experiences
Microsoft Interview Experience | Set 56 (For SDE 2)
First Round (F2F) 1 hour: ———————————- 1. Given an image with a lot of pixels, find all the pairs of pixels that are strongly connected.… Read More
Microsoft
Experiences
Interview Experiences
Compute sum of digits in all numbers from 1 to n
Given a number n, find the sum of digits in all numbers from 1 to n.  Examples:  Input: n = 5Output: Sum of digits in… Read More
number-digits
Arrays
DSA
Dynamic Programming
Mathematical
Amazon Interview Experience | 191
1st round (data structures and algorithm) 1) Ladder of n steps is given.Find the number number of ways to reach the end point.I can take… Read More
Amazon
Experiences
Interview Experiences
Microsoft Interview Experience | Set 53
Round 0 – Second max element in BST Sort an array of integers such that – – All odd numbers are in left side and… Read More
Microsoft
DSA
Dynamic Programming
Experiences
Interview Experiences
Steiner Tree Problem
What is Steiner Tree?  The Steiner Tree Problem is known to be NP-hard, which means that it is unlikely that there is an efficient algorithm… Read More
MST
DSA
Graph
Print all distinct permutations of a given string with duplicates
Given a string that may contain duplicates, write a function to print all permutations of given string such that no permutation is repeated in output.Examples: … Read More
permutation
Combinatorial
DSA
Mathematical
Introduction and implementation of Karger’s algorithm for Minimum Cut
Given an undirected and unweighted graph, find the smallest cut (smallest number of edges that disconnects the graph into two components). The input graph may have… Read More
graph-connectivity
DSA
Graph
Randomized
Boruvka’s algorithm | Greedy Algo-9
We have discussed the following topics on Minimum Spanning Tree.Applications of Minimum Spanning Tree Problem Kruskal’s Minimum Spanning Tree Algorithm Prim’s Minimum Spanning Tree AlgorithmIn this post,… Read More
MST
DSA
Graph
Greedy
Puzzle 20 | (5 Pirates and 100 Gold Coins)
There are 5 pirates, they must decide how to distribute 100 gold coins among them. The pirates have seniority levels, the senior-most is A, then… Read More
Logical Puzzles
Puzzles
Online algorithm for checking palindrome in a stream
Given a stream of characters (characters are received one by one), write a function that prints ‘Yes’ if a character makes the complete string palindrome,… Read More
array-stream
palindrome
DSA
Pattern Searching
Strings
Google Interview Experience | Set 5 (for Java Position)
The solution will be evaluated on following parameters.       Object Oriented Design aspects of the solution.       Overall coding practices.       Working test cases of… Read More
Google
Experiences
Interview Experiences
Iterative Tower of Hanoi
The Tower of Hanoi is a mathematical puzzle. It consists of three poles and a number of disks of different sizes which can slide onto… Read More
Divide and Conquer
DSA
Stack
Inmobi Interview Experience | Set 3
I had an interview with Inmobi. Their process is written test followed by 3/4 f2f interviews. It was a drive over weekend. Written test: They… Read More
InMobi
Experiences
Interview Experiences
Flipkart Interview Experience | Set 23
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
Flipkart
Experiences
Interview Experiences
Amazon Interview Experience | Set 187 (For SDE1)
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
Amazon
Arrays
DSA
Experiences
Interview Experiences
Maximum profit by buying and selling a share at most twice
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
DSA
Dynamic Programming
Mathematical
CouponDunia Interview Experience | Set 4 (Off-Campus for Internship)
I applied of off campus for the internship. Selection consist of five rounds. I cleared all the rounds. Round 1: (Online Coding Test on Hacker… Read More
CouponDunia
Experiences
Internship
Interview Experiences
SAP Labs Interview Experience | Set 7
A brief documentation of my SAP Labs India interview Round 1 : Statement Round We were 5 people and given a problem statement and we… Read More
SAP Labs
Experiences
Interview Experiences
Lenskart Interview Experience for Application Developer
I had recently given Interview at Lenskart.com for Application Developer First Round Telephonic with HR on some basic stuff. Next was the round where i… Read More
Lenskart
Experiences
Interview Experiences
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox