This category is for logical grouping only. It needn’t to be added directly. Instead, the sub-categories should be added.

## Find the number of points that have atleast 1 point above, below, left or right of it

Given N points in 2 dimensional plane. A point is said to be above another point if the X coordinates of both points are same… Read More »

## Modify a binary array to Bitwise AND of all elements as 1

Given an array a[] consisting only 0 and 1. The task is to check if it is possible to transform the array such that the… Read More »

## Sum of minimum elements of all possible sub-arrays of an array

Given an array arr[], the task is to find the sum of the minimum elements of every possible sub-array of the array. Examples: Input: arr[]… Read More »

## Sum of maximum elements of all possible sub-arrays of an array

Given an array arr[], the task is to find the sum of the maximum elements of every possible sub-array of the array. Examples: Input: arr[]… Read More »

## Maximize the sum of products of the degrees between any two vertices of the tree

Given an integer N, the task is to construct a tree such that sum of for all ordered pairs (u, v) is maximum where u… Read More »

## Count the total number of squares that can be visited by Bishop in one move

Given the position of a Bishop on an 8 * 8 chessboard, the task is to count the total number of squares that can be… Read More »

## Java Program to print distinct permutations of a string

Given a string str, the task is to print all the distinct permutations of str. A permutation is an arrangement of all or part of… Read More »

## Acronym words

Given N strings consisting of lowercase letters of the English alphabet. The task is to find how many strings out of these N strings are… Read More »

## Distribute candies in a Binary Tree

Given a binary tree with N nodes, in which each node value represents number of candies present at that node, and there are N candies… Read More »

## Check whether Bishop can take down Pawn or not

Given the position of a Bishop and a Pawn on a 8 * 8 chessboard, the task is to check whether the Bishop can take… Read More »

## Minimum number of operations on an array to make all elements 0

Given an array arr[] of N integers and an integer cost, the task is to calculate the cost of making all the elements of the… Read More »

## Python program to check if given string is pangram

Given a string, write a Python program to check if that string is Pangram or not. A pangram is a sentence containing every letter in… Read More »

## Java ArrayList to print all possible words from phone digits

Given a keypad of a mobile, and keys that need to be pressed, the task is to print all the words which are possible to… Read More »

## Count of unique pairs (arr[i], arr[j]) such that i < j

Given an array arr[], the task is to print the count of unique pairs (arr[i], arr[j]) such that i < j. Examples: Input: arr[] =… Read More »

## Find Intersection of all Intervals

Given N intervals of the form of [l, r], the task is to find the intersection of all the intervals. An intersection is an interval… Read More »