All Medium Articles

## GATE | GATE-CS-2006 | Question 54 3.6

Given two arrays of numbers a1, a2, a3,…an and b1, b2, .. bn where each number is 0 or 1, the fastest algorithm to find… Read More »

## Oracle Interview | Set 7 3.5

On line test consist of 4 sections analytical, quant, computer science and English. Coding on paper(45 min): Based on scores they shortlisted for ST, APPS… Read More »

## Amazon Interview | Set 123 (On-Campus for Internship) 3

Online round: In this round there were 20 MCQ’s to solve and 2 coding question. Of the 20MCQ’s a couple of questions were on Quantitative… Read More »

## Flipkart Interview | Set 13 3

Hi, I was interviewed at Flipkart few days back. I was contacted by one of their head hunters. The process was as follows : 2… Read More »

## Amazon Interview | Set 122 (On-Campus for Internship) 3.5

My interview comprised of 3 rounds. 1 Online and 2 face to face rounds. Online Round In this round there were 20 MCQ’s to solve… Read More »

## Expedia Interview | Set 3 (On Campus Full Term) 3

Lately, I had an on campus interview with Expedia. Here are the details of the company’s written and interview process. Round 1 (Written, Computer Center)… Read More »

## Find the number of valid parentheses expressions of given length 3.2

Given a number n find the number of valid parentheses expressions of that length. Examples : Input: 2 Output: 1 There is only possible valid… Read More »

## Amazon Interview | Set 119 (On-Campus for Internship) 3

The selection procedure consisted of an online round followed by two Personal Interviews. Online Round: The first round had 20 mcq consisting of 3-4 questions… Read More »

## Rearrange array in alternating positive & negative items with O(1) extra space | Set 1 3.7

Given an array of positive and negative numbers, arrange them in an alternate fashion such that every positive number is followed by negative and vice-versa… Read More »

## Longest Monotonically Increasing Subsequence Size (N log N): Simple implementation 3.2

Given an array of random numbers, find longest monotonically increasing subsequence (LIS) in the array. If you want to understand the O(NlogN) approach, it’s explained… Read More »

## Morgan Stanley Interview | Set 11 (On-Campus) 3

Multiple Choice Questions Questions ranging from give the output of following C program to some theoretical concepts of OS etc. Coding 1. Give maximum subarray… Read More »

## Connect n ropes with minimum cost 3

There are given n ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal… Read More »

## Nagarro Interview Experience | Set 1 (On-Campus) 3.6

Nagarro software company visited our campus. I am writing this so that it might hep others around 290 students appeard for this. Round 1: written… Read More »

## Generate all binary permutations such that there are more or equal 1’s than 0’s before every point in all permutations 3.5

Generate all permutations of given length such that every permutation has more or equal 1’s than 0’s in all prefixes of the permutation. Examples: Input:… Read More »

## Goldman Sachs Interview | Set 4 (On-Campus for Internship) 3.5

Goldman Sachs visited our campus for both full placement(NAPA) and internship. I am going to share my experience for internship. ROUND 1: There were in… Read More »

## Data Structure for Dictionary and Spell Checker? 3.8

Which data structure can be used for efficiently building a word dictionary and Spell Checker? The answer depends upon the functionalists required in Spell Checker… Read More »

## Amazon Interview | Set 117 (On-Campus for Internship) 3.6

Recently Amazon India visited our campus for 2 months internship. There were four rounds. 2 online coding questions + 20 MCQ : MCQs had 15… Read More »

## Amazon Interview | Set 115 (On-Campus) 3

Hai, recently amazon visited our campus for recruitment. Here is my amazon experience. 1000 people attend round 1 Round 1: (1.30 hrs) 20 MCQ’s +… Read More »

## Sort an array according to the order defined by another array 3.4

Given two arrays A1[] and A2[], sort A1 in such a way that the relative order among the elements will be same as those are… Read More »

## Microsoft Interview | Set 32 (On-Campus for Internship) 3

Recently Microsoft conducted an on-campus interview at my college. It consisted of 5 rounds which were all on-campus. They were as follows: Round 1(online)(30 minutes):… Read More »