Matchsticks form square
Given an array of integers matchsticks (length 1..15, each value 1..10^8), where each value is the length of a matchstick, determine whether you can use every matchstick exactly once, joining them end to end, to form a square (four sides of equal length). Matchsticks cannot be broken. 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 35 min
solution.py
InputExpectedGot
[[1,1,2,2,2]]truenot run yetsample