LeetCode 2744: Find Maximum Number of String Pairs Solution

Master LeetCode problem 2744 (Find Maximum Number of String Pairs), a easy 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.

2744. Find Maximum Number of String Pairs

Easy

Array Hash Table String Simulation

Problem Explanation

Explanation:

To solve this problem, we can iterate through the given array of words and check for each word if its reverse exists in the array. If it does, we can pair these two words together. We will keep track of the maximum number of pairs we can form.

Here is the step-by-step algorithm:

Initialize a variable maxPairs to 0 to keep track of the maximum number of pairs.
Iterate through each word in the array.
For each word, reverse it and check if the reversed word exists in the array.
If the reversed word exists, pair these two words together and increment maxPairs by 1.
Return the final maxPairs as the result.

Time complexity: O(n^2) where n is the number of words in the array. Space complexity: O(1) as we are using a constant amount of extra space.

Solution Code

class Solution {
    public int maxNumOfPairs(String[] words) {
        int maxPairs = 0;
        
        for (int i = 0; i < words.length; i++) {
            String reversedWord = new StringBuilder(words[i]).reverse().toString();
            for (int j = i + 1; j < words.length; j++) {
                if (words[j].equals(reversedWord)) {
                    maxPairs++;
                    break;
                }
            }
        }
        
        return maxPairs;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2744 (Find Maximum Number of String Pairs)?

This page provides optimized solutions for LeetCode problem 2744 (Find Maximum Number of String Pairs) 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 2744 (Find Maximum Number of String Pairs)?

The time complexity for LeetCode 2744 (Find Maximum Number of String Pairs) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2744 on DevExCode?

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

Back to LeetCode Solutions