Computer Science · Dynamic Programming
In a risk assessment model, you need to partition an array of asset returns into two subsets with sums as equal as possible, using a recursive approach with memoization to avoid recomputing subproblem results for different subset sizes. This dynamic programming variant solves the partition problem in pseudo-polynomial time of:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n × S/2) where S is the total sum✓
- 2O(2n)
- 3O(n log n)
- 4O(n)
Correct answer
O(n × S/2) where S is the total sum
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Dynamic Programming MCQs →Want more practice questions on Dynamic Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Dynamic Programming