added blogs #1901
Closed
added blogs #1901
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
|
Thank you for submitting your pull request! 🙌 We'll review it as soon as possible.). If there are any specific instructions or feedback regarding your PR, we'll provide them here. Thanks again for your contribution! 😊 |
ajay-dhangar
added
gssoc-ext
ajay-dhangar
requested changes
Nov 9, 2024
| 2. **OR (|)**: Sets each bit to 1 if one of the bits is 1. | ||
| 3. **XOR (^)**: Sets each bit to 1 if only one of the bits is 1. | ||
| 4. **NOT (~)**: Inverts all bits. | ||
| 5. **Shift Left (<<)**: Shifts bits to the left, filling with 0s. |
There was a problem hiding this comment.
replace << with `<<` or <<
| 3. **XOR (^)**: Sets each bit to 1 if only one of the bits is 1. | ||
| 4. **NOT (~)**: Inverts all bits. | ||
| 5. **Shift Left (<<)**: Shifts bits to the left, filling with 0s. | ||
| 6. **Shift Right (>>)**: Shifts bits to the right, filling with the sign bit. |
There was a problem hiding this comment.
replace >> with `>>` or >>
Comment on lines
+51
to
+54
|
|
||
| def is_odd(n): | ||
| return (n & 1) == 1 | ||
|
|
Comment on lines
+57
to
+59
|
|
||
| def set_bit(n, i): | ||
| return n | (1 << i) |
Comment on lines
+62
to
+65
|
|
||
| def clear_bit(n, i): | ||
| return n & ~(1 << i) | ||
|
|
Comment on lines
+78
to
+84
| def count_set_bits(n): | ||
| count = 0 | ||
| while n: | ||
| n &= (n - 1) # Clear the least significant bit set | ||
| count += 1 | ||
| return count | ||
|
|
Comment on lines
+86
to
+87
| print(count_set_bits(13)) # Output: 3 (binary: 1101) | ||
|
|
Comment on lines
+89
to
+103
| public class BitManipulation { | ||
| // Count set bits in an integer | ||
| public static int countSetBits(int n) { | ||
| int count = 0; | ||
| while (n > 0) { | ||
| n &= (n - 1); // Clear the least significant bit set | ||
| count++; | ||
| } | ||
| return count; | ||
| } | ||
|
|
||
| public static void main(String[] args) { | ||
| System.out.println(countSetBits(13)); // Output: 3 (binary: 1101) | ||
| } | ||
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
📥 Pull Request
Description
Please include a summary of the change and which issue is fixed. Please also include relevant motivation and context. List any dependencies that are required for this change.
Fixes # (1748)
Type of change
Checklist: