All Hard Articles

Minimize the number of weakly connected nodes

Given an undirected graph, task is to find the minimum number of weakly connected nodes after converting this graph into directed one. Weakly Connected Nodes… Read More

DFS

DSA

Graph

VLAN Trunking Protocol (VTP)

To carry traffic of a VLAN, it must be first configured on the switch. Suppose, if the user wants to send a frame from source… Read More

Computer Networks

ISRO | ISRO CS 2014 | Question 4

Consider the following pseudo code while (m < n) if (x > y ) and (a < b) then a=a+1 y=y-1 end if m=m+1 end… Read More

ISRO

Levelwise Alternating OR and XOR operations in Segment Tree

A Levelwise OR/XOR alternating segment tree is a segment tree, such that at every level the operations OR and XOR alternate. In other words at… Read More

Bitwise-XOR

Segment-Tree

Advanced Data Structure

Bit Magic

DSA

Technical Scripter

Reverse Morris traversal using Threaded Binary Tree

What is Morris traversal?Morris (InOrder) Traversal is a tree traversal algorithm that does not use recursion or stacks. This traversal creates links as descendants and… Read More

Advanced Data Structure

DSA

Misc

Tree

Range query for Largest Sum Contiguous Subarray

Given an array a[] of size N, and Q queries of two types 1 and 2. For the given query of: Type 1: given l… Read More

Segment-Tree

Advanced Data Structure

Arrays

DSA

Tree

Removing elements between the two zeros

Given an integer N which shows the size of the string and in the next line given a string which contains a string of character… Read More

cpp-string

Java-Strings

DSA

Strings

UGC-NET | UGC NET CS 2016 Aug – II | Question 11

Given i= 0, j = 1, k = – 1 x = 0.5, y = 0.0 What is the output of given ‘C’ expression ?… Read More

UGC-NET

Dynamic Disjoint Set Data Structure for large range values

Prerequisites: Disjoint Set Data Structure Set Unordered_Map Disjoint Set data structure is used to keep track of a set of elements partitioned into a number… Read More

cpp-unordered_set

Advanced Data Structure

Competitive Programming

DSA

Large number arithmetic using doubly linked list

Given two very large numbers in form of strings. Your task is to apply different arithmetic operations on these strings. Prerequisite : Doubly Linked List.… Read More

doubly linked list

large-numbers

Advanced Data Structure

DSA

Linked List

Misc

React Conditional Rendering

React allows us to conditionally render components which means that the developer can decide which component to render on the screen on on the basis… Read More

ReactJS-Basics

JavaScript

Web Technologies

Leftover element after performing alternate Bitwise OR and Bitwise XOR operations on adjacent pairs

Given an array of N(always a power of 2) elements and Q queries.Every query consists of two elements, an index, and a value… We need… Read More

Bitwise-OR

Bitwise-XOR

Segment-Tree

Advanced Data Structure

Bit Magic

Data Structures

DSA

Priority of process in Linux | nice value

The running instance of program is process, and each process needs space in RAM and CPU time to be executed, each process has its priority… Read More

linux-command

Linux-Unix

Range Queries for Longest Correct Bracket Subsequence

Given a bracket sequence or in other words a string S of length n, consisting of characters ‘(‘ and ‘)’. Find the length of the… Read More

array-range-queries

Segment-Tree

Advanced Data Structure

DSA

Stack

Strings

Technical Scripter

Find duplicates in constant array with elements 0 to N-1 in O(1) space

Given a constant array of n elements which contains elements from 1 to n-1, with any of these numbers appearing any number of times. Find… Read More

graph-cycle

limited-range-elements

Algorithms

Arrays

DSA

Misc

Array range queries for elements with frequency same as value

Given an array of N numbers, the task is to answer Q queries of the following type: query(start, end) = Number of times a number… Read More

array-range-queries

cpp-unordered_map

Advanced Data Structure

Arrays

DSA

Technical Scripter

ISRO | ISRO CS 2015 | Question 42

If one uses straight two-way merge sort algorithm to sort the following elements in ascending order: 20, 47, 15, 8, 9, 4, 40, 30, 12,… Read More

ISRO

Number of Unicolored Paths between two nodes

Given an undirected colored graph(edges are colored), with a source vertex ‘s’ and a destination vertex ‘d’, print number of paths which from given ‘s’… Read More

DFS

DSA

Graph

Sum of special triplets having elements from 3 arrays

Given three arrays A, B, and C, the task is to find sum of values of all special triplets. A special triplet is defined as… Read More

Binary Search

Arrays

DSA

Technical Scripter

ISRO | ISRO CS 2015 | Question 9

The number of 1’s in the binary representation of (3*4096 + 15*256 + 5*16 + 3) are: (A) 8 (B) 9 (C) 10 (D) 12… Read More

ISRO