Tag feed

#bit-manipulation

58 posts1 followers

Explore Hashnode

Alternatives

Trending tags this week

JTJeff Tongwind010.hashnode.devJun 5 · 8 min read

Dog Medication Tracking

Our Alaskan Malamute Tsuki has hypothyroidism (hypo, meaning under or below, thanks ChubbyEmu). This is something my partner discovered. Alaskan Malamutes are highly predisposed to hypothyroidism. Upo

0

KKshitijbitseries.hashnode.devJun 2 · 7 min read

Inside XOR: Beyond Bit Manipulation

This article is part of my Bit Manipulation Series. If you want more bit manipulation tips, tricks, and problem-solving patterns, explore the full series here: 🔗 Bit Manipulation Series: In this arti

0

CCosmoscosmoscribe.hashnode.devJan 21 · 9 min read

Cuckoo Filters vs. Bloom Filters: Let’s Take it Easy

Ok, before we go into the depths of these concepts, I want to tell you that we will take it easy. I don’t want you to get overwhelmed about the topics and the depth of the discussion. Bloom Filters A Bloom filter is a space-efficient probabilistic d...

0

CDChetan Dattachetan77.hashnode.devJan 15 · 2 min read

Maximum XOR of Two Numbers in an Array

Problem Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n. (link) Example 1: Input: nums = [3,10,5,25,2,8] Output: 28 Explanation: The maximum result is 5 XOR 25 = 28. Example 2: Input: nums = [14,7...

0

BKBhavadharani Kbits101.hashnode.devDec 16, 2025 · 5 min read

Bit Manipulation

🧠 Bit Manipulation — The Complete Guide (From Basics to Interviews) Bit manipulation is one of those topics that looks scary, feels tricky, but is actually small, logical, and extremely powerful once the mental model clicks. This article covers ever...

0

AHAnni Huanghuanganni.hashnode.devJul 13, 2025 · 5 min read

LeetCode 421 Maximum XOR of Two Numbers in an Array(Med, Java, O(n))

Problem Description LeetCode 421 Maximum XOR of Two Numbers in an Array Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 ≤ i ≤ j < n. Example 1: Input: nums = [3,10,5,25,2,8] Output: 28 Explanation: The maximum...

0

AHAnni Huanghuanganni.hashnode.devJul 11, 2025 · 7 min read

LeetCode Problem 1356 Sort Integers by The Number of 1 Bits (Easy, Java, O(nlogn))

Let’s dive into explaining the solution for LeetCode Problem 1356: Sort Integers by The Number of 1 Bits, covering the problem requirements, the provided code’s functionality, a complexity analysis, and verifying the solution’s correctness. The code ...

0

AHAnni Huanghuanganni.hashnode.devJul 4, 2025 · 6 min read

LeetCode Daily Challenge-3304. Find the K-th Character in String Game I(Easy)

LeetCode Link Date: 3rd July 2025 Topics: Math, Bit Manipulation, Recursion, Simulation Problem Understanding LeetCode 3304 presents an interesting string transformation game where Alice starts with "a" and repeatedly applies an operation: for each ...

0

DGDorcas Grimexpertbitcoinrecovery.hashnode.devMay 6, 2025 · 1 min read

Hire The Best Certified Hacker For Crypto Recovery // Wizard Larry Recovery

Hire The Best Certified Hacker For Crypto Recovery // Wizard Larry Recovery Contact Wizard Larry Recovery: Text Call / Whatsp +447 (311) 146 749.Email; Wizardlarry (@) mail . (com)Web: larrywizard43.wixsite.com/wizardlarry Scams and fraud have beco...

0

ASAsif Siddiquesemi-colon.hashnode.devApr 7, 2025 · 6 min read

How Computers Store Numbers: Binary and Beyond

Introduction Of course computer understand everything. They’re computers, duh. You type 5, they see 5… right? Nope. That would be too easy. Behind the scenes, your fancy computer - the one that runs billion-dollar apps and plays vital 4K Netflix - ha...