Skip to main content
Admissions guidance, study banks, and career tools — get started on Shalyam

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.

Rewards · v2.1

Get Exclusive Insights with Every Issue

Join Shalyam Newsletter

Stay ahead in education, research, and innovation—straight to your inbox.