## Count of substrings whose Decimal equivalent is greater than or equal to K

Given an integer K and a binary string S of length N, the task is to find out the number of substrings whose decimal equivalent… Read More »

Given an integer K and a binary string S of length N, the task is to find out the number of substrings whose decimal equivalent… Read More »

There are two singly linked lists in a system. By some programming error, the end node of one of the linked lists got linked to… Read More »

Given an array arr[] with N distinct numbers and another array arr1[] with N-1 operators (either < or >), the task is to organize the… Read More »

Given a string str, the task is to replace all occurrences of the given X with given Y and also remove any occurrances of the… Read More »

Given an array arr[] consisting of N elements, the task is to remove minimum number of elements from the ends of the array such that… Read More »

Given a binary string S of length N and an integer K, the task is to find the smallest non-zero sub-string of S that can… Read More »

Given two strings X and Y containing lower-case alphabets, the task is to check whether any permutation of string X exists in Y as its… Read More »

Given an array arr[] of N elements and an integer K, the task is to find the number of non-decreasing sub-arrays of length less than… Read More »

Given an array arr[] of N elements and an integer K, the task is to find the number of non-decreasing sub-arrays of length greater than… Read More »

Given an array arr[] of length N, the task is to find the number of non-decreasing sub-arrays of length K. Examples: Input: arr[] = {1,… Read More »

Given an array arr[] of N integers and an integer X, the task is to find three integers in arr[] such that the sum is… Read More »

Given a Binary Search Tree, and a number X. The task is to find the number of distinct pairs of distinct nodes in BST with… Read More »

Given an array A of size N. The task is to find the length of smallest subarray which contains both maximum and minimum values. Examples:… Read More »

Given a Binary Search Tree and a SUM. The task is to check if there exists any triplet(group of 3 elements) in the given BST… Read More »

Given a sorted doubly linked list of distinct nodes(no two nodes have the same data) and a value x. The task is to count the… Read More »