#bitmanipulation

Akshat Singhakshatsingh
2024-11-07

β˜‘οΈ Day 40/100: daily question

🟨 Question: 2275. Largest Combination With Bitwise AND Greater Than Zero

This was an easy one for medium and I solved it using index bit count.

πŸˆβ€β¬› Check out my where I post all the daily streak πŸ”₯ questions and πŸ† solutions

πŸ”— Solution Link: github.com/akshatsingh1718/lee

πŸ”— My Leetcode Github: github.com/akshatsingh1718/lee

Akshat Singhakshatsingh
2024-11-06

β˜‘οΈ Day 39/100: daily question

🟨 Question: 3011. Find if Array Can Be Sorted

This was an easy one for medium and I solved it using bubble sort.

πŸˆβ€β¬› Check out my where I post all the daily streak πŸ”₯ questions and πŸ† solutions

πŸ”— Solution Link: github.com/akshatsingh1718/lee

πŸ”— My Leetcode Github: github.com/akshatsingh1718/lee

Akshat Singhakshatsingh
2024-09-17

πŸ‘‹ Hi everyone! recently, I was solving a LeetCode problem, β€œFind the Longest Substring Containing Vowels in Even Counts”, and came across an incredibly efficient solution using bit masking. Let me break down the journey step by step.πŸ‘‡
πŸ“Ž See blog post: medium.com/@akshat.singh1718/h

Akshat Singhakshatsingh
2024-09-11

πŸ§‘β€πŸŽ“Learning new things on
is essential! πŸš€ Today, from , I discovered Brian Kernighan’s Algorithm, which efficiently counts (bits set to 1) in nearly O(1) πŸ”₯ time βŒ›. Super handy for ! πŸ’‘

2023-05-01

Curious about basic bit manipulation and bitwise operations? Check out this little learning tool I built to help folks develop better intuition for 1's, 0's, and other low-level delectables! www.bitsbud.com

Client Info

Server: https://mastodon.social
Version: 2025.04
Repository: https://github.com/cyevgeniy/lmst