Leetcode 2300. Successful Pairs of Spells and Potions

For each spell, count how many potions produce a product >= success by computing the minimum required potion strength and efficiently counting qualifying potions (typically by sorting the potions and using binary search). This reduces the problem to repeated threshold lookups rather than checking all pairs.