## Check if it is possible to create a polygon with given n sides

Given an array arr[] that contain the lengths of n sides that may or may not form a polygon. The task is to determine whether… Read More »

- Maximize the value of A by replacing some of its digits with digits of B
- Check if array can be divided into two sub-arrays such that their absolute difference is K
- Given count of digits 1, 2, 3, 4, find the maximum sum possible
- Minimum spanning tree cost of given Graphs
- Make all elements of an array equal with the given operation
- Find the repeating and the missing number using two equations
- Maximum average of a subarray of size of atleast X and atmost Y
- Minimum number of given operation required to convert n to m
- Find the values of X and Y in the Given Equations
- Count pieces of circle after N cuts
- Reconstruct the array by replacing arr[i] with (arr[i-1]+1) % M
- Find smallest number K such that K % p = 0 and q % K = 0
- Count triplet pairs (A, B, C) of points in 2-D space that satisfy the given condition
- Number of pairs with Bitwise OR as Odd number
- Count pairs with Bitwise-AND as even number
- Find the number of solutions to the given equation
- Count possible moves in the given direction in a grid
- Maximize the value of x + y + z such that ax + by + cz = n
- Check if N can be represented as sum of integers chosen from set {A, B}
- Check if matrix can be converted to another matrix by transposing square sub-matrices
- Check if an array of 1s and 2s can be divided into 2 parts with equal sum
- Split an array into groups of 3 such that X3 is divisible by X2 and X2 is divisible by X1
- Number of solutions for x < y, where a <= x <= b and c <= y <= d and x, y are integers
- Split N^2 numbers into N groups of equal sum
- Sum of all even numbers in range L and R
- Number of words in a camelcase sequence
- Represent a number as a sum of maximum possible number of Prime Numbers
- Maximize number of nodes which are not part of any edge in a Graph
- Total position where king can reach on a chessboard in exactly M moves | Set 2
- Total distinct pairs of ugly numbers from two arrays

Given an array arr[] that contain the lengths of n sides that may or may not form a polygon. The task is to determine whether… Read More »

Given a regular polygon of N sides with side length a. The task is to find the area of the Circle which inscribed in the… Read More »

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

Given the count of digits 1, 2, 3, 4. Using these digits you are allowed to only form numbers 234 and 12. The task is… Read More »

Given two arrays arr1[] and arr2[] of sizes N and M where 0 ≤ arr1[i], arr2[i] ≤ 1000 for all valid i, the task is… Read More »

Given two integers n and m, in a single operation n can be multiplied by either 2 or 3. The task is to convert n… Read More »

Given the volume V of a tank in liter. There is a pump which is filling the tank at speed of M liter per minute.… Read More »

Given three integers A, B and C. In an infinite sequence, A is the first number, C is the common difference (Si – Si –… Read More »

Given two N X M matrices of integers. In an operation, we can transpose any square sub-matrix in matrix1. The task is to check if… Read More »

Given an array arr[] and two integers X and Y. The task is to find a sub-array of size of atleast X and atmost Y… Read More »

Given a sequence whose nth term is T(n) = n2 – (n – 1)2 The task is to evaluate the sum of first n terms… Read More »

Given an array arr[] of n integers and an integer K. In one operation every element of the array is replaced by the difference of… Read More »

Given two integers p and q, the task is to find the smallest number K such that K % p = 0 and q %… Read More »

Given a grid N x M size and initial position (X, Y) and a series of K moves. Each move contains 2 integers Dx and… Read More »

Given three integers X, Y and N, the task is to find the Nth term of the series f[i] = f[i – 1] – f[i… Read More »