All Hard Articles

Ukkonen’s Suffix Tree Construction – Part 2

In Ukkonen’s Suffix Tree Construction – Part 1, we have seen high level Ukkonen’s Algorithm. This 2nd part is continuation of Part 1. Please go… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Serialize and Deserialize an N-ary Tree

Given an N-ary tree where every node has the most N children. How to serialize and deserialize it? Serialization is to store a tree in… Read More

n-ary-tree

DSA

Tree

Ukkonen’s Suffix Tree Construction – Part 1

Suffix Tree is very useful in numerous string processing and computational biology problems. Many books and e-resources talk about it theoretically and in few places,… Read More

Suffix-Tree

Advanced Data Structure

DSA

Pattern Searching

Amazon interview Experience | Set 138 (For SDE 1)

Screening round: Three coding question on hackerEarth to be comiled against the testcases 1. Merge two sorted linked list into single one 2. Difference between… Read More

Amazon

Arrays

DSA

Experiences

Interview Experiences

Flipkart Interview | Set 15 (For SDE-II)

1st round (machine coding) You are given a catalog of books, which have following attributes. Name Author Publisher Publish year Category Price Count (sold) Implement… Read More

Flipkart

Experiences

Interview Experiences

Nagarro Interview Experience | Set 3 (On-Campus)

Nagarro came to our campus for their placement drive. They took the written test in the campus and called the shortlisted candidates to their Gurgaon… Read More

Nagarro

Experiences

Interview Experiences

LinkedIn Interview Experience | Set 2 (On-Campus)

Online coding 1 hr, 3 Questions. 1. We have to implement getIntComplement() function , that will give complement of an given integer . 2. There… Read More

Experiences

Interview Experiences

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

I would like to start off by thanking the entire community of GeeksforGeeks for helping me out. Attempt 1 Round1: 1. Given a number N,… Read More

Amazon

Binary Search Tree

DSA

Experiences

Interview Experiences

GATE | GATE-CS-2003 | Question 33

Consider the following formula a and its two interpretations I1 and I2 Which of the following statements is true? (A) I2 satisfies α, I1 does… Read More

GATE-CS-2003

GATE-GATE-CS-2003

GATE

Minimum Cost Polygon Triangulation

A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices (corners) such that the diagonals never intersect. The problem is to… Read More

DSA

Dynamic Programming

Geometric

Microsoft IDC Interview Experience | Set 38 (For Internship)

I completed my internship at MS-IDC this summer. Here is my interview experience. Round 1(Online MCQ): Varying level of difficulty. 15 MCQs. Topics: C/C++, data… Read More

Microsoft

Experiences

Interview Experiences

Amazon interview Experience | Set 129 (For SDE 1 Off-Campus)

In the recent past, I attended interview with Amazon. Here is my interview experience. Written Round: 1.5 hours 1. Given an array of integers, replace… Read More

Amazon

Experiences

Interview Experiences

Mobile Numeric Keypad Problem

Given the mobile numeric keypad. You can only press buttons that are up, left, right or down to the current button. You are not allowed… Read More

Amazon

MAQ Software

Microsoft

Sprinklr

DSA

Dynamic Programming

Matrix

Strings

GATE | GATE-CS-2004 | Question 90

How many graphs on n labeled vertices exist which have at least (n2 – 3n)/2 edges ? (A) A (B) B (C) C (D) D… Read More

GATE-CS-2004

GATE-GATE-CS-2004

GATE

GATE | GATE-CS-2004 | Question 68

Let A = 1111 1010 arid B = 0000 1010 be two 8-bit 2’s complement numbers. Their product in 2’s complement is (A) 1100 0100… Read More

GATE-CS-2004

GATE-GATE-CS-2004

GATE

GATE | GATE-CS-2004 | Question 67

A hard disk with a transfer rate of 10 Mbytes/ second is constantly transferring data to memory using DMA. The processor runs at 600 MHz,… Read More

GATE-CS-2004

GATE-GATE-CS-2004

GATE

How to efficiently implement k Queues in a single array?

Introduction : One efficient way to implement k queues in a single array is to use a technique called “circular array implementation of k queues.”… Read More

Accolite

DSA

Queue

GATE | GATE-CS-2004 | Question 64

Directions for question 63 to 64: Consider the following program segment for a hypothetical CPU having three user registers R1, R2 and R3. Instruction Operation… Read More

GATE-CS-2004

GATE-GATE-CS-2004

GATE

Minimum no. of iterations to pass information to all nodes in the tree

Given a very large n-ary tree. Where the root node has some information which it wants to pass to all of its children down to… Read More

DSA

Tree

Citrix Interview | Set 2 (Written Test Experience)

Recently, we had Citrix written test in our campus. There was a 1 hr aptitude test & 1 hour coding round. The aptitude test had… Read More

Citrix

Experiences

Interview Experiences