Medium data structure and algorithm practice puzzle.
Given an array of votes, 1 for yes and 0 for no, return true only if yes wins a STRICT majority. A tie fails. Add up the votes and check whether twice the yes count is more than the total. Doubling instead of dividing keeps you from losing the remainder on an odd number of votes.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Clause Ledger Balancer, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles