# Tag Archives: Quikr

Efficient approach: If we are allowed to buy and sell only once, then we can use following algorithm. Maximum difference between two elements. Here we… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling… Read More
The cost of a stock on each day is given in an array, find the max profit that you can make by buying and selling… Read More
Given two sorted arrays A[] and B[] of sizes N and M respectively, the task is to merge them in a sorted manner. Examples: Input:… Read More
Round 1: They had conducted a written round.It consisted of 3 questions(1-1.5 hr time was given). 1.Print spiral view of the binary tree.(It was mentioned to… Read More
Round 1:Written round(1hr) There was a written round of around 1hr. They gave 2coding questions and we had to write it on the paper. Around… Read More
There were 2 f2f Round and one Assignment and 1 more F2F Round. All rounds were Technical. Round 1: Q1. Find is there any Repeated/Duplicate… Read More