#bitmanipulation نتائج البحث
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 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
![DevSagarKrJha's tweet image. 🔥 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](https://pbs.twimg.com/media/G0EJtdLWAAAYoXR.jpg)
✅ 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 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
#100DaysOfCode – Day 58 🧮 Solved: Expression Add Operators ✅ Completed Recursion section (Striver’s Sheet) 🎯 ⚡ Started Bit Manipulation – covered basics: • Set/Unset i-th bit • Check Power of Two • Check if k-th bit is set #DSA #BitManipulation #WebDev #CodingJourney
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 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 372 of Code 🚀 Solved : ✅ 898. Bitwise ORs of Subarrays #Day372 #LeetCode #BitManipulation #DSA #ProblemSolving #CodingDaily #TechLearning #SlidingWindow #SetOptimization #100DaysOfCode
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 21 of solving DSA until I get proficient Problem-Minimum Bit Flips to Convert Number Takeaways-O(1) approach by applying mod 4 on each value of L-1 and R and Xor them. #DSA #Bitmanipulation #LearnInPublic #gfg160
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 370 of Code 🚀 Solved : ✅ 2044. Count Number of Maximum Bitwise-OR Subsets #Day370 #LeetCode #BitManipulation #Backtracking #DSA #ProblemSolving #CodingDaily #100DaysOfCode
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 22 of solving DSA problems until I get proficient Problem-Count Primes Takeaways-O(Nloglogn) Repeated division by each prime factor approach. #DSA #BitManipulation #Leetcode #LearnInpublic
🚀 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
🔁 Currently revising Recursion, so holding off on Dynamic Programming for now. ⚡ Meanwhile, starting Bit Manipulation #GFG160 #DSA #BitManipulation #RecursionRevision #FocusedLearning
✅ 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
Simple yet elegant — XOR always delivers! Next up: more bit manipulation problems 👀 #LeetCode #Java #BitManipulation #100DaysOfCode #CodingJourney #ProblemSolving #LeetCode75
💡 Life tip from bit manipulation: If something’s too much to handle, just AND it with 0. int stress = 999; stress = stress & 0; // Poof. Gone. Bit manipulation isn’t just a concept — it’s a coping mechanism. 🧘♂️💻 #Java #BitManipulation #CodingHumor #DevLife
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 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 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 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 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
✅ 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 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
#100DaysOfCode – Day 58 🧮 Solved: Expression Add Operators ✅ Completed Recursion section (Striver’s Sheet) 🎯 ⚡ Started Bit Manipulation – covered basics: • Set/Unset i-th bit • Check Power of Two • Check if k-th bit is set #DSA #BitManipulation #WebDev #CodingJourney
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 370 of Code 🚀 Solved : ✅ 2044. Count Number of Maximum Bitwise-OR Subsets #Day370 #LeetCode #BitManipulation #Backtracking #DSA #ProblemSolving #CodingDaily #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 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 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 372 of Code 🚀 Solved : ✅ 898. Bitwise ORs of Subarrays #Day372 #LeetCode #BitManipulation #DSA #ProblemSolving #CodingDaily #TechLearning #SlidingWindow #SetOptimization #100DaysOfCode
🚀 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
Day 22 of solving DSA problems until I get proficient Problem-Count Primes Takeaways-O(Nloglogn) Repeated division by each prime factor approach. #DSA #BitManipulation #Leetcode #LearnInpublic
Something went wrong.
Something went wrong.
United States Trends
- 1. Happy Birthday Charlie 41.6K posts
- 2. Good Tuesday 29.1K posts
- 3. #tuesdayvibe 3,049 posts
- 4. #Worlds2025 42K posts
- 5. #PutThatInYourPipe N/A
- 6. National Dessert Day N/A
- 7. Pentagon 72.5K posts
- 8. #TacoTuesday N/A
- 9. #TuesdayMotivation N/A
- 10. Victory Tuesday N/A
- 11. Janet Mills 1,389 posts
- 12. Dissidia 5,988 posts
- 13. Martin Sheen 6,228 posts
- 14. Romans 10.7K posts
- 15. JPMorgan 11.9K posts
- 16. No American 62.8K posts
- 17. Sass 2,411 posts
- 18. Blinken 23.6K posts
- 19. Presidential Medal of Freedom 27.4K posts
- 20. Alec Baldwin 7,573 posts