The Tech Stack

A developer is looking at a sequence of coding tasks. Each task has a 'technology tag' (an integer) and a 'point value'. The developer wants to pick the longest continuous sequence of tasks such that they work with at most K distinct technologies, but the total point value of the tasks in the window must be at least P. If no such window exists, output 0. Example: Input: 5 2 10 1 2 1 2 3 5 5 5 5 20 Output: 4 Explanation: K=2, P=10. Tags are [1, 2, 1, 2, 3] and points are [5, 5, 5, 5, 20]. The sequence of tags [1, 2, 1, 2] has 2 distinct technologies and 20 points. Length is 4.