## Number of trailing zeroes in base 16 representation of N!

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 »

- Make all numbers of an array equal
- Sum of XOR of all subarrays
- Nth number whose sum of digit is multiple of 10
- Count common characters in two strings
- Merge K sorted arrays of different sizes | ( Divide and Conquer Approach )
- Sort an array without changing position of negative numbers
- Given two arrays count all pairs whose sum is an odd number
- Operations required to make the string empty
- Java ArrayList to print all possible words from phone digits
- Find minimum difference between any two elements | Set 2
- Interactive Problems in Competitive Programming
- Check whether two strings contain same characters in same order
- Program to find the kth character after decrypting a string
- Find two numbers whose divisors are given in a random order
- Sum of bitwise AND of all subarrays
- Total number of possible Binary Search Trees using Catalan Number
- Count of all possible values of X such that A % X = B
- Find sub-arrays from given two arrays such that they have equal sum
- Maximize the happiness of the groups on the Trip
- Find the minimum number of operations required to make all array elements equal
- Find the number of distinct pairs of vertices which have a distance of exactly k in a tree
- Check if a Queen can attack a given cell on chessboard
- Spanning Tree With Maximum Degree (Using Kruskal's Algorithm)
- Maximum subarray sum by flipping signs of at most K array elements
- Find the minimum number of elements that should be removed to make an array good
- Find the minimum number of preprocess moves required to make two strings equal
- Count how many times the given digital clock shows identical digits
- Shortest path on a Square
- Replace array elements by sum of next two consecutive elements
- Number of ways of scoring R runs in B balls with at most W wickets

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 »

Given an array arr[] of integers and an integer pos, the task is to find the minimum index i such that all the elements from… Read More »

Given the source point and the destination point of the path and two integers x and y. The task is to check whether it is… Read More »

Given an array arr[], the task is to find the maximum length of a subsequence such that the adjacent elements in the subsequence have a… Read More »