## Possible cuts of a number such that maximum parts are divisible by 3

Given a Large number N ( number of digits in N can be up to 105). The task is to find the cuts required of… Read More »

- Check if a word exists in a grid or not
- Minimum steps to reach any of the boundary edges of a matrix | Set 1
- Sum of XOR of all subarrays
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Make Binary Search Tree
- Treasure and Cities
- Number of ways to partition a string into two balanced subsequences
- Memoization using decorators in Python
- Color N boxes using M colors such that K boxes have different color from the box on its left
- Jump Pointer Algorithm
- Minimum distance to the end of a grid from source
- Minimum steps required to convert X to Y where a binary matrix represents the possible conversions
- Minimum cost to reach a point N from 0 with two different operations allowed
- A variation of Rat in a Maze : multiple steps or jumps allowed
- Count of Numbers in Range where first digit is equal to last digit of the number
- Count of sub-sets of size n with total element sum divisible by 3
- Minimum sum falling path in a NxN grid
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Ways to place K bishops on an N×N chessboard so that no two attack
- Find sub-matrix with the given sum
- Number of Binary Strings of length N with K adjacent Set Bits
- Find the sum of first N odd Fibonacci numbers
- Minimum Operations to make value of all vertices of the tree Zero
- Number of balanced bracket expressions that can be formed from a string
- Minimum number of operations required to sum to binary string S
- Count of Numbers in a Range where digit d occurs exactly K times
- Count pairs (A, B) such that A has X and B has Y number of set bits and A+B = C
- Count the number of special permutations
- Count of Numbers in Range where the number does not contain more than K non zero digits
- Number of Paths of Weight W in a K-ary tree

Given a Large number N ( number of digits in N can be up to 105). The task is to find the cuts required of… Read More »

Given a binary matrix of size NxN where 1 denotes that the number i can be converted to j, and 0 denotes it cannot be… Read More »

Given a 2D grid of characters and a word, the task is to check if that word exists in the grid or not. A word… Read More »

Given a binary grid of order r * c and an initial position. The task is to find the minimum distance from the source to… Read More »

Given an infinite tree and three numbers N, M, and X which has exactly N child from every node. Every edge has a weight of… Read More »

Given a range represented by two positive integers l and r and two integers d and m. Find the count of numbers lying in the… Read More »

Given a range represented by two positive integers L and R and a positive integer K. Find the count of numbers in the range where… Read More »

Given a tree, where each vertex V has a value A[V] stored in it. The task is to find the minimum number of operations required… Read More »

Given two positive integers L and R which represents a range and two more positive integers d and K. The task is to find the… Read More »

Given two integers n and k, the task is to calculate and print 1k + 2k + 3k + … + nk. Examples: Input: n… Read More »

Given a binary string S. Find the minimum number of operations required to be performed on the number zero to convert it to the number… Read More »

Given a range represented by two positive integers L and R. Find the count of numbers in the range where the first digit is equal… Read More »

Given a 4×4 binary matrix. Two players A and B are playing a game, at each step a player can select any rectangle with all… Read More »

A string is called a N-copy string when it is formed by N copies of letter ‘G’. ie “GGGG” is a 4-copy string since it… Read More »

Given three integers N, M and K. The task is to find the number of ways to fill N positions using M colors such that… Read More »