Count of strings that does not contain Arc intersection
Given an array arr[] consisting of N binary strings, the task is to count the number of strings that does not contain any Arc Intersection.… Read More »
Given an array arr[] consisting of N binary strings, the task is to count the number of strings that does not contain any Arc Intersection.… Read More »
Given an array arr[] of length N, the task is to find the number of elements in array arr[] which contains at least one smaller… Read More »
Given an array of strings arr[] representing the change folder operations(Unix-style) performed on the file system. Initially, the file system opens in the main folder.… Read More »
Design the forward and backward buttons of a Browser using Stack Data Structure. If at any instance, the URL does not exist after pressing any… Read More »
Tarjan’s Algorithm: The Tarjan’s Algorithm is an efficient graph algorithm that is used to find the Strongly Connected Component(SCC) in a directed graph by using… Read More »
Given a binary string S , the task is to find the smallest string possible by removing all occurrences of substrings “01” and “11”. After… Read More »
Given an array arr[] consisting of N integers, the task is to create an array brr[] of size N where brr[i] represents the count of… Read More »
The Stack is a linear data structure that follows the LIFO(Last In First Out) principle, i.e, the element inserted at the last is the element… Read More »
Given two integers S and N, the task is to find the maximum possible sum of squares of N integers that can be placed in… Read More »
Given an array of strings Q[], consisting of queries of the following types: “WRITE X”: Write a character X into the document. “UNDO”: Erases the… Read More »
Given a Stack S, the task is to print the elements of the stack from top to bottom such that the elements are still present… Read More »
Given an array arr[] consisting of N positive integers, the task is to find the maximum product of subarray sum with the minimum element of… Read More »
Given a Binary Search Tree, the task is to print the nodes of the BST in the following order: If the BST contains levels numbered… Read More »
Given an array arr[] of size N, the task is to print the distance of every array element from its next greater element. For array… Read More »
Given an undirected graph G with N nodes, M edges, and an integer K, the task is to find the maximum count of edges that… Read More »