← Microsoft questions

Maximize subsequence score under constraints

Filed under Microsoft

You are given two integer arrays nums1 and nums2 of length n and an integer k. You need to find a subsequence of length k from indices [0, n-1] such that the score is maximized. The score is defined…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.