LC-2367 Easy LeetCode

2367. Number of Arithmetic Triplets

Array Hash Table Two Pointers Enumeration

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 85% Topics: Array, Hash Table, Two Pointers, Enumeration

Reading material

Arrays & Hashing 12 min Two Pointers 9 min Backtracking 14 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(n)

# hash table
class Solution(object):
    def arithmeticTriplets(self, nums, diff):
        """
        :type nums: List[int]
        :type diff: int
        :rtype: int
        """
        lookup = set(nums)
        return sum((x-diff in lookup) and (x-2*diff in lookup) for x in nums)

    
# Time:  O(n)
# Space: O(n)
import collections


# dp
class Solution2(object):
    def arithmeticTriplets(self, nums, diff):
        """
        :type nums: List[int]
        :type diff: int
        :rtype: int
        """
        result = 0
        cnt1 = collections.Counter()
        cnt2 = collections.Counter()
        for x in nums:
            result += cnt2[x-diff]
            cnt2[x] += cnt1[x-diff]
            cnt1[x] += 1
        return result

Solution from kamyu104/LeetCode-Solutions · MIT