Matchstick square
Given matchstick lengths, determine whether you can use every matchstick exactly once to form the four equal-length sides of a square (you may not break a matchstick). 1 <= len(matchsticks) <= 12, lengths are positive. Return a boolean.
Implement
makesquare(matchsticks: list[int]) → boolExamples
in
[[1,1,2,2,2]]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 28 min
solution.py
InputExpectedGot
[[1,1,2,2,2]]truenot run yetsample