Top Tweets for #geeksforgeek
Along with this daily Streak๐ฅ
Today I solve 9 questions 9 of #DSA
4 Question's from #GeeksforGeek โ
๏ธโ
๏ธ
5 Question's from #LeetCode grind โ
๏ธโ
๏ธ
Tqsm to @striver_79 @takeUforward_
IDK ๐คทโโ๏ธReally Ap itna acha padate ho ๐๐
Well structured, proper in manner
#Buildinpublic

Just kept the chain alive ๐
โ
POTD x3 (GFG, LeetCode, Unstop)
โ
Finished a Next.js course
โ
More React quizzes & theory
โ
Interview prep quiz โ rank inched up, but still chasing top 20
#DSA #WebDev #NextJS #Coding #BuildInPublic #BeUnstoppable #LeetCode #Geeksforgeek

Just kept the chain alive ๐
โ
POTD x3 (GFG, LeetCode, Unstop)
โ
Finished a Next.js course
โ
More React quizzes & theory
โ
Interview prep quiz โ rank inched up, but still chasing top 20
#DSA #WebDev #NextJS #Coding #BuildInPublic #BeUnstoppable #LeetCode #Geeksforgeek

๐Passionate about Data Science and Machine Learning, with hands-on training from GeeksforGeeksโ Complete ML & Data Science Program.
Excited to apply my skills to real-world challenges while continuously learning and growing in AI.
Thank you..โค๏ธ!
#skillupwithgfg
#geeksforgeek

day 48 of #100DaysOfCode solved the #potd on leetcode
3147. Taking Maximum Energy From the Mystic Dungeon
first use the brute force double loop O(n^2)
after this apply the dp in this which state that
dp[i]=dp[i+k]+energy[i];
and return the max in dp;
#geeksforgeek #leetCode #DP
![diwa810's tweet photo. day 48 of #100DaysOfCode solved the #potd on leetcode
3147. Taking Maximum Energy From the Mystic Dungeon
first use the brute force double loop O(n^2)
after this apply the dp in this which state that
dp[i]=dp[i+k]+energy[i];
and return the max in dp;
#geeksforgeek #leetCode #DP https://t.co/rBMMbbaC2I](https://pbs.twimg.com/media/G27M7EGXMAAndiS.png)
day 30 of 100 days of code solved gfg potd
today question was too easy (reverse the queue)
use the stack to store the front element and pop from queue and reverse the process
second approach is to use the queue ;
#100DaysOfCode #dsa #Geeksforgeek #LeetCode #Stack #Queue
day 28 of 100 days of code
solved the decode the string
use the stack to store the char of string and when encounter "]" pop the string and rev it and push it (after repeating it n times) again repeat this process
time O(n)
#100DaysOfCode #GeeksforGeek #dsa #Stack #LeetCode
![diwa810's tweet photo. day 28 of 100 days of code
solved the decode the string
use the stack to store the char of string and when encounter "]" pop the string and rev it and push it (after repeating it n times) again repeat this process
time O(n)
#100DaysOfCode #GeeksforGeek #dsa #Stack #LeetCode https://t.co/uHemMcWqwD](https://pbs.twimg.com/media/G1UMJ7ObQAEvs-M.png)
DAY 27 of Advanced Java Skill Up
๐COURSE LINK :- https://t.co/W74py0VVr4โฆ
@geeksforgeeks #skillupwithgfg
#nationskillup #geeksforgeek

DAY 24 of Advanced Java Skill Up
๐COURSE LINK :- https://t.co/W74py0VVr4โฆ
@geeksforgeeks #skillupwithgfg
#nationskillup #geeksforgeek

DAY 23 of Advanced Java Skill Up
๐COURSE LINK :- https://t.co/W74py0VnBwโฆ
@geeksforgeeks #skillupwithgfg
#nationskillup #geeksforgeek

Week 9 of #100DaysOfCode done! ๐ Solved graph, GCD & matrix problems + cracked @LeetCode Weekly Contest 464 . One week stronger, one bug smarter.๐ป #nationskillup #skillupwithgfg #buildinpublic #DSA
#leetcode #geeksforgeek #ravixpanchal #GSV #AIDS
@ai_ds_gsv , @ShradhaKhapra_

๐ Day 311 of @geeksforgeeks #POTD!
Solved "Count unique vowel string" ๐งฉ
๐น Counted vowel occurrences
๐น Calculated combinations by picking 1 per vowel
๐น Multiplied by permutations of selected vowels
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025

๐ Day 122 of #GFG160 !
Solved โMinimum Jumpsโ ๐โโ๏ธ
๐น Used bottom-up DP
๐น Initialized last index with 0
๐น For each index, checked reachable jumps
๐น Updated `dp[i] = min(dp[i], dp[j]+1)` if path exists
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025
![Pratikshak19332's tweet photo. ๐ Day 122 of #GFG160 !
Solved โMinimum Jumpsโ ๐โโ๏ธ
๐น Used bottom-up DP
๐น Initialized last index with 0
๐น For each index, checked reachable jumps
๐น Updated `dp[i] = min(dp[i], dp[j]+1)` if path exists
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025 https://t.co/j3DY0XZ2Rx](https://pbs.twimg.com/media/GwNUy01XYAAdN8Q.jpg)
๐ Day 121 of #GFG160 โ
Solved Coin Change (Min Coins) using bottom-up DP with 1D array for optimal subproblem reuse. ๐ก
๐ Thanks to @geeksforgeeks ๐
#GeeksforGeek #GeekStreak2025

๐ Day 307 of @geeksforgeeks #POTD ! completed!
Solved Divisible by 13 ๐งฎ
๐น Approach:
Used modular arithmetic to build the number digit by digit and checked divisibility using `% 13` on the fly to avoid large number conversions.
#GeeksforGeek #JavaScript

๐ Day 118 of #GFG160 !
Solved Min Cost Climbing Stairs ๐งโโ๏ธ
๐น Approach 1: DP with array to store min cost at each step
๐น Approach 2: Space-optimized DP using two variables
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025

๐ Day 115 of #GFG160 !
๐งฉ Problem: Count Palindromic Substrings
๐ Approach:
Used center expansion to count all odd & even length palindromes.
Checked around each index efficiently.
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025

๐ Day 114 of #GFG160!
๐ง Problem: Longest Palindromic Substring
๐น Expand around center (odd & even lengths)
๐น Track longest valid palindrome using two pointers
๐น Update max length & starting index dynamically
๐ Thanks to @geeksforgeeks!
#GeeksforGeek #GeekStreak2025

๐ Day 112 of #GFG160 done!
Solved Longest common Subsequence !
๐ง Approach:
Used DP to build a `lis [ ] array, updating each index based on previous increasing elements.
๐ Thanks to @geeksforgeeks!
#GeeksforGeek #GeekStreak2025
![Pratikshak19332's tweet photo. ๐ Day 112 of #GFG160 done!
Solved Longest common Subsequence !
๐ง Approach:
Used DP to build a `lis [ ] array, updating each index based on previous increasing elements.
๐ Thanks to @geeksforgeeks!
#GeeksforGeek #GeekStreak2025 https://t.co/m1LPwDnjyV](https://pbs.twimg.com/media/Gvb0ASMbUAA_QoO.jpg)
๐ Day 301 of @geeksforgeeks #POTD!
Solved Sum of Subarray Minimums
Approach:
Brute-force gave TLE, so optimized using monotonic stacks to find NSL & NSR, then calculated each elementโs contribution.
#GeeksforGeek #GeekStreak2025!

Last Seen Hashtags on Sotwe
็
ใฟใฎrkrnใใฉใน
Seen from Japan
TEENAGEE filter:videos
Seen from Canada
MuscleMen
Seen from Brazil
girlfart #shart
Seen from Vietnam
DanielleSmithIsUnfitToLead
Seen from United States
TEenagers filter:videos
Seen from United States
yololary
Seen from Germany
omegle
Seen from United States
ensest
Seen from Germany
polygirls
Seen from New Zealand
Most Popular Users

Elon Musk 
@elonmusk
241M followers

Barack Obama 
@barackobama
119.2M followers

Cristiano Ronaldo 
@cristiano
111.8M followers

Donald J. Trump 
@realdonaldtrump
111.8M followers

Narendra Modi 
@narendramodi
107M followers

Rihanna 
@rihanna
98M followers

NASA 
@nasa
92.2M followers

Justin Bieber 
@justinbieber
91.2M followers

KATY PERRY 
@katyperry
88.3M followers

Taylor Swift 
@taylorswift13
82.2M followers

Lady Gaga 
@ladygaga
73.7M followers

Virat Kohli 
@imvkohli
70.9M followers

Kim Kardashian 
@kimkardashian
70.1M followers

YouTube 
@youtube
68.7M followers

Bill Gates 
@billgates
64.3M followers

Neymar Jr 
@neymarjr
63.8M followers

The Ellen Show
@theellenshow
62.4M followers

CNN 
@cnn
61.8M followers

Selena Gomez 
@selenagomez
61.4M followers

X 
@x
60.8M followers















![Pratikshak19332's tweet photo. ๐ Day 122 of #GFG160 !
Solved โMinimum Jumpsโ ๐โโ๏ธ
๐น Used bottom-up DP
๐น Initialized last index with 0
๐น For each index, checked reachable jumps
๐น Updated `dp[i] = min(dp[i], dp[j]+1)` if path exists
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025 https://t.co/j3DY0XZ2Rx](https://pbs.twimg.com/media/GwNUywuaYAANJvJ.jpg)
![Pratikshak19332's tweet photo. ๐ Day 122 of #GFG160 !
Solved โMinimum Jumpsโ ๐โโ๏ธ
๐น Used bottom-up DP
๐น Initialized last index with 0
๐น For each index, checked reachable jumps
๐น Updated `dp[i] = min(dp[i], dp[j]+1)` if path exists
๐ Thanks to @geeksforgeeks !
#GeeksforGeek #GeekStreak2025 https://t.co/j3DY0XZ2Rx](https://pbs.twimg.com/media/GwNUyvHaMAA8tAX.jpg)













![Pratikshak19332's tweet photo. ๐ Day 112 of #GFG160 done!
Solved Longest common Subsequence !
๐ง Approach:
Used DP to build a `lis [ ] array, updating each index based on previous increasing elements.
๐ Thanks to @geeksforgeeks!
#GeeksforGeek #GeekStreak2025 https://t.co/m1LPwDnjyV](https://pbs.twimg.com/media/Gvb0AQ3akAMLi69.jpg)
![Pratikshak19332's tweet photo. ๐ Day 112 of #GFG160 done!
Solved Longest common Subsequence !
๐ง Approach:
Used DP to build a `lis [ ] array, updating each index based on previous increasing elements.
๐ Thanks to @geeksforgeeks!
#GeeksforGeek #GeekStreak2025 https://t.co/m1LPwDnjyV](https://pbs.twimg.com/media/Gvb0AOhakAMvVR9.jpg)
![Pratikshak19332's tweet photo. ๐ Day 112 of #GFG160 done!
Solved Longest common Subsequence !
๐ง Approach:
Used DP to build a `lis [ ] array, updating each index based on previous increasing elements.
๐ Thanks to @geeksforgeeks!
#GeeksforGeek #GeekStreak2025 https://t.co/m1LPwDnjyV](https://pbs.twimg.com/media/Gvb0AOaakAAL57O.jpg)


