LeetCode 2300: Successful Pairs of Spells and Potions Solution

Master LeetCode problem 2300 (Successful Pairs of Spells and Potions), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2300. Successful Pairs of Spells and Potions

Medium

Array Two Pointers Binary Search Sorting

Problem Explanation

Explanation:

To solve this problem, we can iterate over each spell and potion pair and check if the product of their strengths is greater than or equal to the given success value. We can do this efficiently by sorting the spells and potions arrays in non-decreasing order and then using two pointers approach to find the number of successful pairs for each spell.

Sort the spells and potions arrays.
Initialize a pointer i for spells and a pointer j for potions.
For each spell, increment the j pointer until the product of spells[i] and potions[j] is less than success. The count of successful pairs for that spell will be equal to j.
Repeat this process for all spells.
Return the array containing counts of successful pairs for each spell. :

Solution Code

import java.util.Arrays;

class Solution {
    public int[] successfulPairs(int[] spells, int[] potions, int success) {
        Arrays.sort(spells);
        Arrays.sort(potions);
        
        int[] pairs = new int[spells.length];
        int j = 0;
        
        for (int i = 0; i < spells.length; i++) {
            while (j < potions.length && spells[i] * potions[j] < success) {
                j++;
            }
            pairs[i] = j;
        }
        
        return pairs;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2300 (Successful Pairs of Spells and Potions)?

This page provides optimized solutions for LeetCode problem 2300 (Successful Pairs of Spells and Potions) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2300 (Successful Pairs of Spells and Potions)?

The time complexity for LeetCode 2300 (Successful Pairs of Spells and Potions) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2300 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2300 in Java, C++, or Python.

Back to LeetCode Solutions