3 docs tagged with "Bitmask"

This is a solution to the Binary Number with Alternating Bits problem on LeetCode.

This document provides a solution where we return the minimum cost to connect the two groups.

This document provides a solution where we split an array into two non-empty subsets such that both subsets have the same average.