## Find n positive integers that satisfy the given equations

Given three integers N, X and Y. The task is to find N positive integers that satisfy the given equations. a12 + a22 + ….… Read More »

- Count common characters in two strings
- Sort an array without changing position of negative numbers
- Nth number whose sum of digit is multiple of 10
- Given two arrays count all pairs whose sum is an odd number
- Find maximum xor of k elements in an array
- Find minimum difference between any two elements | Set 2
- Interactive Problems in Competitive Programming
- Check whether two strings contain same characters in same order
- Total number of possible Binary Search Trees using Catalan Number
- Program to find the kth character after decrypting a string
- Find the minimum number of operations required to make all array elements equal
- Check if a Queen can attack a given cell on chessboard
- Maximize the happiness of the groups on the Trip
- Find the minimum number of elements that should be removed to make an array good
- Why Should I Learn Coding?
- Find the number of pair of Ideal nodes in a given tree
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Find sub-arrays from given two arrays such that they have equal sum
- Maximum subarray sum by flipping signs of at most K array elements
- Count of all possible values of X such that A % X = B
- Count how many times the given digital clock shows identical digits
- Equal Sum and XOR of three Numbers
- Lazy Propagation in Segment Tree | Set 2
- Number of ways of scoring R runs in B balls with at most W wickets
- Convert the undirected graph into directed graph such that there is no path of length greater than 1
- Find the Nth Mosaic number
- Optimally accommodate 0s and 1s from a Binary String into K buckets
- Lexicographically Smallest Topological Ordering
- Replace array elements by sum of next two consecutive elements
- Sum of digits with even number of 1's in their binary representation

Given three integers N, X and Y. The task is to find N positive integers that satisfy the given equations. a12 + a22 + ….… Read More »

Given a very large number N. The task is to find (1n + 2n + 3n + 4n) mod 5. Examples: Input: N = 4… Read More »

Given a permutation P (P1, P2, P3, … Pn) of first n natural numbers. Find the minimum number of operations to convert it into an… Read More »

Given an array arr[] containing GCD of every possible pair of elements of another array. The task is to find the original numbers which are… Read More »

Given a mat[][] of size n X n, the task is to find an element X such that if the anti-clockwise traversal is begun from… Read More »

Given an array arr[] of size n where arr[i] is the amount of candies of type i. You have unlimited amount of money. The task… Read More »

Given an array arr[] of size n, The task is to replace every element of the array by the sum of next two consecutive elements… Read More »

Given an undirected unweighted connected graph consisting of n vertices and m edges. The task is to find any spanning tree of this graph such… Read More »

Given an integer k and an array arr[], the task is to count the number of sub-arrays which have the sum equal to some positive… Read More »

Given two strings s1 and s2 consisting of lowercase English alphabets, the task is to count all the pairs of indices (i, j) from the… 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 an integer N, the task is to print a good permutation of first N natural numbers. Let’s denote the ith element of the permutation… Read More »

Given an integer N(1<=N<=10^9). The task is to represent N as a sum of the maximum possible number of composite summands and print this maximum… Read More »

Given a number N(1<=N<=2000)., The task is to find the number strings of size N that can be obtained after using characters from 'a' to… 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 »