Skip to content
All Hard Articles
A processor uses 2-level page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and… Read More
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to… Read More
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
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
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
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
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
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
Given a string, build it’s Suffix Array We have already discussed following two ways of building suffix array: Naive O(n2Logn) algorithm Enhanced O(nLogn) algorithm Please… Read More
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
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
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,… Read More
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
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
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
The main application of Binary Heap is as implement priority queue. Binomial Heap is an extension of Binary Heap that provides faster union or merge… Read More
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
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
?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
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