#bit manipulation

12/100: I studied a good bit and my interview went well, I think! I realized that there was a better way to solve the problem after the interview. So, I went and implemented that and emailed the better solution to my interviewer. I felt good about studying and really knowing my stuff. 

Stationery:

BIC brite liner in Green

Pilot G-2 0.7 in Teal 

Dayal (4G) 0.5mm in Black 

[LeetCode] #338 – Counting bit (đếm bit)

Đề bài Link gốc leet code: https://leetcode.com/problems/counting-bits/ Cho 1 số n. In ra 1 mảng là số lượng bit 1 của các số từ 0 đến n. VD: n = 4 0 = 0000 -> có 0 bit 1 1 = 0001 -> có 1 bit 1 2 = 0010 -> có 1 bit 1 3 = 0011 -> có 2 bit 1 4 = 0100 -> có 1 bit 1 => Kết quả: [0, 1, 1, 2, 1] Continue reading