Medium

Quiz

#473 Matchsticks to Square

APPROACH

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.

1 of 4

1:00

What is the optimal approach for this problem?