All Hard Articles

GATE | GATE-CS-2003 | Question 70

Let G (V, E) be a directed graph with n vertices. A path from vi to vj in G is sequence of vertices (vi, vi+1,… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

GATE | GATE-CS-2003 | Question 67

Let G = (V, E) be an undirected graph with a subgraph G1 = (V1, El). Weights are assigned to edges of G as follows… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

GATE | GATE-CS-2003 | Question 62

In a permutation a1…..an of n distinct integers, an inversion is a pair (ai, aj) such that i < j and ai > aj. What… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

GATE | GATE-CS-2003 | Question 60

A program consists of two modules executed sequentially. Let f1(t) and f2(t) respectively denote the probability density functions of time taken to execute the two… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

GATE | GATE-CS-2003 | Question 90

Consider the ALU shown below. If the operands are in 2’s complement representation, which of the following operations can be performed by suitably setting the… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

Generalized Suffix Tree

In earlier suffix tree articles, we created suffix tree for one string and then we queried that tree for substring check, searching all patterns, longest… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

InfoEdge Interview Experience

Recently I got interviewed by InfoEdge. It was off-Campus drive at Noida. There were 5 rounds: 1 Aptitude (Quants+Technical) 3 Technical rounds 1 HR round… Read More

InfoEdge

Experiences

Interview Experiences

Suffix Tree Application 4 – Build Linear Time Suffix Array

Given a string, build it’s Suffix Array We have already discussed following two ways of building suffix array: Naive O(n2Logn) algorithmEnhanced O(nLogn) algorithm Please go through… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Suffix Tree Application 3 – Longest Repeated Substring

Given a text string, find Longest Repeated Substring in the text. If there are more than one Longest Repeated Substrings, get any one of them. … Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Suffix Tree Application 2 – Searching All Patterns

Given a text string and a pattern string, find all occurrences of the pattern in string. Few pattern searching algorithms (KMP, Rabin-Karp, Naive Algorithm, Finite… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

C Program to Find the closest pair from two sorted arrays

Write a C program for a given two arrays arr1[0…m-1] and arr2[0..n-1], and a number x, the task is to find the pair arr1[i] +… Read More

C Programs

Suffix Tree Application 1 – Substring Check

Given a text string and a pattern string, check if a pattern exists in text or not.Few pattern searching algorithms (KMP, Rabin-Karp, Naive Algorithm, Finite… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Amazon interview Experience | Set 142 (Off-Campus for SDE-1)

Round 1: Telephonic Q1. Implement some functionalities of Minesweeper like connected component search and game termination check etc. Q2. Linked list random pointer question: Clone… Read More

Amazon

Experiences

Interview Experiences

Ukkonen’s Suffix Tree Construction – Part 6

This article is continuation of following five articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Ukkonen’s Suffix Tree Construction – Part… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Ukkonen’s Suffix Tree Construction – Part 5

This article is continuation of following four articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Ukkonen’s Suffix Tree… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Binomial Heap

The main application of Binary Heap is as implement a priority queue. Binomial Heap is an extension of Binary Heap that provides faster union or… Read More

Advanced Data Structure

DSA

Heap

Ukkonen’s Suffix Tree Construction – Part 4

This article is continuation of following three articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Ukkonen’s Suffix Tree… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Ukkonen’s Suffix Tree Construction – Part 3

This article is continuation of following two articles: Ukkonen’s Suffix Tree Construction – Part 1 Ukkonen’s Suffix Tree Construction – Part 2 Please go through… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Microsoft Interview Experience | Set 39 (On-Campus)

?I like to thanks geeksforgeeks.org for my ?entire journey in placement. Round->1 (multiple choice questions) 1. Intersection of two linked list. 2. There is a… Read More

Microsoft

Experiences

Interview Experiences

Amazon interview Experience | Set 140 (Experienced for SDE)

Hi, Recently i had interviews with Amazon. 1st Round (Telephonic): 1. Given an integer array and a constant number X, print all pair of number… Read More

Amazon

Binary Search Tree

DSA

Experienced

Experiences

Interview Experiences