Web Technologies37.4K+ articles

Misc8.8K+ articles

Mathematical7.8K+ articles

Arrays6.5K+ articles

Competitive Programming3.3K+ articles

Strings3.3K+ articles

Greedy2.1K+ articles

Algorithms2.0K+ articles

Sorting1.8K+ articles

Searching1.7K+ articles

Given a set of items, each with a weight and a value, and a knapsack with a maximum weight capacity, the task is to determine the maximum value that can be obtained by put...read more

Dynamic Programming

Picked

DSA

Arrays

Python-DSA

The Traveling Salesman Problem (TSP) is a classic algorithmic problem in the fields of computer science and operations research. It involves finding the shortest possible ...read more

Graph

Dynamic Programming

Picked

DSA

Python-DSA

Given an even number of people n, who are standing in a circle. Each person shakes hands with one other person, resulting in a total of n/2 handshakes. The task is to find...read more

Dynamic Programming

Picked

DSA

Amazon

On a 2D grid representing a campus, there are n workers and m bikes, with 1 = n = m = 10. Each worker and bike is assigned a 2D coordinate on this grid. The tasks is to as...read more

Dynamic Programming

Picked

DSA

Arrays

Google

Bit Algorithms

Given an integer array arr[] where arr[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them. The score of ...read more

Dynamic Programming

Picked

DSA

Arrays

Google

Given an array arr[] of non-negative integers size N, the task is to start from index X and check if we can reach any index with value 0. For any index i, we can jump to i...read more

Dynamic Programming

Picked

DSA

Adobe

BFS

Given a string s, return the length of the longest good palindromic subsequence in s such that:It has an even length.No two consecutive characters are equal, except the tw...read more

Strings

Dynamic Programming

Picked

DSA

Codenation

Interview-Questions

Given N playing cards, the task is to return the number of distinct house of cards we can build using all N cards. A house of cards meets the following conditions:A house...read more

Dynamic Programming

Picked

DSA

Airbnb

Interview-Questions

Given two 0-indexed integer arrays, cost[] and time[] of size n representing the costs and the time taken to paint n different walls respectively. There are two painters a...read more

Dynamic Programming

Picked

DSA

DE Shaw

There arenstairs, and a person standing at the bottom wants to reach the top. The person can climb either1 stair or 2 stairs at a time. Count the number of ways, the perso...read more

Dynamic Programming

Mathematical

DSA

When we solve Dynamic Programming problems, we try to find a pattern by matching pattern with a standard DP problem. This is generally recommended to solve new DP problems...read more

Dynamic Programming

DSA

Fibonacci

LIS

LCS

catalan

binomial coefficient

When we solve a Dynamic Programming (DP) problem, we store solution in an array. The dimensions of the array are dependent on number of variables that change in recursive ...read more

Dynamic Programming

DSA

DP Problems on MathsFibonacci NumbersTribonacci NumbersLucas NumberBinomial CoefficientPascal's Triangle GenerationNth Row of Pascal TriangleCatalan Number Matrix Chain Mu...read more

Interview Experiences

Dynamic Programming

DSA

Dynamic Programming is a commonly used algorithmic technique used to optimize recursive solutions when same subproblems are called again.The core idea behind DP is to stor...read more

Dynamic Programming

Python

Python-DSA

Dynamic Programming (DP) is a method used to solve optimization problems by breaking them down into simpler subproblems and solving each subproblem just once, storing the ...read more

Dynamic Programming

DSA

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy PolicyGot It !