Leetcode 1421. NPV Queries

Given an array of periodic cash flows and a fixed discount rate, answer multiple queries asking for the net present value of a subarray (the discounted sum of its cash flows using powers of 1+rate). The key is to precompute discount-factor powers and prefix-weighted sums so each query reduces to O(1) arithmetic.