## Minimize the value of N by applying the given operations

Given an integer N, below operations can be performed any number of times on N: Multiply N by any positive integer X i.e. N =… Read More »

- How can one become good at Data structures and Algorithms easily?
- Make all numbers of an array equal
- Reach the numbers by making jumps of two given lengths
- Some useful C++ tricks for beginners in Competitive Programming
- Check if a number is perfect square without finding square root
- Sum of XOR of all subarrays
- Sort the array of strings according to alphabetical order defined by another string
- Make Binary Search Tree
- Check if it is possible to reach a number by making jumps of two given length
- Sum of similarities of string with all of its suffixes
- Smallest Pair Sum in an array
- Find the number in a range having maximum product of the digits
- Maximum of all Subarrays of size k using set in C++ STL
- Print matrix in snake pattern from the last column
- Count distinct substrings that contain some characters at most k times
- Number of array elements derivable from D after performing certain operations
- Count common characters in two strings
- Operations required to make the string empty
- Program to find the kth character after decrypting a string
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Minimum number of sets with numbers less than Y
- Find two numbers whose divisors are given in a random order
- Given two arrays count all pairs whose sum is an odd number
- Number of subarrays have bitwise OR >= K
- Use of FLAG in programming
- Sum of the multiples of two numbers below N
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Sum of bitwise AND of all subarrays
- Interactive Problems in Competitive Programming
- Maximum length substring with highest frequency in a string

Given an integer N, below operations can be performed any number of times on N: Multiply N by any positive integer X i.e. N =… Read More »

Given an array arr containing N integer elements, the task is to count the minimum number of elements that need to be changed such that… Read More »

Given a number, N. find the sum of first N odd Fibonacci numbers. Note: The answer can be very large so print the answer modulo… Read More »

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

Given two integers x and n, the task is to search for the first consecutive stream of 1s (in the x’s 32-bit binary representation) which… Read More »

Given an integer x, the task is to find if every k-cycle shift on the element produces a number greater than or equal to the… Read More »

Given an integer k and an array of integers arr (less than 10^6), the task is to find the sum of every k’th prime number… Read More »

Given the number of cities n numbered from 0 to n-1 and the cities in which stations are located, the task is to find the… 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 »

Given a number N. The task is to find the sum of all multiples of 2 and 5 below N ( N may be up… Read More »

Given a number N, find the smallest prime divisor of N. Examples: Input: 25 Output: 5 Input: 31 Output: 31 Recommended: Please try your approach… Read More »

Given an array of integers arr, the task is to count the number of inversions in the array. If A[i] > A[j] and i <… Read More »

Given an array of integers. The task is to calculate the product of all the composite numbers in an array. Note: 1 is neither prime… Read More »

Given a string str, the task is to find the lexicographically smallest string that can be formed by removing at most one character from the… Read More »

Given an array of N integers and a number K, the task is to find the number of subarrays such that all elements are greater… Read More »