Microsoft | E-Book provider | Coding assessment | 17th july 2025

  An e-book provider offers a variety of programming articles, each with a distinct intellectual value. Readers earn points equal to an article's intellectual value for each article read twice. Given a list of articles with their page lengths, intellectual value coefficients, and a daily page limit, find the maximum achievable intellectual value in one day. Example iv = [2, 4, 4, 5] articles = [2, 2, 3, 4] p = 15 There are n = 4 articles with lengths ...