#bitmanipulation نتائج البحث

🔍 LeetCode Daily: Two Sneaky Numbers ✅ 3 solutions: HashMap → Sorting → XOR magic! XOR approach = O(n) time, O(1) space. Elite optimization! ⚡ O(n) + O(1) = optimal 🎯 XOR cancels duplicates 💡 Bit manipulation mastery #LeetCode #CPlusPlus #BitManipulation #100DaysOfCode

🗓️ Day 92 of #100DaysOfDSA Continued my Bit Manipulation journey & practiced: 1️⃣ Check i-th bit set or not 2️⃣ Set/Clear/Toggle i-th bit 3️⃣ Remove last set bit Also solved : ▪️LeetCode POTD : 3289 - The Two Sneaky Numbers of Digitville #DSA #BitManipulation #LeetCode

🔥 Day 40 of my LeetCode Streak 🔥 Problem: 3356. Smallest Number With All Set Bits ≥ n 💡 Find the smallest 2^k - 1 ≥ n — done using a simple bit trick (x << 1) | 1. Bit magic ✨ | Consistency > Motivation 🚀 #LeetCode #100DaysOfCode #BitManipulation #CodingStreak

💡 LeetCode Daily: Smallest Number With All Set Bits ✅ Count bits, generate 2^k-1! If too small, bump to next power. Bit manipulation beauty. ⚡ O(log n) bit counting 🎯 Pattern: 1, 3, 7, 15, 31... 💡 (1 << k) - 1 = all 1s #LeetCode #CPlusPlus #BitManipulation #100DaysOfCode

🔥 LeetCode Daily | 100% Runtime Find the smallest number with all bits set greater than or equal to n 💡 ✅ Bit manipulation trick ✅ O(1) time | 0ms runtime #LeetCode #Python #BitManipulation #100DaysOfCode #Day61

✅ Day 129 of #150DaysOfDSA 📍 LC 3370: Smallest Number With All Set Bits Used bit manipulation — checked (x & (x + 1)) == 0 to find the smallest number ≥ n having all bits set to 1. Efficient and elegant! ⏱ O(1) | O(1) #BitManipulation #Math #Java #150DaysOfDSA ✨

✅ Day 123 of #150DaysOfDSA Worked on some cool bit manipulation problems today ⚡ 📍 LC 461 – Hamming Distance 📍 LC 477 – Total Hamming Distance 📍 LC 2220 – Minimum Bit Flips to Convert Number All about XOR, bits & differences 💡 #BitManipulation #XOR #DSA #CodingJourney

✅ Divide Two Integers ➗ (no *, /, or %) • Used bit shifts & subtraction • Optimized by doubling divisor (<<) • Handled sign & overflow carefully Bitwise math hits different 😎 #Day91 #DSA #BitManipulation #100DaysOfCode #LearningJourney

Day 90: Number Theory 🔢⚙️ ✅ Find Two Numbers Appearing Odd Times (XOR trick 🔥) ✅ Print All Prime Factors (√n optimization) ✅ Find All Divisors of a Number (loop till √n) Bit + Math = Pure Logic Power 💡 #Day90 #DSA #BitManipulation #Maths #100DaysOfCode #LearningJourney

Day 89: Bit Manipulation ⚙️ ✅ Set Rightmost Unset Bit ✅ Check if Number is Power of 2 ✅ Count Bits to Flip (A → B) ✅ Find Number Appearing Odd Times ✅ Power Set via Bitmasking ✅ XOR of Numbers from L ➝ R #Day89 #DSA #BitManipulation #100DaysOfCode #LearningJourney

Day 88: Bit Magic 🧠💡 ✅ Decimal ↔ Binary Conversion ✅ Bit Operators (AND, OR, XOR, NOT) ✅ Swap 2 Numbers using XOR 🔁 ✅ Check / Set / Clear / Toggle the i-th Bit ⚙️ Bits are the building blocks of brilliance 🧩 #Day88 #DSA #BitManipulation #100DaysOfCode #LearningJourney

🌟Day 178: Completed Bitmask and Bit Manipulation! Mastered bitmasking techniques and solved challenging problems: @LeetCode 51: N-Queens @atcoder: O-Matching @atcoder: 04_U Grouping Grateful to @isanketsingh for insights! #CodingJourney #BitManipulation #LeetCode #AtCoder

Day 35 of #LeetCode Daily 🚀 Bit manipulation grind today: 🔹 Single Number II → FSM with ones & twos → TC O(n), SC O(1) 🔹 Two Odd Occurring (GFG) → sorting + freq → TC O(n log n), SC O(1) 🔹 Find Closest Person → abs diff → TC O(1), SC O(1) #DSA #BitManipulation

Day 160 ✅ | #GFG160DaysOfCoding 📌 Find 2 Unique Numbers (Others Twice) 🔹 XOR all → gives xor of 2 uniques 🔹 Extract rightmost set bit → partition array 🔹 XOR in groups → get both numbers ⏱ O(N) | 💾 O(1) #BitManipulation #XOR #Arrays #DSA #GeekStreak2025

🔥 Day 15 Solved LC #POTD 2749: Min Ops to Make Integer Zero 👉 For i ops, target = num1 - i*num2 ✔️ target>0 ✔️ popcount(target) ≤ i ✔️ target ≥ i Check i∈[0..60]. O(60), pure bit trick! 🔗 leetcode.com/problems/minim… #LeetCode #BitManipulation #DSA #Coding #100DaysOfCode

✅ Day 123 of #150DaysOfDSA Worked on some cool bit manipulation problems today ⚡ 📍 LC 461 – Hamming Distance 📍 LC 477 – Total Hamming Distance 📍 LC 2220 – Minimum Bit Flips to Convert Number All about XOR, bits & differences 💡 #BitManipulation #XOR #DSA #CodingJourney

✅ Minimum Operations to Make the Integer Zero (Medium) Key insight: target = num1 - i*num2 Constraints: popcount(target) ≤ i ≤ target Math + bit manipulation magic! 🧮🔥 #LeetCode #100DaysOfCode #BitManipulation #Math

Day 45 of the #NeetCode150 Challenge! 🔸Focused on a single, clever Bit Manipulation problem today! 1. Counting Bits DevConnect - devconnect-app-ucu2.onrender.com GitHub - github.com/asthaade #NeetCode #BitManipulation #Bitwise #DSA

Day 46 of the #NeetCode150 Challenge! 🔸Solved two problems using Bit Manipulation! 1. Reverse Bits 2. Missing Number DevConnect - devconnect-app-ucu2.onrender.com GitHub - github.com/asthaade #NeetCode #BitManipulation #Bitwise #DSA

Day 47 of the #NeetCode150 Challenge! 🔸Solved two problems using Bit Manipulation! 1. Sum of Two Integers 2. Reverse Integer DevConnect - devconnect-app-ucu2.onrender.com GitHub - github.com/asthaade #NeetCode #BitManipulation #Bitwise #DSA

Day 44 of the #NeetCode150 Challenge! 🔸 Started a new section today Bit Manipulation! 1. Single Number 2. Number of 1 Bits DevConnect - devconnect-app-ucu2.onrender.com GitHub - github.com/asthaade #NeetCode #BitManipulation #Bitwise #DSA

🚀 Day 370 of Code 🚀 Solved : ✅ 2044. Count Number of Maximum Bitwise-OR Subsets #Day370 #LeetCode #BitManipulation #Backtracking #DSA #ProblemSolving #CodingDaily #100DaysOfCode

Day 35 contd. ⚡ Solved Single Number III in 4 ways: 1️⃣ Bit bucket → TC O(n), SC O(1) 2️⃣ Sorting + count → TC O(n log n), SC O(1) 3️⃣ Hashmap freq → TC O(n), SC O(n) 4️⃣ Sorting + skip pairs → TC O(n log n), SC O(1) #LeetCode #DSA #BitManipulation

🚀 Day 372 of Code 🚀 Solved : ✅ 898. Bitwise ORs of Subarrays #Day372 #LeetCode #BitManipulation #DSA #ProblemSolving #CodingDaily #TechLearning #SlidingWindow #SetOptimization #100DaysOfCode

🚀 Day 302 & 303 of Code 🚀 Solved : ✅ 231. Power of Two ✅ 29. Divide Two Integers ✅ Check if the i-th bit is set or not #Day303 #100DaysOfCode #BitManipulation #DSA #LeetCode #PowerOfTwo #CodingChallenge #ProblemSolving

🚀 Day 41 of #100DaysOfCoding 🚀 Today, I tackled Bit Manipulation: ✅ Divide two integers without multiplication, division, or mod operators Each challenge boosts my problem-solving skills and confidence! 💻✨ #BitManipulation #Java #CodingJourney #DSA #connect #letsconnect

Day 91: Bit Manipulation Problems 🔥 Today, I solved a few bit manipulation problems: ✅ Find XOR of Numbers from L to R ✅ Single Number III The XOR trick is especially useful for finding missing or unique numbers efficiently! 🚀 #100DaysOfCode #BitManipulation

🧠 Day 92 of LeetCode ✅ Solved: 137. Single Number II 💡 Topic: Bit Manipulation (Clean constant space trick!) 🧮 XOR + masking logic to filter out the element that appears only once #100DaysOfCode #LeetCode #BitManipulation #Cplusplus #CodingJourney #TechTwitter

🔁 Currently revising Recursion, so holding off on Dynamic Programming for now. ⚡ Meanwhile, starting Bit Manipulation #GFG160 #DSA #BitManipulation #RecursionRevision #FocusedLearning

🚀 Day 43 of #100DaysOfCoding 🚀 Focused on Bit Manipulation and solved: ✅ XOR of numbers from L to R ✅ Find two numbers with odd occurrences These challenges pushed my critical thinking and skills! 💻✨ #BitManipulation #Java #DSA #letsconnect #connect