LeetCode 338: Counting Bits
Command Palette
Search for a command to run...
Comments
Join the discussionNo comments yet. Be the first to comment.
More from this blog
LeetCode 153. Find Minimum in Rotated Sorted Array
Question Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [4,5,6,7,0,1,2] if it was rotated 4 times. [0,1,2,4,5,6,7] if it was rotated 7 times. No...
Jun 29, 20254 min read
LeetCode 268: Missing Number
class Solution { public: int missingNumber(vector<int>& nums) { int result = nums.size(); for (int i = 0; i < nums.size(); i++) { result ^= i ^ nums[i]; } return result; } }; Question Given an ar...
Jun 27, 20252 min read
LeetCode 191. Number of 1 Bits
Problem Overview The goal is to write a function that takes an unsigned integer and returns the number of ‘1’ bits it has in its binary representation. This value is also known as Hamming weight. This is the classic bit manipulation problem. Solution...
Jun 12, 20252 min read
Bruce Lin
4 posts