Matchsticks to Square
Try to solve the Matchsticks to Square problem.
We'll cover the following
Statement
Given an integer array, matchsticks
, where matchsticks[i]
is the length of the 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 and FALSE otherwise.
Constraints:
-
matchsticks.length
-
matchsticks[i]
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.