LC-1925 Easy LeetCode

1925. Count Square Sum Triples

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 69% Topics: Math, Enumeration

Reading material

Math & Geometry 12 min Backtracking 14 min

Reference solution (spoiler · python)

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

class Solution(object):
    def countTriples(self, n):
        """
        :type n: int
        :rtype: int
        """
        lookup = set()
        for i in xrange(1, n+1):
            lookup.add(i**2)
        result = 0
        for i in xrange(1, n+1):
            for j in xrange(1, n+1):
                result += int(i**2+j**2 in lookup)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT