Number of Pairs of Strings With Concatenation Equal to Target Solution in C++
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\nO(n^2)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nclass Solution {\npublic:\n    int numOfPairs(vector<string>& nums, string target) {\n        int i, j, count=0;\n        for(i=0 ; i<nums.size() ; i++)\n        {\n            for(j=0 ; j<nums.size() ; j++)\n            {\n                if(i!=j && nums[i]+nums[j]==target)\n                {\n                    count++;\n                }\n            }\n        }\n        return count;\n    }\n};\n```\n![upvote new.jpg](https://assets.leetcode.com/users/images/62ba077e-9a6f-4790-841c-95e336489f2b_1683772356.124512.jpeg)\n
['C++']