Easy way | JavaScript | 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)$$ -->\n    O(n^2)\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n# Code\n```javascript []\nvar countPairs = function(nums, target) {\n    let count = 0;\n    for(let i=0; i<nums.length; i++) {\n        for(let j=i+1; j<nums.length; j++) {\n            if(nums[i]+nums[j] < target) count++;\n        }\n    }\n    return count;\n};\n```\n```C++ []\nclass Solution {\npublic:\n    int countPairs(vector<int>& nums, int target) {\n        int count = 0;\n        for(int i=0; i<nums.size(); i++) {\n            for(int j=i+1; j<nums.size(); j++) {\n                if(nums[i]+nums[j] < target) count++;\n            }\n        }\n        return count;\n    }\n};\n```\n
['C++', 'JavaScript']