Open saptarshisarkar20 opened 1 year ago
please assign this issue to me.
Please assign this to me
hey saptarshisarkar20 can you please assign this to me
Hey @saptarshisarkar20 I want to work on this issue...Please assign this issue to me
@saptarshisarkar20 I want to work on this issue...Please assign this to me
I wish to contribute. Kindly assign me this issue.
I want to contribute. Kindly assign me this issue.
Hello, I'm relatively new to open source and GitHub. I'm eager to learn and improve my skills, and I believe working on this issue will be a valuable experience for me. could you please assign it to me
I have solved the problem with all the given requirements. Please @saptarshisarkar20 review my code and suggest any changes that need to be done and accept my PR under the Hacktoberfest 2023 tag.
Kindly assign this task to me...
I want to work on this issue . Kindly assign this task to me.
Please assign it to me
Hey @saptarshisarkar20 , I am eager to contribute to the Counting Bits problem and request access to the respective repository. I am well-versed in dynamic programming and eager to provide valuable insights. Please assign Me to this Problem.
i want to contribute pls assign this to me
Hi I want to contribute to this issue.
Hello i would like to work on this problem would be nice if you could ad me to the assigment
hi saptarshisarkar20, can you please assign this to me?
Hi, can you please assign this to me?
What to Do?
Star π the repo Fork πΏ the repo Location Go to folder Pull Here/LeetCode/CountingBits
File name Take your GitHub username id like "hrithik339", "hacker-boy", etc or anything which you have. Then add a programming language extension after this (link for C++ add .cpp and for python add.py) Only files with the correct file name will be accepted
Problem Statement
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
Example 1:
Input: n = 2 Output: [0,1,1]
Example 2:
Input: n = 5 Output: [0,1,1,2,1,2]
Constraints:
0 <= n <= 105
Follow up:
It is very easy to come up with a solution with a runtime of O(n log n). Can you do it in linear time O(n) and possibly in a single pass? Can you do it without using any built-in function (i.e., like __builtin_popcount in C++)?
Function