EASY TO UNDERSTAND | BEGINNER FRIENDLY | 3ms Runtime | Beats 100% 🥷🏻🔥
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```csharp []
public class Solution {
    public int MaximumNumberOfStringPairs(string[] words) {
        int n = words.Length;
        int count = 0;

        for(int i = 0; i < n; i++){
            for(int j = i + 1; j < n; j++){
                if(words[i][0] == words[j][1] && words[i][1] == words[j][0]){
                    count++;
                }
            }
        }

        return count;
    }
}
```
['Array', 'Hash Table', 'String', 'Simulation', 'Java', 'C#', 'MS SQL Server']