All Medium Articles

## Amazon Interview Experience | Set 161 (Off Campus for SDE-1, Bangalore) 3.9

Off campus- Delhi drive (SDE-1 Bangalore) 1st round: f2f Tell me about yourself. Most challenging task. Extract Leaves of a Binary Tree in a Doubly… Read More »

## Print all possible strings that can be made by placing spaces 3.3

Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. Input: str[]… Read More »

## Find the closest leaf in a Binary Tree 3.9

Given a Binary Tree and a key ‘k’, find distance of the closest leaf from ‘k’. Examples: A / \ B C / \ E… Read More »

## Nuts & Bolts Problem (Lock & Key problem) | Set 1 3.7

Given a set of n nuts of different sizes and n bolts of different sizes. There is a one-one mapping between nuts and bolts. Match… Read More »

## Longest Even Length Substring such that Sum of First and Second Half is same 3.5

Given a string ‘str’ of digits, find the length of the longest substring of ‘str’, such that the length of the substring is 2k digits… Read More »

## Diagonal Sum of a Binary Tree 3

Consider lines of slope -1 passing between nodes (dotted lines in below diagram). Diagonal sum in a binary tree is sum of all node’s data… Read More »

## How to Implement Forward DNS Look Up Cache? 3.3

We have discussed implementation of Reverse DNS Look Up Cache. Forward DNS look up is getting IP address for a given domain name typed in… Read More »

## Bottom View of a Binary Tree 3.3

Given a Binary Tree, we need to print the bottom view from left to right. A node x is there in output if x is… Read More »

## Citrix R&D Interview Experience | Set 3 (On-Campus) 3.5

Written Tests:- There was a 1 hr aptitude test & 1 hour coding round. The aptitude test had simple questions on c/cpp, Networking, OS etc.… Read More »

## Qubole Interview Experience 3.5

Here’s my experience of Qubole interview. Input: Was csv files of fb users data. Questions for above Input: 1. Parse the data and build a… Read More »

## Prop Tiger Interview Experience 3.3

Written: Question 1. Suppose u have given a string like 123456342184321 and second string like 1234. Find all permutations of second string (1234) in first… Read More »

## Binary Indexed Tree or Fenwick Tree 3.4

Let us consider the following problem to understand Binary Indexed Tree. We have an array arr[0 . . . n-1]. We would like to 1… Read More »

## Given n appointments, find all conflicting appointments 3.7

Given n appointments, find all conflicting appointments. Examples: Input: appointments[] = { {1, 5} {3, 7}, {2, 6}, {10, 15}, {5, 6}, {4, 100}} Output:… Read More »

## LinkedIn Interview Experience | Set 3 (On-Campus) 3

LinkedIn Interview Experience (On Campus – Day 1) Online Round : 3 coding Questions in 1 hour : 1. We have to implement int getIntComplement(int… Read More »

How many people must be there in a room to make the probability 100% that at-least two people in the room have same birthday? Answer:… Read More »

## InMobi Interview Experience | Set 2 (On-Campus) 3

InMobi visited our campus twice, once for the written round, then for the personal interviews of the shortlisted candidates. So here is the written +… Read More »

## GATE | GATE-CS-2001 | Question 33 3

Consider the following circuit with initial state Q0 = Q1 = 0. The D Flip-flops are positive edged triggered and have set up times 20… Read More »

## Nvidia Interview | Set 3 (On Campus) 3

I had a campus interview of Nvidia Software profile for their infrastructure team at Bangalore and here is my experience. Written Test 15 questions on… Read More »

## GATE | GATE-CS-2001 | Question 24 3

Suppose the adjacency relation of vertices in a graph is represented in a table Adj(X,Y). Which of the following queries cannot be expressed by a… Read More »

## Goldman Sachs Interview Experience | Set 6 3

Hi, I recently interviewed with Goldman Sachs, and had 4 rounds of interview with them at their campus in Bangalore. Round 1 : Technical –… Read More »