All Hard Articles

## Amazon Interview | Set 71 (For SDE-2) 4

Recruitment Drive – Delhi (22 March 2014) Position SDE-2 1st Round – Coding and Algo (50 Minutes) 1. Find In order predecessor in BST. 2.… Read More »

## Interval Tree 4.2

Consider a situation where we have a set of intervals and we need following operations to be implemented efficiently. 1) Add an interval 2) Remove… Read More »

## Amazon Interview | Set 69 (For SDE-1) 4

Online Coding Round: Find if a given string contains duplicates Given a BST, find the maximum N elements of the tree Given a BST, convert… Read More »

## Check if a number is multiple of 9 using bitwise operators 4.3

Given a number n, write a function that returns true if n is divisible by 9, else false. The most simple way to check for… Read More »

## Rearrange an array so that arr[i] becomes arr[arr[i]] with O(1) extra space 4.2

Given an array arr[] of size n where every element is in range from 0 to n-1. Rearrange the given array so that arr[i] becomes… Read More »

## GATE | GATE-CS-2007 | Question 80 4

Consider a machine with a byte addressable main memory of 216 bytes. Assume that a direct mapped data cache consisting of 32 lines of 64… Read More »

## GATE | GATE-CS-2007 | Question 74 4.3

Consider the following Finite State Automaton. The language accepted by this automaton is given by the regular expression   (A) A (B) B (C) C… Read More »

## GATE | GATE-CS-2007 | Question 27 4

(A) A (B) B (C) C (D) D Answer: (A) Explanation: To be basis of subspace x, 2 conditions are to be fulfilled 1) They… Read More »

## GATE | GATE-CS-2007 | Question 26 4

(A) A (B) B (C) C (D) D Answer: (C) Explanation: A partition is said to refine another partition if it splits the sets in… Read More »

## Myntra Interview | Set 1 4.7

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 »

## Amazon Interview | Set 68 (For SDE-1) 4

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 »

## Amazon Interview | Set 65 (Off-Campus for SDE-2) 4

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 »

## GATE | GATE CS 2008 | Question 40 4

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 »

## Amazon Interview | Set 64 (Off-Campus for SDE) 4

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 »

## Flipkart Interview | Set 3 4

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 »

## C | Advanced Pointer | Question 8 4.4

filter_none edit close play_arrow link brightness_4 code #include <stdio.h> int main() {     int a[][3] = {1, 2, 3, 4, 5, 6};     int (*ptr)[3] = a;… Read More »

## GATE | GATE-CS-2009 | Question 56 4

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 »

## GATE | GATE-CS-2009 | Question 60 4

Let L = L1∩L2, where L1 and L2 are languages as defined below: L1 = { | m, n >= 0 } L2 = { | i,… Read More »

## Java | Arrays | Question 3 4

filter_none edit close play_arrow link brightness_4 code class Test {    public static void main(String args[]) {      int arr[2];        System.out.println(arr[0]);      System.out.println(arr[1]);    } } chevron_right filter_none (A)… Read More »

## GATE | GATE CS 2010 | Question 65 4

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 »