## Check if N can be represented as sum of integers chosen from set {A, B}

Given three integers N, A and B, the task is to find whether N can be represented as sum of A’s and B’s. Examples: Input:… 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
- 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
- Find the values of X and Y in the Given Equations
- Count pieces of circle after N cuts
- Count triplet pairs (A, B, C) of points in 2-D space that satisfy the given condition
- Reconstruct the array by replacing arr[i] with (arr[i-1]+1) % M
- Number of pairs with Bitwise OR as Odd number
- Count pairs with Bitwise-AND as even number
- 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 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
- Divide an isosceles triangle in two parts with ratio of areas as n:m
- 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
- Count the number of common divisors of the given strings
- Absolute difference between the first X and last X Digits of N
- Check if a number can be represented as a sum of 2 triangular numbers
- Maximum sum after repeatedly dividing N by a divisor
- Partiton N into M parts such that difference between Max and Min part is smallest
- Count subarrays consisting of only 0's and only 1's in a binary array

Given three integers N, A and B, the task is to find whether N can be represented as sum of A’s and B’s. Examples: Input:… Read More »

Given an array A[] of size N. The task is to find the how many pair(i, j) exists such that A[i] OR A[j] is odd.… Read More »

Given two integers N and M, partiton N into M integers such that the difference between the maximum and minimum integer obtained by the partition… Read More »

Given an array of integers. The task is to find the number of pairs (i, j) such that A[i] & A[j] is even. Examples: Input:… Read More »

Given an even number N. The task is to consider numbers from 1 to N2, split them into N groups of the equal sum. Examples:… Read More »

Given an integer N, where . The task is to print the count of pieces of a circle with N cuts where each cut passes… Read More »

Given a binary array consisting of only zeroes and ones. The task is to find: The number of subarrays which has only 1 in it.… Read More »

CamelCase is the sequence of one or more than one words having the following properties: It is a concatenation of one or more words consisting… Read More »

Given an array of N elements and an integer M. Now, the array is modified by replacing some of the array elements with -1. The… Read More »

Given a positive integer . The task is to represent it as a sum of the maximum possible number of prime numbers. (N > 1)… Read More »

Given a graph with n nodes and m edges. Find the maximum possible number of nodes which are not part of any edge (m will… Read More »

Given four integers a, b, c, d ( upto 10^6 ). The task is to Find the number of solutions for x < y, where… Read More »

Given the height of an isosceles triangle and two integers , . The task is to find the height from top of the triangle such… Read More »

We are given a number N. The task is to find the count of numbers which have N digits and odd number of zeroes. Note:… Read More »

Given one side of right angle triangle, check if there exists a right angle triangle possible with any other two sides of the triangle. If… Read More »