#geeksforgeeks 搜尋結果

✅ Day 450 @geeksforgeeks #potd! 🧠 Approach: Use DP with tracking of min, second-min, and min-index. For each color, add either prev-min or prev-second-min (based on index). Update mins → final min is the answer. #GeeksforGeeks

Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks
Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks
Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks

🌟Day 338 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 3432. Count Partitions with Even Sum Difference Easy😎 ✅. Question GFG. Walls Coloring II Hard ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 338 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3432. Count Partitions with Even Sum Difference Easy😎 ✅. 
Question GFG. Walls Coloring II Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 338 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3432. Count Partitions with Even Sum Difference Easy😎 ✅. 
Question GFG. Walls Coloring II Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

🌟Day 337 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 2211. Count Collisions on a Road Medium ✅. Question GFG. Optimal binary search tree Hard ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 337 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC.  2211. Count Collisions on a Road  Medium ✅. 
Question GFG. Optimal binary search tree  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 337 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC.  2211. Count Collisions on a Road  Medium ✅. 
Question GFG. Optimal binary search tree  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

#POTD of @geeksforgeeks Problem : Optimal binary search tree Approach : Knuth Optimization on interval DP to compute the minimum cost Optimal Binary Search Tree. #geeksforgeeks #dsa #competetiveprogramming #problemsolvingtech

Subhojyoti_110's tweet image. #POTD of @geeksforgeeks

Problem : Optimal binary search tree

Approach : Knuth Optimization on interval DP to compute the minimum cost Optimal Binary Search Tree.

#geeksforgeeks  #dsa #competetiveprogramming #problemsolvingtech

🪄Approach: Track-and-Break Open-source mindset — clean logic, zero waste ⚙️ #Java #DSA #GeeksforGeeks #ProblemSolving #DSAWithJava #DSA #CodingJourney #BuildInPublic

Kartscode's tweet image. 🪄Approach: Track-and-Break
Open-source mindset — clean logic, zero waste ⚙️
#Java #DSA #GeeksforGeeks #ProblemSolving #DSAWithJava #DSA #CodingJourney #BuildInPublic
Kartscode's tweet image. 🪄Approach: Track-and-Break
Open-source mindset — clean logic, zero waste ⚙️
#Java #DSA #GeeksforGeeks #ProblemSolving #DSAWithJava #DSA #CodingJourney #BuildInPublic

🌟Day 334 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 2141. Maximum Running Time of N Computers Hard ✅. Question GFG. XOR Pairs less than K Medium ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 334 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 2141. Maximum Running Time of N Computers Hard ✅. 
Question GFG. XOR Pairs less than K  Medium ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 334 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 2141. Maximum Running Time of N Computers Hard ✅. 
Question GFG. XOR Pairs less than K  Medium ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

🎉 Completed 437 days of @geeksforgeeks #potd! 🚀 Approach: Use Union-Find to count connected components. If edges < V−1 → impossible. Otherwise, union all pairs and the answer is components − 1. #GeeksforGeeks #DSU #Coding

Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding
Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding
Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding
Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding

From morning... Stirring it🍽️ DSA 💹 Happy Coding Will do development for rest of the day... #dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks

Gautam4_0_4's tweet image. From morning... Stirring it🍽️
DSA 💹 Happy Coding

Will do development for rest of the day...

#dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks
Gautam4_0_4's tweet image. From morning... Stirring it🍽️
DSA 💹 Happy Coding

Will do development for rest of the day...

#dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks
Gautam4_0_4's tweet image. From morning... Stirring it🍽️
DSA 💹 Happy Coding

Will do development for rest of the day...

#dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks

#POTD of @geeksforgeeks Problem : Minimum Operations to Connect Hospitals Approach : Disjoint Set Union to count connected components and returns how many extra connections are needed to link them. #geeksforgeeks #dsa #competetiveprogramming #problemsolvingtech

Subhojyoti_110's tweet image. #POTD of @geeksforgeeks

Problem : Minimum Operations to Connect Hospitals

Approach : Disjoint Set Union to count connected components and returns how many extra connections are needed to link them.

#geeksforgeeks  #dsa #competetiveprogramming #problemsolvingtech

Hey BitBuddies ✨ Day 94 of my #100DaysOfCode journey! 💪 🟢 LeetCode :Count Number of Trapezoids II 📐➕ 🟢 GFG :Travelling Salesman Problem 🌍✈️ Every day I grow a little faster, think a little sharper ⚡ Let’s keep pushing! #leetcode #geeksforgeeks #coding #programming #DSA

a_gupta30206's tweet image. Hey BitBuddies ✨
 Day 94 of my #100DaysOfCode journey! 💪
🟢 LeetCode :Count Number of Trapezoids II 📐➕
🟢 GFG :Travelling Salesman Problem 🌍✈️
Every day I grow a little faster, think a little sharper ⚡
Let’s keep pushing!
#leetcode #geeksforgeeks #coding #programming #DSA
a_gupta30206's tweet image. Hey BitBuddies ✨
 Day 94 of my #100DaysOfCode journey! 💪
🟢 LeetCode :Count Number of Trapezoids II 📐➕
🟢 GFG :Travelling Salesman Problem 🌍✈️
Every day I grow a little faster, think a little sharper ⚡
Let’s keep pushing!
#leetcode #geeksforgeeks #coding #programming #DSA

🌟Day 336 fuck today potd 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 3625. Count Number of Trapezoids II Hard✅. Question GFG. Travelling Salesman Problem Hard ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 336 fuck today potd 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3625. Count Number of Trapezoids II Hard✅. 
Question GFG. Travelling Salesman Problem  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 336 fuck today potd 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3625. Count Number of Trapezoids II Hard✅. 
Question GFG. Travelling Salesman Problem  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

I have started my coding journey on @geeksforgeeks! 🎉 Just solved my first problem: 'Count triplets with given sum in sorted array' using the 2-pointer approach. Feeling great about this start! #100DaysOfCode #CodingJourney #GeeksForGeeks #ProblemSolving

BarnwalNit81849's tweet image. I have started my coding journey on @geeksforgeeks! 🎉 Just solved my first problem: &apos;Count triplets with given sum in sorted array&apos; using the 2-pointer approach. Feeling great about this start!
 #100DaysOfCode #CodingJourney #GeeksForGeeks #ProblemSolving

🚀 Day 435 of @geeksforgeeks #POTD ! Solved a character-transform problem using all-pairs shortest paths. 🔍 Approach * Build transform cost matrix. * Run Floyd–Warshall. * For each position, pick the cheapest common reachable character; if none, return `-1`. #GeeksforGeeks

Pratikshak19332's tweet image. 🚀 Day 435 of @geeksforgeeks #POTD !
Solved a character-transform problem using all-pairs shortest paths.
🔍 Approach

* Build transform cost matrix.
* Run Floyd–Warshall.
* For each position, pick the cheapest common reachable character; if none, return `-1`.

#GeeksforGeeks
Pratikshak19332's tweet image. 🚀 Day 435 of @geeksforgeeks #POTD !
Solved a character-transform problem using all-pairs shortest paths.
🔍 Approach

* Build transform cost matrix.
* Run Floyd–Warshall.
* For each position, pick the cheapest common reachable character; if none, return `-1`.

#GeeksforGeeks

From 1 day to 119 days Consistency builds confidence 💫 #GeeksForGeeks #POTD #StreakStrong #HSGTAFG #CodingMotivation

SupriyaSin17706's tweet image. From 1 day to 119 days
Consistency builds confidence 💫

#GeeksForGeeks #POTD #StreakStrong #HSGTAFG #CodingMotivation

Done the streak! Not a snapstreak, but that sweet LeetCode & GFG problem-solving streak is alive 🚀 There’s something satisfying about solving daily problems and keeping those coding chains running. #TodaySolved #LeetCode #GeeksforGeeks #CodingStreak #100DaysOfCode #Problem

Gautam4_0_4's tweet image. Done the streak!
Not a snapstreak, but that sweet LeetCode &amp;amp; GFG problem-solving streak is alive 🚀
There’s something satisfying about solving daily problems and keeping those coding chains running.
#TodaySolved #LeetCode #GeeksforGeeks #CodingStreak #100DaysOfCode #Problem
Gautam4_0_4's tweet image. Done the streak!
Not a snapstreak, but that sweet LeetCode &amp;amp; GFG problem-solving streak is alive 🚀
There’s something satisfying about solving daily problems and keeping those coding chains running.
#TodaySolved #LeetCode #GeeksforGeeks #CodingStreak #100DaysOfCode #Problem

Another great one 🥹 Ps- going to reach out to him for his resume and see if we can find a good job match for him! #gfg #geeksforgeeks #feedback

geeksforgeeks's tweet image. Another great one 🥹

Ps- going to reach out to him for his resume and see if we can find a good job match for him! 

#gfg #geeksforgeeks #feedback

▪Just solved today's POTD on GeeksforGeeks & earned 1 Geekbit! 🎉 🧿Current POTD streak: 💥Day 82 ▪Problem solved successfully with a score of 1055! 🚀 Keep up the coding grind, #Coding #GeeksforGeeks #potd #gfg160

Rahul78451's tweet image. ▪Just solved today&apos;s POTD on GeeksforGeeks &amp;amp; earned 1 Geekbit! 🎉

🧿Current POTD streak: 💥Day 82

▪Problem solved successfully with a score of 1055! 🚀
Keep up the coding grind,  #Coding #GeeksforGeeks #potd #gfg160

📅 December 03, 2025 Day 41/160 ✅✨ | #GFG160 Challenge 💻🔥 📌 QOTD: Set Matrix Zeros 🔹 TC: O(n*m) SC: O(1) ⏳ 119 days to go... 🚀 GFG profile: geeksforgeeks.org/user/jitishxdd/ @geeksforgeeks #GeekStreak2025 #GeeksforGeeks #DSA #ChallengeAccepted #cpp

JitishxD's tweet image. 📅 December 03, 2025

Day 41/160 ✅✨ | #GFG160 Challenge 💻🔥
📌 QOTD: Set Matrix Zeros
🔹 TC: O(n*m) SC: O(1)
⏳ 119 days to go... 🚀

GFG profile: geeksforgeeks.org/user/jitishxdd/
@geeksforgeeks

#GeekStreak2025 #GeeksforGeeks #DSA #ChallengeAccepted #cpp

Day 24: Problem Solved -Overlapping Intervals; #geeksforgeeks #gfg160 #geekstreak2025

HemanthNay32402's tweet image. Day 24: Problem Solved -Overlapping Intervals;     #geeksforgeeks #gfg160 #geekstreak2025

📅 December 05, 2025 Day 43/160 ✅✨ | #GFG160 Challenge 💻🔥 📌 QOTD: Count pairs with given sum 🔹 TC: O(n) SC: O(n) ⏳ 117 days to go... 🚀 GFG profile: geeksforgeeks.org/user/jitishxdd/ @geeksforgeeks #GeekStreak2025 #GeeksforGeeks #DSA #ChallengeAccepted #cpp

JitishxD's tweet image. 📅 December 05, 2025

Day 43/160 ✅✨ | #GFG160 Challenge 💻🔥
📌 QOTD: Count pairs with given sum
🔹 TC: O(n) SC: O(n)
⏳ 117 days to go... 🚀

GFG profile: geeksforgeeks.org/user/jitishxdd/
@geeksforgeeks

#GeekStreak2025 #GeeksforGeeks #DSA #ChallengeAccepted #cpp

Day 78 Lets goo🔥 Today we start our database journey downloading NoSQL Database (MONGODB) Course link-:{ geeksforgeeks.org/batch/skill-up… } #skillupwithgfg #nationskillup #GeeksforGeeks

AdityaGour841's tweet image. Day 78
Lets goo🔥
Today we start our database journey downloading NoSQL Database (MONGODB)
Course link-:{ geeksforgeeks.org/batch/skill-up… }                                                        

#skillupwithgfg #nationskillup #GeeksforGeeks
AdityaGour841's tweet image. Day 78
Lets goo🔥
Today we start our database journey downloading NoSQL Database (MONGODB)
Course link-:{ geeksforgeeks.org/batch/skill-up… }                                                        

#skillupwithgfg #nationskillup #GeeksforGeeks
AdityaGour841's tweet image. Day 78
Lets goo🔥
Today we start our database journey downloading NoSQL Database (MONGODB)
Course link-:{ geeksforgeeks.org/batch/skill-up… }                                                        

#skillupwithgfg #nationskillup #GeeksforGeeks

🌟Day 338 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 3432. Count Partitions with Even Sum Difference Easy😎 ✅. Question GFG. Walls Coloring II Hard ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 338 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3432. Count Partitions with Even Sum Difference Easy😎 ✅. 
Question GFG. Walls Coloring II Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 338 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3432. Count Partitions with Even Sum Difference Easy😎 ✅. 
Question GFG. Walls Coloring II Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

✅ Day 450 @geeksforgeeks #potd! 🧠 Approach: Use DP with tracking of min, second-min, and min-index. For each color, add either prev-min or prev-second-min (based on index). Update mins → final min is the answer. #GeeksforGeeks

Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks
Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks
Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks

🎯 Nation SkillUp-Day 123! Continued my Journey of GenAI. Read about Reparameterization Trick. 🔗 Course: geeksforgeeks.org/batch/skill-up#Skillupwithgfg #Nationskillup #geeksforgeeks @geeksforgeeks

IamAni_0709's tweet image. 🎯 Nation SkillUp-Day 123!
Continued my Journey of GenAI. Read about Reparameterization Trick.
🔗 Course: geeksforgeeks.org/batch/skill-up…
#Skillupwithgfg #Nationskillup #geeksforgeeks
@geeksforgeeks

▪Just solved today's POTD on GeeksforGeeks & earned 1 Geekbit! 🎉 🧿Current POTD streak: 💥Day 82 ▪Problem solved successfully with a score of 1055! 🚀 Keep up the coding grind, #Coding #GeeksforGeeks #potd #gfg160

Rahul78451's tweet image. ▪Just solved today&apos;s POTD on GeeksforGeeks &amp;amp; earned 1 Geekbit! 🎉

🧿Current POTD streak: 💥Day 82

▪Problem solved successfully with a score of 1055! 🚀
Keep up the coding grind,  #Coding #GeeksforGeeks #potd #gfg160

Hey @geeksforgeeks 👋 The College Dashboard / Leaderboard route seems missing after the recent update. It was super helpful for students! Any chance it’s coming back? 🙏 #GeeksforGeeks #FeatureRequest


#POTD of @geeksforgeeks Problem : Optimal binary search tree Approach : Knuth Optimization on interval DP to compute the minimum cost Optimal Binary Search Tree. #geeksforgeeks #dsa #competetiveprogramming #problemsolvingtech

Subhojyoti_110's tweet image. #POTD of @geeksforgeeks

Problem : Optimal binary search tree

Approach : Knuth Optimization on interval DP to compute the minimum cost Optimal Binary Search Tree.

#geeksforgeeks  #dsa #competetiveprogramming #problemsolvingtech

🌟 Day 23 of #GFG160 completed! 🧩 Problem: Count Inversions in an Array 💡 Topic: Arrays / Divide & Conquer 🔑 Key takeaway: Modified merge sort efficiently counts inversions in O(n log n) by detecting out-of-order 🚀 #DSA #GeeksforGeeks #100DaysOfCode #CodingJourney

0Shiva2's tweet image. 🌟 Day 23 of #GFG160 completed!

🧩 Problem: Count Inversions in an Array
💡 Topic: Arrays / Divide &amp;amp; Conquer

🔑 Key takeaway: Modified merge sort efficiently counts inversions in O(n log n) by detecting out-of-order 🚀
#DSA #GeeksforGeeks #100DaysOfCode #CodingJourney
0Shiva2's tweet image. 🌟 Day 23 of #GFG160 completed!

🧩 Problem: Count Inversions in an Array
💡 Topic: Arrays / Divide &amp;amp; Conquer

🔑 Key takeaway: Modified merge sort efficiently counts inversions in O(n log n) by detecting out-of-order 🚀
#DSA #GeeksforGeeks #100DaysOfCode #CodingJourney

🪄Approach: Track-and-Break Open-source mindset — clean logic, zero waste ⚙️ #Java #DSA #GeeksforGeeks #ProblemSolving #DSAWithJava #DSA #CodingJourney #BuildInPublic

Kartscode's tweet image. 🪄Approach: Track-and-Break
Open-source mindset — clean logic, zero waste ⚙️
#Java #DSA #GeeksforGeeks #ProblemSolving #DSAWithJava #DSA #CodingJourney #BuildInPublic
Kartscode's tweet image. 🪄Approach: Track-and-Break
Open-source mindset — clean logic, zero waste ⚙️
#Java #DSA #GeeksforGeeks #ProblemSolving #DSAWithJava #DSA #CodingJourney #BuildInPublic

Completed 350 points on @geeksforgeeks Excited to go ahead and complete 400 points #geeksforgeeks #gfg #Coding #abdullahatif

abdullahatif07's tweet image. Completed 350 points on @geeksforgeeks 

Excited to go ahead and complete 400 points 

#geeksforgeeks #gfg #Coding #abdullahatif

Hey BitBuddies 👋 Day 66 of my #100DaysOfCode journey! ⚡ 💻 LeetCode: Find X-Sum of All K-Long Subarrays II Consistency builds clarity, and clarity builds mastery 💪 #LeetCode #GeeksforGeeks #DSA #CodingChallenge #ProblemSolving #Day66

a_gupta30206's tweet image. Hey BitBuddies 👋

Day 66 of my #100DaysOfCode journey! ⚡

💻 LeetCode: Find X-Sum of All K-Long Subarrays II

Consistency builds clarity, and clarity builds mastery 💪
#LeetCode #GeeksforGeeks #DSA  #CodingChallenge #ProblemSolving #Day66

Done the streak! Not a snapstreak, but that sweet LeetCode & GFG problem-solving streak is alive 🚀 There’s something satisfying about solving daily problems and keeping those coding chains running. #TodaySolved #LeetCode #GeeksforGeeks #CodingStreak #100DaysOfCode #Problem

Gautam4_0_4's tweet image. Done the streak!
Not a snapstreak, but that sweet LeetCode &amp;amp; GFG problem-solving streak is alive 🚀
There’s something satisfying about solving daily problems and keeping those coding chains running.
#TodaySolved #LeetCode #GeeksforGeeks #CodingStreak #100DaysOfCode #Problem
Gautam4_0_4's tweet image. Done the streak!
Not a snapstreak, but that sweet LeetCode &amp;amp; GFG problem-solving streak is alive 🚀
There’s something satisfying about solving daily problems and keeping those coding chains running.
#TodaySolved #LeetCode #GeeksforGeeks #CodingStreak #100DaysOfCode #Problem

🌟Day 337 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 2211. Count Collisions on a Road Medium ✅. Question GFG. Optimal binary search tree Hard ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 337 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC.  2211. Count Collisions on a Road  Medium ✅. 
Question GFG. Optimal binary search tree  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 337 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC.  2211. Count Collisions on a Road  Medium ✅. 
Question GFG. Optimal binary search tree  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

💻 Just hit 500 coding score on GeeksforGeeks! Another step forward in my problem-solving journey 🚀 Next Target - 600 Points! #GeeksforGeeks #CodingJourney #ProblemSolving #abdullahatif07

abdullahatif07's tweet image. 💻 Just hit 500 coding score on GeeksforGeeks!

Another step forward in my problem-solving journey 🚀

Next Target - 600 Points!

#GeeksforGeeks #CodingJourney #ProblemSolving  #abdullahatif07

#POTD of @geeksforgeeks Problem : Get Minimum Squares Approach : Legendre’s Three-Square Theorem to determine the minimum number of perfect squares that sum up to a given number. #geeksforgeeks #dsa #competetiveprogramming #ProblemSolving

Subhojyoti_110's tweet image. #POTD of @geeksforgeeks

Problem : Get Minimum Squares

Approach : Legendre’s Three-Square Theorem to determine the minimum number of perfect squares that sum up to a given number.

#geeksforgeeks  #dsa #competetiveprogramming #ProblemSolving

From morning... Stirring it🍽️ DSA 💹 Happy Coding Will do development for rest of the day... #dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks

Gautam4_0_4's tweet image. From morning... Stirring it🍽️
DSA 💹 Happy Coding

Will do development for rest of the day...

#dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks
Gautam4_0_4's tweet image. From morning... Stirring it🍽️
DSA 💹 Happy Coding

Will do development for rest of the day...

#dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks
Gautam4_0_4's tweet image. From morning... Stirring it🍽️
DSA 💹 Happy Coding

Will do development for rest of the day...

#dsa #WebDevelopment #geeksforgeeks #LeetCode #TakeYouForward @geeksforgeeks

🌟Day 334 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 2141. Maximum Running Time of N Computers Hard ✅. Question GFG. XOR Pairs less than K Medium ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 334 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 2141. Maximum Running Time of N Computers Hard ✅. 
Question GFG. XOR Pairs less than K  Medium ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 334 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 2141. Maximum Running Time of N Computers Hard ✅. 
Question GFG. XOR Pairs less than K  Medium ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

✅ Day 450 @geeksforgeeks #potd! 🧠 Approach: Use DP with tracking of min, second-min, and min-index. For each color, add either prev-min or prev-second-min (based on index). Update mins → final min is the answer. #GeeksforGeeks

Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks
Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks
Pratikshak19332's tweet image. ✅ Day 450 @geeksforgeeks #potd! 

 🧠 Approach:

Use DP with tracking of min, second-min, and min-index.
For each color, add either prev-min or prev-second-min (based on index).
Update mins → final min is the answer.

#GeeksforGeeks

I have started my coding journey on @geeksforgeeks! 🎉 Just solved my first problem: 'Count triplets with given sum in sorted array' using the 2-pointer approach. Feeling great about this start! #100DaysOfCode #CodingJourney #GeeksForGeeks #ProblemSolving

BarnwalNit81849's tweet image. I have started my coding journey on @geeksforgeeks! 🎉 Just solved my first problem: &apos;Count triplets with given sum in sorted array&apos; using the 2-pointer approach. Feeling great about this start!
 #100DaysOfCode #CodingJourney #GeeksForGeeks #ProblemSolving

🚀 Day 435 of @geeksforgeeks #POTD ! Solved a character-transform problem using all-pairs shortest paths. 🔍 Approach * Build transform cost matrix. * Run Floyd–Warshall. * For each position, pick the cheapest common reachable character; if none, return `-1`. #GeeksforGeeks

Pratikshak19332's tweet image. 🚀 Day 435 of @geeksforgeeks #POTD !
Solved a character-transform problem using all-pairs shortest paths.
🔍 Approach

* Build transform cost matrix.
* Run Floyd–Warshall.
* For each position, pick the cheapest common reachable character; if none, return `-1`.

#GeeksforGeeks
Pratikshak19332's tweet image. 🚀 Day 435 of @geeksforgeeks #POTD !
Solved a character-transform problem using all-pairs shortest paths.
🔍 Approach

* Build transform cost matrix.
* Run Floyd–Warshall.
* For each position, pick the cheapest common reachable character; if none, return `-1`.

#GeeksforGeeks

🎉 Completed 437 days of @geeksforgeeks #potd! 🚀 Approach: Use Union-Find to count connected components. If edges < V−1 → impossible. Otherwise, union all pairs and the answer is components − 1. #GeeksforGeeks #DSU #Coding

Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding
Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding
Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding
Pratikshak19332's tweet image. 🎉 Completed 437 days of @geeksforgeeks #potd! 🚀

Approach:
Use Union-Find to count connected components.
If edges &amp;lt; V−1 → impossible.
Otherwise, union all pairs and the answer is components − 1.

#GeeksforGeeks #DSU #Coding

🌟Day 321 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 717. 1-bit and 2-bit Characters Easy😎 ✅. Question GFG. Number of Ways to Arrive at Destination Medium ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 321 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC.  717.  1-bit and 2-bit Characters Easy😎 ✅. 
Question GFG.  Number of Ways to Arrive at Destination  Medium ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 321 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC.  717.  1-bit and 2-bit Characters Easy😎 ✅. 
Question GFG.  Number of Ways to Arrive at Destination  Medium ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Hey BitBuddies 👋🔥 Day 75 of my #100DaysOfCode challenge! 🚀✨ 💡 LeetCode: Increment Submatrices by One 📘 GFG: Minimum Cost to Merge Stones Consistency > Motivation. #LeetCode #GeeksforGeeks #CodingJourney #DevCommunity #buildinpublic #100DaysOfCode

a_gupta30206's tweet image. Hey BitBuddies 👋🔥

Day 75 of my #100DaysOfCode challenge! 🚀✨

💡 LeetCode: Increment Submatrices by One

📘 GFG: Minimum Cost to Merge Stones 

Consistency &amp;gt; Motivation.

#LeetCode #GeeksforGeeks #CodingJourney #DevCommunity #buildinpublic #100DaysOfCode
a_gupta30206's tweet image. Hey BitBuddies 👋🔥

Day 75 of my #100DaysOfCode challenge! 🚀✨

💡 LeetCode: Increment Submatrices by One

📘 GFG: Minimum Cost to Merge Stones 

Consistency &amp;gt; Motivation.

#LeetCode #GeeksforGeeks #CodingJourney #DevCommunity #buildinpublic #100DaysOfCode

Hey BitBuddies ✨ Day 94 of my #100DaysOfCode journey! 💪 🟢 LeetCode :Count Number of Trapezoids II 📐➕ 🟢 GFG :Travelling Salesman Problem 🌍✈️ Every day I grow a little faster, think a little sharper ⚡ Let’s keep pushing! #leetcode #geeksforgeeks #coding #programming #DSA

a_gupta30206's tweet image. Hey BitBuddies ✨
 Day 94 of my #100DaysOfCode journey! 💪
🟢 LeetCode :Count Number of Trapezoids II 📐➕
🟢 GFG :Travelling Salesman Problem 🌍✈️
Every day I grow a little faster, think a little sharper ⚡
Let’s keep pushing!
#leetcode #geeksforgeeks #coding #programming #DSA
a_gupta30206's tweet image. Hey BitBuddies ✨
 Day 94 of my #100DaysOfCode journey! 💪
🟢 LeetCode :Count Number of Trapezoids II 📐➕
🟢 GFG :Travelling Salesman Problem 🌍✈️
Every day I grow a little faster, think a little sharper ⚡
Let’s keep pushing!
#leetcode #geeksforgeeks #coding #programming #DSA

#POTD of @geeksforgeeks Problem : Optimal binary search tree Approach : Knuth Optimization on interval DP to compute the minimum cost Optimal Binary Search Tree. #geeksforgeeks #dsa #competetiveprogramming #problemsolvingtech

Subhojyoti_110's tweet image. #POTD of @geeksforgeeks

Problem : Optimal binary search tree

Approach : Knuth Optimization on interval DP to compute the minimum cost Optimal Binary Search Tree.

#geeksforgeeks  #dsa #competetiveprogramming #problemsolvingtech

🌟Day 336 fuck today potd 👨‍💻. Solve @geeksforgeeks || @LeetCode POTD Cpp⚡ Question LC. 3625. Count Number of Trapezoids II Hard✅. Question GFG. Travelling Salesman Problem Hard ✅. #geeksforgeeks #leetcode #DSA #POTD @LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Jatin_lifo82's tweet image. 🌟Day 336 fuck today potd 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3625. Count Number of Trapezoids II Hard✅. 
Question GFG. Travelling Salesman Problem  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge
Jatin_lifo82's tweet image. 🌟Day 336 fuck today potd 👨‍💻. 
Solve @geeksforgeeks || @LeetCode 
POTD Cpp⚡
Question LC. 3625. Count Number of Trapezoids II Hard✅. 
Question GFG. Travelling Salesman Problem  Hard ✅. 
#geeksforgeeks #leetcode #DSA #POTD 
@LeetCode @geeksforgeeks #CPP25 #CodingChallenge

Loading...

Something went wrong.


Something went wrong.


United States Trends