Skip to content
All Hard Articles
First round 1) Given set of coins of different denominations like 1$(100), 5$(50) ..etc, and given an amount, I was asked to come up with… Read More
I went through the Amazon interview process for SDE-1, I didn’t make it past the 3rd F2F round. Online Round: 1. Find if a given… Read More
My experience for Amazon’s Software Development Engineer-2 1st Round (Face-to-Face) 1. Design ATM 2. Design Car Service center —- Deep dive into design and focus… Read More
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is (A)… Read More
I am sharing my off campus SDE interview experience with Amazon. Online round: (1hr) Given coin array and a sum K, find min. number of… Read More
Recently I appeared for Flipkart Interview. I would like to share my experience. Round-1: Telephonic (45 mins) Given an array of n distinct integers sorted… Read More
#include <stdio.h> int main() {     int a[][3] = {1, 2, 3, 4, 5, 6};     int (*ptr)[3] = a;     printf("%d %d ", (*ptr)[1], (*ptr)[2]);     ++ptr;     printf("%d… Read More
Consider the following relational schema: Suppliers(sid:integer, sname:string, city:string, street:string) Parts(pid:integer, pname:string, color:string) Catalog(sid:integer, pid:integer, cost:real) Assume that, in the suppliers relation above, each supplier and… Read More
Let L = L1∩L2, where L1 and L2 are languages as defined below: L1 = { | m, n >= 0 } L2 = { | i,… Read More
Given digits 2, 2, 3, 3, 3, 4, 4, 4, 4 how many distinct 4 digit numbers greater than 3000 can be formed? (A) 50… Read More
Consider the data from above question. When there is a miss in both L1 cache and L2 cache, first a block is transferred from main… Read More
The following program consists of 3 concurrent processes and 3 binary semaphores.The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.… Read More
Round 1 : Technical Interview Question 1: Given a sorted doubly link list and two numbers C and K. You need to decrease the info… Read More
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean… Read More
What is the value of Limn->∞(1-1/n)2n ? (A) 0 (B) e-2 (C) e-1/2 (D) 1 Answer: (B) Explanation: The value of e (mathematical constant) can be… Read More
Consider the same recursive C function that takes two arguments unsigned int foo(unsigned int n, unsigned int r) {   if (n  > 0) return (n%r… Read More
(A) K4 is planar while Q3 is not (B) Both K4 and Q3 are planar (C) Q3 is planar while K4 is not (D) Neither… Read More
final class Complex {        private final double re;     private final double im;        public Complex(double re, double im) { = re; =… Read More
Predict the output of following Java Program // filename class Grandparent {     public void Print() {         System.out.println("Grandparent's Print()");     } }     class Parent extends… Read More
Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4… Read More