Given N and K, the task is to form an array where each element represents the number of ways to reach each index i (1… Read More
Category Archives: Dynamic Programming
Given binary array A[] of size N, the task is to find the minimum cost to remove all elements of the array by performing moves… Read More
Given numbers T, A, and B, the task is to find the greatest number less than equal to T formed by the sum of any… Read More
Given integer N, the task is to count the number of ways( modulo 109 + 7) to create an N digit number from digits 1… Read More
Given the number N, the task for this problem is to find the number of ways of creating an N digit number whose bitwise XOR… Read More
Given a number N, the task is to count the number of ways to create a string of size N (only with capital alphabets) such… Read More
Given an array of integer nums[] and a positive integer K, the task is to find the maximum number of integers that can be selected… Read More
Given a number N, the task is to count the number of ways to create an N digit number from digits 1 to 9 such… Read More
Given integers L and R, the task for this problem is to find a number of integers in the range L to R whose sum… Read More
Given integers T, A, and B, the task for this problem is to find numbers in the range [A, B] such that the adjacent digits… Read More
Given integers A, B, C, and D, There are two boxes First Box has A red balls and B blue balls and the second box… Read More
Given integers A and K, there are A boxes the first box contains K balls, the Second box contains K + 1 balls, the Third… Read More
Given arrays A[] and B[] of size N and integer M, the task is to find out the minimum operations required to collect a sum… Read More
Given non-negative integers X, Y, and Z for each M query. Given X amount of character ‘A’, Y amount of character ‘B’, and Z amount… Read More
Given integers, L and R, the task is to find the ∑f(x) for all L to R, where f(x) is defined for number as f(x)… Read More
Courses
