## Count of ways to traverse a Matrix and return to origin in K steps

Given three integers N, M and K, where N and M are the dimensions of the matrix and K is the maximum possible steps, the… Read More »

- Maximum path sum in the given arrays with at most K jumps
- Count minimum factor jumps required to reach the end of an Array
- Count of ways to split a given number into prime segments
- Maximum sum in circular array such that no two elements are adjacent | Set 2
- Count of ways to traverse a Matrix and return to origin in K steps

Given three integers N, M and K, where N and M are the dimensions of the matrix and K is the maximum possible steps, the… Read More »

Given a numeric string str, the task is to count the number of ways the given string can be split, such that each segment is… Read More »

Given an array arr[] of positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should… Read More »

Given an array of positive integers arr[], the task is to count the minimum factor jumps required to reach the end of an array. From… Read More »

Given three arrays A, B and C each having N elements, the task is to find the maximum sum that can be obtained along any… Read More »

Given an array ‘arr’ containing the weight of ‘N’ distinct items, and two knapsacks that can withstand ‘W1’ and ‘W2’ weights, the task is to… 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 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 »

Recursion is a programming technique where a function calls itself repeatedly till a termination condition is met. Some of the examples where recursion is used… Read More »

Given an integer n and an array of positions ‘position[]’ (1 <= length(position[]) <= 2n), find the number of ways of proper bracket expressions that… Read More »

Given two jugs with the maximum capacity of m and n liters respectively. The jugs don’t have markings on them which can help us to… Read More »

Given two strings str1 and str2 and below operations that can be performed on str1. Find the minimum number of edits (operations) required to convert… Read More »

Given two strings s1 and s2, the task is to find the length of longest common subsequence present in both of them. Examples: Input: s1… Read More »