#473

Matchsticks to Square

specialist · 990 · lc medium +32 · verified · 41.6% accepted · 4,022 likes · top 22%

Description

Given an integer array matchsticks where each element is a stick length, use every stick exactly once (linking end-to-end is fine, but no breaking) to try to form a square. Return true if a square can be formed, false otherwise.

Example 1:

Input: matchsticks = [1,1,2,2,2]

Output: true

Explanation: You can form a square with length 2, one side of the square came two sticks with length 1.

Example 2:

Input: matchsticks = [3,3,3,3,4]

Output: false

Explanation: You cannot find a way to form a square with all the matchsticks.

Code

1

2

3

class Solution:
    def makesquare(self, matchsticks: List[int]) -> bool:

class Solution:
    def makesquare(self, matchsticks: List[int]) -> bool: