Looks like many folks found the last challenge too easy. Here’s one to up the ante!
1 Like
Is the Question meant to be so fussy, my core logic involves bitwise operators only (take each bit and check the number of time it appears modulo3 to filter out repeating numbers) but system fails it for
count += (arr[j] >> i) & 1;
Yeah you’re still doing additions (do we know how to do it using only bitwise operations?)! You are going in the correct direction though