## Min number of operations to reduce N to 0 by subtracting any digits from N

Given a number N, the task is to find the minimum number of operations required to reduce the number N to zero by subtracting the… Read More »

- Must do Math for Competitive Programming
- Which C++ libraries are useful for competitive programming?
- Breadth First Search without using Queue
- Which Java libraries are useful for competitive programming?
- Minimize the maximum difference between adjacent elements in an array
- 7 Best Coding Challenge Websites in 2020
- Which Python Modules are useful for competitive programming?
- Speed up Code executions with help of Pragma in C/C++
- Basic Algorithm Techniques Not Taught in Academics
- Setting up a C++ Competitive Programming Environment
- Writing code faster during Competitive Programming in C++
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Count of subarrays of an Array having all unique digits
- Logarithm tricks for Competitive Programming
- Default values in a Map in C++ STL
- Move all zeroes to end of array using Two-Pointers
- Sum of GCD of all possible sequences
- How To Approach A Coding Problem ?
- Minimize the maximum difference of adjacent elements after at most K insertions
- Maximum LCM among all pairs (i, j) from the given Array
- Count of subarrays which start and end with the same element
- Submatrix of given size with maximum 1's
- Kth most frequent Character in a given String
- Length of the smallest substring which contains all vowels
- Longest Mountain Subarray
- Find distance between two nodes in the given Binary tree for Q queries
- Find maximum subset sum formed by partitioning any subset of array into 2 partitions with equal sum
- Find last remaining element after reducing the Array
- Queries for elements having values within the range A to B in the given index range using Segment Tree
- Count of substrings of length K with exactly K distinct characters

Given a number N, the task is to find the minimum number of operations required to reduce the number N to zero by subtracting the… Read More »

Given a grid of size N*M consists of 0 and 1 only, the task is to find the length of longest connected 1s in the… Read More »

Given an array arr[] of N positive integers and two positive integers S and K, the task is to reach the position of the array… Read More »

Given two integers N and K, the task is to find the number of binary strings of length N having an even number of 1’s… Read More »

Given an array arr[] of integers of size N, the task is to find the products of all subarrays of the array. Examples: Input: arr[]… Read More »

Given a positive integer N, the task is to find the total number of distinct power of prime factor of the given number N. Examples:… Read More »

Given four positive integers M, N, X, and Y, the task is to count all the possible ways to reach from top left(i.e., (0, 0))… Read More »

Given an array arr[] of size N containing integers. The task is to find the length of the longest sub-array having sum equal to the… Read More »

Given a string str of size N and an integer K, the task is to check if the input string can be partitioned into substrings… Read More »

Given two arrays A[] and B[] of N positive integers and a cost C. We can choose any one element from each index of the… Read More »

Given an array arr[] of size N and an integer K, the task is to find maximum absolute difference between the sum of subarrays of… Read More »

Given an integer matrix mat [ ][ ] dimensions, the task is to find the largest possible square matrix from the given matrix with maximum… Read More »

Given a binary matrix mat[][] of size NxM and two integers X and Y, the task is to find the minimum number steps required to… Read More »

Given N lists of strings, the task is to find the count of lists which are not a sublist of any other given lists. Examples:… Read More »

Given a matrix A[][] consisting of coordinates of N rectangles such that {A[i][0], A[i][1]} representing bottom left coordinate of rectangle and {A[i][2], A[i][3]} representing top… Read More »