Barshan Burman

Techie
Enthusiastic in Data Engineering
GFG Campus Mantri'26
AT TBiT, Kolkata,WB

[Barshan Burman @barshanburman_7]

🚀 Upgrade your skills this summer with GeeksforGeeks Summer SkillUp Program
✅ Free Workshops
✅ AI Toolkit
✅ Tech Quizzes
✅ Job Updates
✅ Coding Resources
Perfect for students exploring AI, Web Dev & Data Science.
🔗 https://t.co/4KtCnToT9T
#SummerSkillUp #AI #GeeksforGeeks

[Barshan Burman @barshanburman_7]

🚀 Summer SkillUp 2026 is live!

Make your summer productive with coding, DSA & tech learning 💻🔥

👉 Register now:
https://t.co/LfwVFevHAF

Learn, practice & grow consistently with GeeksforGeeks 🚀

#skillupwithgfg #aiwithgfg #summerskillup #GFG2026

[Barshan Burman @barshanburman_7]

POTD 52✅

“Sum of XOR of all pairs”

Brute force → O(n²) ❌

Better idea:
Think BITWISE.
For each bit:
pairs = count1 * count0
contribution = pairs * 2^i

Total → O(n)
Stop thinking in pairs.
Start thinking in bits.
#DSA #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

POTD 51✅

“Binary Palindrome”

Easy way:
bin(n) → check reverse
Better way:
Compare bits from both ends (MSB ↔ LSB)

Same result.
More control.
No extra space.
Simple problems = depth in disguise.

#DSA #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

POTD #49 ✅

“Position of the Set Bit”

Key trick:

n & (n-1) = 0

If true → number has exactly ONE set bit.

Classic bit manipulation optimization.
No brute force needed.
Binary patterns > memorization.

#DSA #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

POTD #48 ✅

“Kth Largest in a Stream”

Brute force sorting after every insertion? ❌

Used a Min Heap of size k:
• Keep only k largest elements
• Heap top = kth largest
Efficient streaming solution:
O(n log k)
Heaps are underrated. 🧠

#DSA #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

You don’t need to build the tree to check a Max Heap.
DAY: 47 POTD
In array representation:
Left child = 2i + 1
Right child = 2i + 2
Just verify:
parent ≥ children
Single pass.
O(n) time.
O(1) space.

Simple indexing > unnecessary complexity.
#DSA #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

This “Min Swaps to Group 1s” DAY:46

Key insight:
If total 1s = k,
then answer = minimum 0s in any window of size k.
Fixed-size sliding window.
O(n) solution.
No swap simulation needed.
Pattern recognition > brute force.

#DSA #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

🚀 Build real AI agents with Build with AI – Agent Builder Camp 🤖

Learn Agentic AI, work on real projects, get mentored & earn certificates 🧑‍🏫📜

👉 Register now: https://t.co/TjMc2TZCVw

Limited time—don’t miss out 🔥

#BuildWithAI #AI #AgenticAI #GfG
@geeksforgeeks

[Barshan Burman @barshanburman_7]

Most people brute-force substring problems.

Bad idea.

For “smallest window with 0,1,2”:
Use sliding window.
Expand → until valid
Shrink → to minimize

O(n), no extra space.
From exponential thinking → linear solution.

#DSA #Coding #100DaysOfCode

@geeksforgeeks

[Barshan Burman @barshanburman_7]

Most people brute-force the Water Jug problem. That’s inefficient.
POTD-37
Key insight:
Possible only if d % gcd(m,n) == 0
Then simulate both directions (m→n, n→m) and take minimum steps.
(3,5,4)=6 ✔️
(8,56,46)=❌
Think before you code.
#DSA #Coding #GATE2026 #100daysofcode

[Barshan Burman @barshanburman_7]

Day 37🔥 POTD Streak!

✅ Solved: Count Derangements

💡 Key Idea:
D(n) = (n-1) × (D(n-1) + D(n-2))
No element stays in its original position 🚫

Pure DP + combinatorics combo 🧠⚡

#POTD #DSA #DynamicProgramming #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

Day 36🔥 POTD Streak!

✅ Solved: Check for Power

💡 Idea:
Keep dividing y by x until it’s no longer divisible
If you end at 1 → it’s a power ✔

Simple logic > complex math ⚡

#POTD #DSA #Coding #100DaysOfCode #ProblemSolving

[Barshan Burman @barshanburman_7]

Day 35 🔥 POTD Streak!

✅ Solved: Flip to Maximize 1s

💡 Twist:
Convert problem → Kadane’s Algorithm
0 → +1 (gain)
1 → -1 (loss)
Then just find max subarray 🧠⚡
Pattern recognition > brute force 💯
#POTD #DSA #Kadane #Coding #100DaysOfCode

[Barshan Burman @barshanburman_7]

Day 34🔥 POTD Streak!

✅ Solved: Anagram Palindrome
💡 Trick: At most ONE odd frequency allowed
Simple logic, powerful pattern 💯

These are the questions that sharpen intuition 🧠⚡

#POTD #DSA #Coding #100DaysOfCode #ProblemSolving

[Barshan Burman @barshanburman_7]

🚀 Got your GfG Connect code?
Use it & get ₹50 instantly 💸
Code: - GFGCM26T9WSI
⚠️ First 250 users only — hurry!
👉 https://t.co/quMHVFEWAQ
1:1 mentorship 🧑‍🏫 | Career guidance 🎯 | Industry insights 💡
Use it early ��
#GfG #GfGConnect #Coding #Placements

@geeksforgeeks

[Barshan Burman @barshanburman_7]

Day 33 🔥 POTD Streak!
✅ Solved: Implement Atoi (String → Integer)
Key Learnings:
• Handle spaces & signs carefully
• Stop at first non-digit
⚠️This problem looks simpleuntil edge cases hit 😮‍💨
Consistency > Motivation 🚀
#POTD #DSA #Coding #100DaysOfCode #ProblemSolving

[Barshan Burman @barshanburman_7]

Day 32🔥 POTD Streak!

✅ Solved: URLify a String
💡 Idea: Replace spaces with "%20"
Simple problem, but builds strong string fundamentals 💯

Consistency is the real game 🚀

#POTD #DSA #Coding #100DaysOfCode #GeeksforGeeks

[Barshan Burman @barshanburman_7]

Day 31🔥 POTD Streak!

✅ Solved: Remove Spaces
⚡ Idea: Filter characters or use replace()
Sometimes the simplest problems build the strongest fundamentals 💯

Consistency > complexity 🚀

#POTD #DSA #Coding #100DaysOfCode #GeeksforGeeks

[Barshan Burman @barshanburman_7]

Day 30🔥 POTD Streak!

✅ Solved: Next Smallest Palindrome
⚡ Idea: Mirror → Compare → Fix with carry
Tricky edge cases (9s 😵) but fun to crack!

Hard problem = sharper thinking 💯

#POTD #DSA #Coding #100DaysOfCode #GeeksforGeeks #ProblemSolving