Matchsticks to Square Problem | Dataford Interview Questions

Matchsticks to Square (LeetCode 473).

Asked in the video interview stage. Given integer matchstick lengths, determine whether every matchstick can be used exactly once to form the four equal sides of a square.

Input and Output

Implement makesquare(matchsticks), accepting a list of positive integers and returning a boolean.

Constraints

4 <= len(matchsticks) <= 15
1 <= matchsticks[i] <= 10^8
Every matchstick must be used exactly once

Function Signature

def makesquare(matchsticks):

Your question is Matchsticks to Square Problem. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem