#3569

Maximize Count of Distinct Primes After Split

grandmaster · 2240 · lc hard +32 · 18.4% accepted · 24 likes · top 1%

Description

Given integer array nums and queries [idx, val], each query updates nums[idx] = val (persistently), then asks: choose a split point k (1 <= k < n) to divide nums into a prefix and suffix. Maximize the total count of distinct prime values across both parts.

Return an array of the maximum values, one per query.

Code

1

2

3

class Solution:
    def maximumCount(self, nums: List[int], queries: List[List[int]]) -> List[int]:

class Solution:
    def maximumCount(self, nums: List[int], queries: List[List[int]]) -> List[int]: