## Find the minimum number of preprocess moves required to make two strings equal

Given two strings A and B of equal lengths consisting of lower case English letters. The task is to count the minimum number of pre-processing… Read More »

- Practice for cracking any coding interview
- How to get rid of Java TLE problem
- How can one become good at Data structures and Algorithms easily?
- Burst Balloon to maximize coins
- Understanding The Coin Change Problem With Dynamic Programming
- Subset array sum by generating all the subsets
- Reach the numbers by making jumps of two given lengths
- Sum of similarities of string with all of its suffixes
- Make all numbers of an array equal
- Maximize the total profit of all the persons
- Some useful C++ tricks for beginners in Competitive Programming
- Find triplets in an array whose AND is maximum
- Check if a number is perfect square without finding square root
- Length of the longest Subarray with only Even Elements
- Print matrix in snake pattern from the last column
- Sort the array of strings according to alphabetical order defined by another string
- Python in Competitive Programming
- Sum of the first N Prime numbers
- How can competitive programming help you get a job?
- How to read Competitive Programming Questions?
- Check if it is possible to reach a number by making jumps of two given length
- Minimum changes required to make two arrays identical
- Number of array elements derivable from D after performing certain operations
- C++: Methods of code shortening in competitive programming
- Sum of the multiples of two numbers below N
- Number of quadrilaterals possible from the given points
- Minimum number of increasing subsequences
- Find two numbers whose divisors are given in a random order
- Minimum number of sets with numbers less than Y
- Smallest Pair Sum in an array

Given two strings A and B of equal lengths consisting of lower case English letters. The task is to count the minimum number of pre-processing… Read More »

Given an integer k and a tree with n nodes. The task is to count the number of distinct pairs of vertices which have a… Read More »

Given two points (x1, y1) and (x2, y2) in 2-D coordinate system. The task is to count all the paths whose distance is equal to… Read More »

Given an integer N, the task is to find the number of trailing zeroes in the base 16 representation of the factorial of N. Examples:… Read More »

Given three integers N, D and K. The task is to check whether it is possible to make a tree with exactly N vertices, D… Read More »

Given a directed graph and a node X. The task is to find the minimum number of edges that must be added to the graph… Read More »

Given an array arr[] of N integers and an integer M where N % M = 0. The task is to find the minimum number… Read More »

Given k sorted arrays of different length, merge them into a single array such that the merged array is also sorted. Examples: Input : {{3,… Read More »

Given an array arr[], the task is to find the minimum number of elements that must be removed to make the array good. A sequence… Read More »

Given a range [L, R] and two positive integers N and M. The task is to count the numbers in the range containing only non-zero… Read More »

Given three positive integers N, L and R. The task is to find the number of ways to form an array of size N where… Read More »

Given a number N(1 ≤ N ≤ 1018) without leading zeros. The task is to find the minimum number of moves required to make N… Read More »

Given two binary strings A and B of length N and M (up to 105). The task is to repeat the below process and find… Read More »

Given an array consisting of N positive integers, find the sum of bit-wise and of all possible sub-arrays of the array. Examples: Input : arr[]… Read More »

Given an array containing N positive integers, the task is to find the sum of XOR of all sub-arrays of the array. Examples: Input :… Read More »