Matchsticks to Square

Try to solve the Matchsticks to Square problem.

Statement

Given an integer array, matchsticks, where matchsticks[i] is the length of the ithith 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:

  • 11 \leq matchsticks.length 15\leq 15
  • 11 \leq matchsticks[i] 108\leq 10^8

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy