your average approach
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nwell there are two cond
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nwell there are two conditions to be followed , \n1: i < j\n2: nums[i]+nums[j] < target\n\nso the first for loop is for iterating throught the elements of nums and the second for loop is for iterating through the elements of nums keeping in mind (i<j) we made it possible by let j = 1 + i. And at last increment the count when the condition is met .\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```\n/**\n * @param {number[]} nums\n * @param {number} target\n * @return {number}\n */\nvar countPairs = function(nums, target) {\n    let count = 0\n    for(let i = 0 ; i < nums.length-1 ; i++){\n        for(let j = 1+i ; j < nums.length; j++){\n            if(nums[i]+nums[j]<target){\n                count++\n            }\n        }\n    }\n    return count\n};\n```
['JavaScript']