Given an integer array, matchsticks, where matchsticks[i] is the length of the $ith$ matchstick. Use every single matchstick to create a square. No stick should be broken, although they can be connected, and each matchstick can only be used once.

Return TRUE if we can make this square; otherwise, return FALSE.

Constraints:

• $1 \leq$ matchsticks.length $\leq 15$

• $1 \leq$ matchsticks[i] $\leq 10^3$

Implement your solution in the following coding playground.