All Hard Articles

Snapdeal Interview Experience | Set 4 (On Campus)

Hi, Recently Snapdeal visited my campus and I got an offer from Snapdeal,here is my interview experience: Round 1: First round was online written round.It… Read More

Snapdeal

Experiences

Interview Experiences

Optimal read list for given number of days

A person is determined to finish the book in ‘k’ days but he never wants to stop a chapter in between. Find the optimal assignment… Read More

DSA

Graph

Intuit Interview Experience | Set 7 (For 3.5 Years Experienced)

1st Round : (2 hrs) 1. Implement LRU Cache, 2. Implement your own Blocking Queue. 3. Questions on Collections , a. How AtomicInteger works b.… Read More

Intuit

STL

Arrays

DSA

Experienced

Experiences

Hash

Heap

Interview Experiences

Queue

Sorting

Find if a given string can be represented from a substring by iterating the substring “n” times

Given a string ‘str’, check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. Examples: … Read More

Amazon

MakeMyTrip

DSA

Strings

Suffix Tree Application 6 – Longest Palindromic Substring

Given a string, find the longest substring which is palindrome.We have already discussed Naïve [O(n3)], quadratic [O(n2)] and linear [O(n)] approaches in Set 1, Set… Read More

palindrome

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Amazon Interview Experience | Set 162

Round 1: Q-1: Word Break Problem Round 2: Q-1: Search an element in a sorted and rotated array Q-2: Given a string of 0s and… Read More

Amazon

Experiences

Interview Experiences

Adobe Interview Experience | Set 19 (For MTS)

Written round: Same test every-time. 1st round: He asked me to write code for hello world in C. Then he asked where this printf is… Read More

Adobe

Experiences

Interview Experiences

Biconnected Components

A biconnected component is a maximal biconnected subgraph. Biconnected Graph is already discussed here. In this article, we will see how to find biconnected component… Read More

graph-connectivity

DSA

Graph

Given a matrix of ‘O’ and ‘X’, find the largest subsquare surrounded by ‘X’

Given a matrix where every element is either ‘O’ or ‘X’, find the largest subsquare surrounded by ‘X’. In the below article, it is assumed that… Read More

D-E-Shaw

DSA

Matrix

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 4

In Manacher’s Algorithm Part 1 and Part 2, we gone through some of the basics, understood LPS length array and how to calculate it efficiently… Read More

palindrome

DSA

Pattern Searching

Strings

Amazon Interview Experience | Set 160 (For SDE 2)

Amazon sde2 experience: Telephonic round : Design a site similar to junglee.com. Assume you are given a crawler, design a distributed system , what ds… Read More

Amazon

Experiences

Interview Experiences

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 3

In Manacher’s Algorithm Part 1 and Part 2, we gone through some of the basics, understood LPS length array and how to calculate it efficiently… Read More

palindrome

DSA

Pattern Searching

Strings

GATE | GATE-CS-2000 | Question 49

Given the following expression grammar: E -> E * F | F + E | F F -> F - F | id which of… Read More

GATE-CS-2000

GATE-GATE-CS-2000

GATE

GATE | GATE-CS-2000 | Question 37

Consider the values A = 2.0 x 1030, B =-2.0 x 1030, C= 1.0, and the sequence X: = A + B Y: = A… Read More

GATE-CS-2000

GATE-GATE-CS-2000

GATE

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 2

In Manacher’s Algorithm – Part 1, we gone through some of the basics and LPS length array. Here we will see how to calculate LPS… Read More

palindrome

DSA

Pattern Searching

Strings

Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Part 1

Given a string, find the longest substring which is palindrome. if the given string is “forgeeksskeegfor”, the output should be “geeksskeeg” if the given string… Read More

Microsoft

palindrome

Arrays

DSA

Pattern Searching

Strings

UHG(United Health Group) Interview Experience

UHG (United Health Group) came to our campus for software developer profile. Written Aptitude Round: 60 min Contained basic logic based questions. 30 problems. Difficulty… Read More

United Health Group

Experiences

Interview Experiences

GATE | GATE-CS-2000 | Question 13

The most appropriate matching for the following pairs X: depth first search 1: heap Y: breadth-first search 2: queue Z: sorting 3: stack is (A)… Read More

GATE-CS-2000

GATE-GATE-CS-2000

GATE

GATE | GATE-CS-2000 | Question 2

An n x n array v is defined as follows: v[i, j] = i-j for all i, j, 1 <= i <= n, 1 <=… Read More

GATE-CS-2000

GATE-GATE-CS-2000

GATE

Amazon Interview Experience | Set 158 (Off-Campus)

Recently I appeared in for off-campus Amazon Interviews for SDE position and here is my experience. Round 1: 1 hour written test Q1. Given a… Read More

Amazon

Experiences

Interview Experiences