Matchsticks to Square
Medium
Bitmask DP
Given the lengths of matchsticks, print true if all of them can be used exactly once to form a square (no stick may be broken).
Constraints
1 <= n <= 15 1 <= length <= 10^8
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.