379 |
Coin ChangeProblem |
GeeksForGeeks |
0 |
0 |
0 |
- |
380 |
Knapsack Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
381 |
Binomial CoefficientProblem |
GeeksForGeeks |
0 |
0 |
0 |
- |
382 |
Permutation CoefficientProblem |
GeeksForGeeks |
0 |
0 |
0 |
- |
383 |
Program for nth Catalan Number |
GeeksForGeeks |
0 |
0 |
0 |
- |
384 |
Matrix Chain Multiplication |
GeeksForGeeks |
0 |
0 |
0 |
- |
385 |
Edit Distance |
GeeksForGeeks |
0 |
0 |
0 |
- |
386 |
Subset Sum Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
387 |
Friends Pairing Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
388 |
Gold Mine Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
389 |
Assembly Line SchedulingProblem |
GeeksForGeeks |
0 |
0 |
0 |
- |
390 |
Painting the Fence problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
391 |
Maximize The Cut Segments |
GeeksForGeeks |
0 |
0 |
0 |
- |
392 |
Longest Common Subsequence |
GeeksForGeeks |
0 |
0 |
0 |
- |
393 |
Longest Repeated Subsequence |
GeeksForGeeks |
0 |
0 |
0 |
- |
394 |
Longest Increasing Subsequence |
GeeksForGeeks |
0 |
0 |
0 |
- |
395 |
Space Optimized Solution of LCS |
GeeksForGeeks |
0 |
0 |
0 |
- |
396 |
LCS (Longest Common Subsequence) of three strings |
GeeksForGeeks |
0 |
0 |
0 |
- |
397 |
Maximum Sum Increasing Subsequence |
GeeksForGeeks |
0 |
0 |
0 |
- |
398 |
Count all subsequences having product less than K |
GeeksForGeeks |
0 |
0 |
0 |
- |
399 |
Longest subsequence such that difference between adjacent is one |
GeeksForGeeks |
0 |
0 |
0 |
- |
400 |
Maximum subsequence sum such that no three are consecutive |
GeeksForGeeks |
0 |
0 |
0 |
- |
401 |
Egg Dropping Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
402 |
Maximum Length Chain of Pairs |
GeeksForGeeks |
0 |
0 |
0 |
- |
403 |
Maximum size square sub-matrix with all 1s |
GeeksForGeeks |
0 |
0 |
0 |
- |
404 |
Maximum sum of pairs with specific difference |
GeeksForGeeks |
0 |
0 |
0 |
- |
405 |
Min Cost PathProblem |
GeeksForGeeks |
0 |
0 |
0 |
- |
406 |
Maximum difference of zeros and ones in binary string |
GeeksForGeeks |
0 |
0 |
0 |
- |
407 |
Minimum number of jumps to reach end |
GeeksForGeeks |
0 |
0 |
0 |
- |
408 |
Minimum cost to fill given weight in a bag |
GeeksForGeeks |
0 |
0 |
0 |
- |
409 |
Minimum removals from array to make max –min <= K |
GeeksForGeeks |
0 |
0 |
0 |
- |
410 |
Longest Common Substring |
GeeksForGeeks |
0 |
0 |
0 |
- |
411 |
Count number of ways to reach a given score in a game |
GeeksForGeeks |
0 |
0 |
0 |
- |
412 |
Count Balanced Binary Trees of Height h |
GeeksForGeeks |
0 |
0 |
0 |
- |
413 |
LargestSum Contiguous Subarray [V>V>V>V IMP ] |
GeeksForGeeks |
0 |
0 |
0 |
- |
414 |
Smallest sum contiguous subarray |
GeeksForGeeks |
0 |
0 |
0 |
- |
415 |
Unbounded Knapsack (Repetition of items allowed) |
GeeksForGeeks |
0 |
0 |
0 |
- |
416 |
Word Break Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
417 |
Largest Independent Set Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
418 |
Partition problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
419 |
Longest Palindromic Subsequence |
GeeksForGeeks |
0 |
0 |
0 |
- |
420 |
Count All Palindromic Subsequence in a given String |
GeeksForGeeks |
0 |
0 |
0 |
- |
421 |
Longest Palindromic Substring |
LeetCode |
0 |
0 |
0 |
- |
422 |
Longest alternating subsequence |
GeeksForGeeks |
0 |
0 |
0 |
- |
423 |
Weighted Job Scheduling |
GeeksForGeeks |
0 |
0 |
0 |
- |
424 |
Coin game winner where every player has three choices |
GeeksForGeeks |
0 |
0 |
0 |
- |
425 |
Count Derangements (Permutation such that no element appears in its original position) [ IMPORTANT ] |
GeeksForGeeks |
0 |
0 |
0 |
- |
426 |
Maximum profit by buying and selling a share at most twice [ IMP ] |
GeeksForGeeks |
0 |
0 |
0 |
- |
427 |
Optimal Strategy for a Game |
GeeksForGeeks |
0 |
0 |
0 |
- |
428 |
Optimal Binary Search Tree |
GeeksForGeeks |
0 |
0 |
0 |
- |
429 |
Palindrome PartitioningProblem |
GeeksForGeeks |
0 |
0 |
0 |
- |
430 |
Word Wrap Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
431 |
Mobile Numeric Keypad Problem [ IMP ] |
GeeksForGeeks |
0 |
0 |
0 |
- |
432 |
Boolean Parenthesization Problem |
GeeksForGeeks |
0 |
0 |
0 |
- |
433 |
Largest rectangular sub-matrix whose sum is 0 |
GeeksForGeeks |
0 |
0 |
0 |
- |
434 |
[Largest area rectangular sub-matrix with equal number of 1’s and 0’s [ IMP ]]() |
GeeksForGeeks |
0 |
0 |
0 |
- |
435 |
Maximum sum rectangle in a 2D matrix |
GeeksForGeeks |
0 |
0 |
0 |
- |
436 |
Maximum profit by buying and selling a share at most k times |
GeeksForGeeks |
0 |
0 |
0 |
- |
437 |
Find if a string is interleaved of two other strings |
GeeksForGeeks |
0 |
0 |
0 |
- |
438 |
Maximum Length of Pair Chain |
LeetCode |
0 |
0 |
0 |
- |