Given an array of `n` integers `nums` and an int `target`, find the number of index triplets `i, j, k` with `0 <= i < j < k < n` that satisfy the condition `nums[i] + nums[j] + nums[k] > target`.\n\n**Example:**\n```\nInput: nums = [2, 1, 3, 0, 3], target = 5\nOutput: 5\nExplanation:\n[0, 3, 3]\n[1, 3, 3]\n[1, 2, 3]\n[1, 2, 3]\n[2, 3, 3]\n```\n\nRelated problems:\n* https://leetcode.com/problems/3sum-smaller (premium)

Given an array of n integers nums and an int target, find the number of index triplets i, j, k with 0 <= i < j < k < n that satisfy the condition nums[i] + nums