JAVA EASY SOLUTION
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)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int numOfPairs(String[] nums, String target) {\n        int n = nums.length;\n        int ans=0;\n        for(int i =0;i<n;i++){\n            for(int j =0; j<n;j++){\n                if( i != j){\n                    String str = nums[i] + nums[j];\n                    if (str.equals(target)){\n                        ans++;\n                    }\n                }\n            }\n        }\n        return ans;\n        \n    }\n}\n```
['Java']