## Number of Paths of Weight W in a K-ary tree

Given a K-ary tree, where each node is having K children and each edge has some weight. All the edges i.e. K, that goes from… Read More »

- Burst Balloon to maximize coins
- Maximum sum in circular array such that no two elements are adjacent
- Walmart Labs Interview Experience ( On Campus FT + 6 month Internship )
- Minimum steps to reach target by a Knight | Set 2
- Matrix Chain Multiplication (A O(N^2) Solution)
- Minimum splits in a binary string such that every substring is a power of 4 or 6.
- Understanding The Coin Change Problem With Dynamic Programming
- Minimum number of increasing subsequences
- Count the number of ways to traverse a Matrix
- Count ways to reach a score using 1 and 2 with no consecutive 2s
- Nutanix Interview Experiance - Campus Placements
- Paytm Interview experience for FTE (On-Campus)
- Minimum cost to buy N kilograms of sweet for M persons
- Number of subsets with sum divisible by m
- Goldman Sachs Interview Experience | Set 51
- Ways to write N as sum of two or more positive integers | Set-2
- Water Jug Problem using Memoization
- Treasure and Cities
- Memoization (1D, 2D and 3D)
- Level Ancestor Problem
- Longest Common Subsequence | DP using Memoization
- Longest subarray having maximum sum
- Minimum odd cost path in a matrix
- Count common subsequence in two strings
- Sum of Fibonacci numbers at even indexes upto N terms
- Total number of different staircase that can made from N boxes
- Find the sum of first N odd Fibonacci numbers
- Number of ways to reach Nth floor by taking at-most K leaps
- Edit distance and LCS (Longest Common Subsequence)
- Longest Decreasing Subsequence

Given a K-ary tree, where each node is having K children and each edge has some weight. All the edges i.e. K, that goes from… Read More »

Given a string str comprising of characters (, ), {, }, [, ] and ?. The task is to find the total number of balanced… Read More »

Given two numbers x, y which denotes the number of set bits. Also given is a number C. The task is to print the number… Read More »

Given a N X N matrix consisting of characters. Also given are Q queries, where each query contains a co-ordinate (X, Y). For every query,… Read More »

Given two integers N and K, the task is to find the number of ways to place K bishops on an N × N chessboard… Read More »

Given a number, N. find the sum of first N odd Fibonacci numbers. Note: The answer can be very large so print the answer modulo… Read More »

Given a string ‘S’ consisting of open and closed brackets, the task is find the number of ways in which each character of ‘S’ can… Read More »

Given integers N, P and Q where N denotes the destination position. The task is to move from position 0 to position N with minimum… Read More »

Given n cities: x1, x2, …… xn: each associated with T[i] (treasure) and C[i] (color). You can choose to visit a city or skip it.… 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 »

A cricket player has to score N runs, with condition he can take either 1 or 2 runs only and consecutive runs should not be… Read More »

Given a positive integer N, the task is to find the value of F2 + F4 + F6 +………+ F2n upto N terms where Fi… Read More »

Given integers ‘K’ and ‘N’, the task is to find the Nth term of the K-Fibonacci series. In K – Fibonacci series, the first ‘K’… Read More »

Given a Markov chain G, we have the find the probability of reaching the state F at time t = T if we start from… Read More »

Given a number N representing the length of a bracket sequence consisting of brackets ‘(‘, ‘)’. The actual sequence is not known beforehand. Given the… Read More »