Top Tweets for #Bitmagic
Day 6 — LeetCode + Bit Magic
Solved: 3315. Construct the Minimum Bitwise Array II
Key takeaway: odd primes let you exploit trailing 1-runs.
Minimal x such that x | (x+1) = p →
x = p - 2^(trailingOnes(p)-1)
#100DaysOfCode #leetcode #bitmagic #dsa #javacoding #day6

Explored the CheckKthBit problem today—simple, clean logic and a perfect refresher on bitwise operations. #DSA #Programming #BitMagic

🚀 Day 444 of #geekstreak2025
🔹 GFG POTD: Count Set Bits
💡 Used a recursive + math-based approach find highest power of 2 ≤ n and add:
bits till 2^x + bits contributed by MSB + recurse for remaining part..
#dsa #gfg #bitmagic #recursion #coding

🚀 Day 443 of #geekstreak2025
🔹 GFG POTD: Subset XOR
💡 Goal → find a subset of {1..n} whose XOR equals n.
✨ key idea → use total XOR of 1..n and xor-manipulation to exclude the right element(s) instead of brute force.
#dsa #gfg #bitmagic #coding

I finally published the 3D model for the case I made for #tigard and #bitmagic by @1bitsquared: https://t.co/GAQvQEadLG
It's not perfect (I need to add some fixing for the cables on the right side) but it's quite usable

A showcase of the unexpected! 🔥From surreal moments to clever plays, this is #Bitmagic in motion, where players create, explore, and break the rules in all the right ways. Check the reel below. Try the game: https://t.co/P4QwWsuEfg
#gaming #mobilegame
https://t.co/ZEKLLAwW5G
Day 159 ✅ | #GFG160DaysOfCoding
📌 Find Unique Number (All Others Twice)
🔹 XOR all elements → duplicates cancel out
🔹 Remaining = the unique number
⏱ O(N) | 💾 O(1)
#BitMagic #XOR #Arrays #DSA #geekstreak2025

Day 158 ✅ | #GFG160DaysOfCoding
📌 Missing Number in Array
🔹 XOR all numbers 1..N+1
🔹 XOR with array elements
🔹 Remaining value = missing number
⏱ O(N) | 💾 O(1)
#BitMagic #XOR #Arrays #DSA #GeekStreak2025

Day 157 ✅ | #GFG160DaysOfCoding
📌 Find Duplicate (1..N-1)
✨ XOR trick :-
ans ^= i ^ arr[i];
All cancel out → leftover = duplicate
⏱ O(N) | 💾 O(1)
#BitMagic #XOR #Arrays #DSA #GeekStreak2025
![GouravXDev's tweet photo. Day 157 ✅ | #GFG160DaysOfCoding
📌 Find Duplicate (1..N-1)
✨ XOR trick :-
ans ^= i ^ arr[i];
All cancel out → leftover = duplicate
⏱ O(N) | 💾 O(1)
#BitMagic #XOR #Arrays #DSA #GeekStreak2025 https://t.co/nFzi4tGa0b](https://pbs.twimg.com/media/Gz1U0R7bAAAjLJX.png)
Game Update 1.46 – Now rendering brainrot in 3D
#BitmagicMini just got a major upgrade:
Faster load times
New 3D engine
New game modes:
BRAINROT
SPLATTER
PLATFORMER (improved)
FIGHTING
Play now!
https://t.co/L2DLt2E5to
#GameDev #AIgames #Bitmagic
🏙️Day 162/365 #365DaysOfCode✅
⚡ Solved GFG’s "Geeks & Buildings"! #geeksforgeeks
Approach: DP Tabulation + Stack
⏱️ T.C:O(n) | 💾 S.C: O(n)
💡 Key Insight: Track next-greater elements → compute XOR chains!
#DSA #DynamicProgramming #Stack #BitMagic #ProblemSolving

🏙️Day 162/365 #365DaysOfCode✅
⚡ Solved GFG’s "Geeks & Buildings"! #geeksforgeeks
Approach: DP Tabulation + Stack
⏱️ T.C:O(n) | 💾 S.C: O(n)
💡 Key Insight: Track next-greater elements → compute XOR chains!
#DSA #DynamicProgramming #Stack #BitMagic #ProblemSolving

🌀 8. Backtracking → Trie → Bit Manipulation
Backtracking: All possibilities
Trie: String searcher on steroids
Bit Manipulation: The most underrated ninja skill 🥷
🎯 Goal: Solve hard problems with clever tricks
#Backtracking #BitMagic #Trie #DSA
💡 XOR = Bitmasking + Vector Space in disguise
Day 24 blog is live — explained XOR basis, linear independence & DSA use cases!
Read now 👉 https://t.co/rWfekkOfKD
#XOR #DSA #100DaysOfCode #girlwhocodes #bitmagic
#BitmagicMini Game Update 1.34 is here!
🔥 3 new game types:
• Slapper
• Merge
• Shooter
🔥 Smoother, faster gameplay across the board
🔥 Upload your own images (login required)
Feedback 👉 https://t.co/QVrr9M52V4
Play now 👉 https://t.co/L2DLt2EDiW
#GameDev #AIgames #Bitmagic

🚨 #Bitmagic Mini Update 1.31
• Gameplay improvements
• New experimental mode: Slapper
• Share your replays!
We’re pushing the boundaries of tiny, shareable #AI-powered games.
Try it: https://t.co/L2DLt2E5to
Join us: https://t.co/QVrr9M4v5w
#GameDev #AIgames #BitmagicMini

🔁 Bonus - Day 3/100
🧩 Solved: Single Number (XOR Magic!)
When every number appears twice, XOR reveals the lone wolf 🐺💡
#100DaysOfCode #LeetCode #CPlusPlus #BitMagic #CodingIsFun

#day71 of #100DaysOfCoding ✅
Solved @LeetCode 136 - Single Number in Java.
→ First used brute-force
→ Then optimized with XOR
#leetcode #java #DSA #womenWhoCode #girlsWhoCode #bitmagic

Trends for you
Most Popular Users

Elon Musk 
@elonmusk
240.1M followers

Barack Obama 
@barackobama
119.3M followers

Donald J. Trump 
@realdonaldtrump
111.6M followers

Cristiano Ronaldo 
@cristiano
108.8M followers

Narendra Modi 
@narendramodi
106.9M followers

Rihanna 
@rihanna
97.2M followers

NASA 
@nasa
92.1M followers

Justin Bieber 
@justinbieber
90.5M followers

KATY PERRY 
@katyperry
86.7M followers

Taylor Swift 
@taylorswift13
80.5M followers

Lady Gaga 
@ladygaga
72.1M followers

Kim Kardashian 
@kimkardashian
69.3M followers

YouTube 
@youtube
68.6M followers

Virat Kohli 
@imvkohli
68.4M followers

Bill Gates 
@billgates
63.4M followers

The Ellen Show
@theellenshow
62.5M followers

CNN 
@cnn
61.9M followers

Neymar Jr 
@neymarjr
61M followers

X 
@x
60.9M followers

CNN Breaking News 
@cnnbrk
59.9M followers









![GouravXDev's tweet photo. Day 157 ✅ | #GFG160DaysOfCoding
📌 Find Duplicate (1..N-1)
✨ XOR trick :-
ans ^= i ^ arr[i];
All cancel out → leftover = duplicate
⏱ O(N) | 💾 O(1)
#BitMagic #XOR #Arrays #DSA #GeekStreak2025 https://t.co/nFzi4tGa0b](https://pbs.twimg.com/media/Gz1U0RgaoAAvevx.png)







