Topic: Dynamic-programming-question / Level: Beginner

• 31. Write a program to find the minimum cost to cut a rod into pieces of given lengths.
• 32. Create a function to determine the number of binary search trees that can be formed with n nodes.
• 33. Implement a program to find the maximum length of a subarray with at most k distinct elements.
• 34. Write a function to count the number of ways to fill a knapsack with given weights.
• 35. Create a program to find the longest path in a directed acyclic graph (DAG).
• 36. Implement a function to find the minimum number of squares that sum to a given number.
• 37. Write a program to find the maximum sum of a subarray that does not contain a certain element.
• 38. Create a function to find the number of ways to arrange parentheses in a valid manner.
• 39. Implement a program to find the maximum value of an expression that can be obtained using the numbers in an array.
• 40. Write a function to compute the longest common subsequence of three strings.
• 41. Create a program to find the minimum number of operations to convert one string to another.
• 42. Implement a function to find the maximum weight independent set in a tree.
• 43. Write a program to find the number of ways to climb stairs with a variable number of steps allowed at a time.
• 44. Create a function to find the maximum sum of a non-circular subarray.
• 45. Implement a program to find the maximum sum of k non-overlapping intervals.
• 46. Write a function to find the longest subsequence of a given sum in an array.
• 47. Create a program to find the minimum number of characters to be added to make a string a palindrome.
• 48. Implement a function to determine if a sequence of parentheses is valid.
• 49. Write a program to find the longest increasing path in a matrix.
• 50. Create a function to compute the minimum number of steps to reduce a number to zero.
• 51. Implement a program to find the longest alternating subsequence in an array.
• 52. Write a function to find the minimum path sum from top to bottom in a triangle.
• 53. Create a program to count the number of distinct ways to arrange n items with duplicates.
• 54. Implement a function to find the number of ways to tile a 2xn board with 1x2 dominoes.
• 55. Write a program to compute the maximum area of a rectangle in a binary matrix.
• 56. Create a function to find the minimum number of coins needed for change using dynamic programming.
• 57. Implement a program to determine the number of ways to distribute n identical balls into k distinct boxes.
• 58. Write a function to compute the longest path in a weighted directed graph.
• 59. Create a program to find the maximum sum of increasing subsequence in an array.
• 60. Implement a function to find the longest common substring of two strings.

• More Levels

• Intermediate
• Advanced