Easy Kotlin
Intuition\nEasy Kotlin Solution\n Describe your first thoughts on how to solve this problem. \n\n# Approach\nAdd nums[i] and nums[j] and compare with the target
# Intuition\nEasy Kotlin Solution\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nAdd nums[i] and nums[j] and compare with the target.\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(n^2)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    fun countPairs(nums: List<Int>, target: Int): Int {\n        var count = 0\n\n        for(i in 0 until nums.size-1) {\n            for(j in i+1 until nums.size) {\n                if(nums[i] + nums[j] < target) {\n                    count++\n                }\n            }\n        }\n\n        return count\n    }\n}\n```
['Kotlin']