# Category Archives: Competitive Programming

## Maximum product of bitonic subsequence of size 3

Given an array arr[] of positive integers of size N, the task is to find the maximum product of bitonic subsequence of size 3. Bitonic… Read More »

## Minimum change in given value so that it lies in all given Ranges

Given an array of ranges arr[] of length N and a number D, the task is to find the minimum amount by which the number… Read More »

## Maximum repeated frequency of characters in a given string

Given a string S, the task is to find the count of maximum repeated frequency of characters in the given string S. Examples: Input: S… Read More »

## Print all possible pair with prime XOR in the Array

Given an array arr[] of N positive integers. The task is to print all possible pairs such that their XOR is a Prime Number. Examples:… Read More »

## Find if a point lies inside, outside or on the circumcircle of three points A, B, C

Given four non-collinear points A, B, C, and P. The task is to find whether point P lies inside, outside or on the circumcircle formed… Read More »

## Check if all Prime factors of number N are unique or not

Given a number N. The task is to check whether the given number N has unique prime factors or not. If yes then print YES… Read More »

## Count of strings possible by replacing two consecutive same character with new character

Given a string str. The task is to count the number of all different strings possible if two consecutive same characters of the string can… Read More »

## Minimum value of distance of farthest node in a Graph

Given an acyclic undirected graph having N nodes and N-1 edges in the form of a 2D array arr[][] in which every row consists of… Read More »

## Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency

Given a string S, the task is to find the prefix of string S with the maximum possible length such that frequency of each character… Read More »

## Minimum number of blocks required to form Hollow Rectangular Prism

Given the dimensions of a block L, B and H, the task is to form a Hollow Rectangular prism of length A and height Ht… Read More »

## Minimum splits required to convert a number into prime segments

Given a number in the form of a string s, the task is to calculate and display minimum splits required such that the segments formed… Read More »

## Maximum Squares possible parallel to both axes from N distinct points

Given Xi and Yi co-ordinate of N distinct points in the 2-D Plane, the task is to count the number of squares that can be… Read More »

## Minimum removals required to make ranges non-overlapping

Given a list of ranges with starting and end value, the task is to find the minimum number of ranges that are required to be… Read More »

## Count ways to reach the Nth stair using multiple 1 or 2 steps and a single step 3

Given an integer N number of stairs, the task is count the number ways to reach the Nth stair by taking 1 or 2 step… Read More »

## Minimum Enclosing Circle | Set 1

Prequisites: Equation of circle when three points on the circle are given, Convex Hull Given an array arr[][] containing N points in a 2-D plane… Read More »