All Hard Articles

Algorithms | Graph Shortest Paths | Question 9

Following statement is true or false? If we make following changes to Dijkstra, then it can be used to find the longest simple path, assume… Read More

Algorithms-Graph Shortest Paths Quiz

Graph Shortest Paths Quiz

DSA Quiz

Delete Operation in B-Tree

Pre-Requisite: B-Tree | Set 1 (Introduction), B-Tree | Set 2 (Insert) B Trees is a type of data structure commonly known as a Balanced Tree… Read More

B-Tree

dbms

DBMS Indexing

Advanced Data Structure

DBMS

DSA

C++ | Static Keyword | Question 4

Predict the output of following C++ program. #include <iostream> using namespace std; class A { private: int x; public: A(int _x) { x =… Read More

C++-Static Keyword

Static Keyword

C Language

C++ Quiz

Introduction to NP-Complete Complexity Classes

NP-complete problems are a subset of the larger class of NP (nondeterministic polynomial time) problems. NP problems are a class of computational problems that can… Read More

NPHard

Analysis of Algorithms

Articles

DSA

C++ | Misc C++ | Question 5

How can we make a C++ class such that objects of it can only be created using new operator? If user tries to create an… Read More

C++-Misc C++

Misc C++

C Language

C++ Quiz

Cisco Interview | Set 2

I recently got interviewed for a position in Cisco. The organization came to our college as part of their University recruitment program. The following is… Read More

Cisco

Experiences

Interview Experiences

Amazon Interview | Set 38 (SDE-I)

1) (Telephonic round 1) a. Print a matrix in spiral order (Code) Soln: Solved it using recursion. Each recursive call was supposed to print boundary elements. On… Read More

Amazon

Experiences

Interview Experiences

Fleury’s Algorithm for printing Eulerian Path or Circuit

Eulerian Path is a path in a graph that visits every edge exactly once. Eulerian Circuit is an Eulerian Path that starts and ends on the… Read More

Euler-Circuit

DSA

Graph

Morgan Stanley Interview | Set 1

Morgan Stanley campus placement for post IT analyst. 1st round – objective written test 10 questions on aptitude and analytics 30 questions on programming 10… Read More

Morgan Stanley

Experiences

Interview Experiences

C++ | Constructors | Question 17

Output? #include<iostream> #include<string.h> using namespace std; class String { char *str; public: String(const char *s); void change(int index, char c) { str[index] = c;… Read More

C++-Constructors

Constructors

C Language

C++ Quiz

C++ | this pointer | Question 3

Predict the output of following C++ program. #include<iostream> using namespace std; class Test { private: int x; public: Test(int x = 0) { this->x… Read More

C++-this pointer

this pointer

C Language

C++ Quiz

C++ | Constructors | Question 9

Predict the output of following program. #include<iostream> #include<stdlib.h> using namespace std; class Test { public: Test() { cout << "Constructor called"; } }; … Read More

C++-Constructors

Constructors

C Language

C++ Quiz

C++ | Constructors | Question 7

What is the output of following program? #include <iostream> using namespace std; class Point { int x, y; public: Point(const Point &p) { x… Read More

C++-Constructors

Constructors

C Language

C++ Quiz

Amazon Interview | Set 34

First of all, a very very big thanks to whole team of geeks for geeks. It is because of them only that I was able… Read More

Amazon

priority-queue

DSA

Experiences

Heap

Interview Experiences

Maximum Bipartite Matching

A matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint. A… Read More

DSA

Graph

Convex Hull using Jarvis’ Algorithm or Wrapping

Given a set of points in the plane. the convex hull of the set is the smallest convex polygon that contains all the points of… Read More

DSA

Geometric

Mathematical

Longest Arithmetic Progression

Given an array Set[ ] of sorted integers having no duplicates, find the length of the Longest Arithmetic Progression (LLAP) subsequence in it. Examples: Input:… Read More

Amazon

arithmetic progression

Snapdeal

Arrays

DSA

Dynamic Programming

QuickSort on Singly Linked List

Given a linked list, apply the Quick sort algorithm to sort the linked list. The important things about implementation are, that it changes pointers rather… Read More

Linked-List-Sorting

Quick Sort

DSA

Linked List

Sorting

Find the Increasing subsequence of length three with maximum product

Given a sequence of non-negative integers, find the subsequence of length 3 having maximum product with the numbers of the subsequence being in ascending order.… Read More

subsequence

Arrays

DSA

Check for Identical BSTs without building the trees

Given two arrays that represent a sequence of keys. Imagine we make a Binary Search Tree (BST) from each array. We need to tell whether… Read More

Binary Search Tree

DSA