[Leetcode] 2367. Number of Arithmetic Triplets

https://leetcode.com/problems/number-of-arithmetic-triplets

LeetCode - The World's Leading Online Programming Learning Platform

class Solution:
    def arithmeticTriplets(self, nums: List[int], diff: int) -> int:
        count = 0

        for n in range(2, len(nums)):
            i = nums[n] - diff
            j = nums[n] - (2 * diff)
            
            if i in nums and j in nums:
                count += 1

        return count