← All problemsSign in

Square from matchsticks

Chef is bored at home and only has a matchbox with him. He considers the matches as an integer array containing N matchsticks, where matchsticks[i] is the length of the ith matchstick. Chef wants to use all the matchsticks in the matchbox to make one square. He can't break any stick, but can link them up, and each matchstick must be used exactly one time. Return true if chef can make this square

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start