Dynamic Programming 面接の質問と回答
質問 6. 0/1 Knapsack Problem
Given weights and values of items, find the maximum value that can be obtained by selecting a subset of items with total weight not exceeding a given limit.
Example:
Weights: [2, 3, 4, 5], Values: [3, 4, 5, 6], Knapsack Capacity: 5, Output: 11
役に立ちましたか？
コメントを追加
コメントを見る
質問 7. Longest Common Subsequence (LCS)
Given two sequences, find the length of the longest subsequence present in both of them.
Example:
Input: ABCBDAB, BDCAB, Output: 4 (BCAB)
役に立ちましたか？
コメントを追加
コメントを見る
質問 8. Rod Cutting Problem
Given a rod of length n and prices at which different lengths of the rod can be sold, find the maximum value obtainable by cutting up the rod.
Example:
Lengths: [1, 2, 3, 4, 5], Prices: [1, 5, 8, 9, 10], Rod Length: 4, Output: 10
役に立ちましたか？
コメントを追加
コメントを見る
質問 9. Palindrome Partitioning
Given a string, partition it into as many palindromic substrings as possible.
Example:
Input: aab, Output: [['a', 'a', 'b'], ['aa', 'b']]
役に立ちましたか？
コメントを追加
コメントを見る
質問 10. Unique Paths
A robot is located at the top-left corner of a m x n grid. It can only move either down or right. Find the number of unique paths to reach the bottom-right corner.
Example:
Input: m = 3, n = 7, Output: 28
役に立ちましたか？
コメントを追加
コメントを見る
ユーザー評価で最も役立つ内容: