Approach:

First use a for loop and traverse through every pair in the vector.
Then use another for loop and check if the symmetric pair of that pair is present in the rest of the vector or not.
If the symmetric pair is present print the pair and break from the second for loop.so as to avoid repetitive printing of answers in case of duplicate pair.
If the symmetric pair is not present,move to the next pair.

Code

#include <bits/stdc++.h>
using namespace std;

class Solution {
public:
    // Function to find and print symmetric pairs
    void findSymmetricPairs(int arr[][2], int n) {
        cout << "The Symmetric Pairs are: " << endl;

        // Nested loop to check for symmetric pairs
        for (int i = 0; i < n; i++) {
            for (int j = i + 1; j < n; j++) {
                if (arr[j][0] == arr[i][1] && arr[j][1] == arr[i][0]) {
                    cout << "(" << arr[i][1] << " " << arr[i][0] << ")" << " ";
                    break;
                }
            }
        }
    }
};

int main() {
    int n = 5;
    int arr[][2] = {{1, 2}, {2, 1}, {3, 4}, {4, 5}, {5, 4}};  // Example input

   