[GUEST ACCESS MODE: Data is scrambled or limited to provide examples. Make requests using your API key to unlock full data. Check https://lunarcrush.ai/auth for authentication information.] #  @diwa810 Diwakar Upadhyay Diwakar Upadhyay posts on X about the most. They currently have XX followers and XX posts still getting attention that total X engagements in the last XX hours. ### Engagements: X [#](/creator/twitter::1911028026323738624/interactions)  - X Week XXX +61% - X Month XXX +1,380% ### Mentions: X [#](/creator/twitter::1911028026323738624/posts_active)  - X Week X +100% - X Month XX +333% ### Followers: XX [#](/creator/twitter::1911028026323738624/followers)  - X Week XX +23% - X Month XX +233% ### CreatorRank: undefined [#](/creator/twitter::1911028026323738624/influencer_rank)  ### Social Influence [#](/creator/twitter::1911028026323738624/influence) --- ### Top Social Posts [#](/creator/twitter::1911028026323738624/posts) --- Top posts by engagements in the last XX hours "@PythagoraAI Yes bro DFS is more optimized here since it's a BST if the current node value is smaller than L we dont need to traverse its left subtree and similarly if its greater than r we can skip the right subtree" [X Link](https://x.com/diwa810/status/1978916643695686032) [@diwa810](/creator/x/diwa810) 2025-10-16T20:11Z XX followers, XX engagements "Day XX of #100DaysOfCodeSolved the POTD on #GFG Remove BST keys outside given range Approach Used #DFS traversal in postorder (left right root) For each node checked if its value lies within the range based on that returned the appropriate left or right child #DSA #LeetCode" [X Link](https://x.com/diwa810/status/1978918198570295480) [@diwa810](/creator/x/diwa810) 2025-10-16T20:17Z XX followers, XX engagements "Day XX of #100DaysOfCode Solvde potd on #gfg Median of BST & #LeetCode 3397 X first calculate no of nodes and run the inorder traverse for (total+1)/2 and return that node X sort the array and use the last no i can create from the prev no and acc to that inc the cnt #Coding #DSA" [X Link](https://x.com/diwa810/status/1979653976577704186) [@diwa810](/creator/x/diwa810) 2025-10-18T21:01Z XX followers, XX engagements
[GUEST ACCESS MODE: Data is scrambled or limited to provide examples. Make requests using your API key to unlock full data. Check https://lunarcrush.ai/auth for authentication information.]
@diwa810 Diwakar Upadhyay
Diwakar Upadhyay posts on X about the most. They currently have XX followers and XX posts still getting attention that total X engagements in the last XX hours.
Engagements: X #
- X Week XXX +61%
- X Month XXX +1,380%
Mentions: X #
- X Week X +100%
- X Month XX +333%
Followers: XX #
- X Week XX +23%
- X Month XX +233%
CreatorRank: undefined #
Social Influence #
Top Social Posts #
Top posts by engagements in the last XX hours
"@PythagoraAI Yes bro DFS is more optimized here since it's a BST if the current node value is smaller than L we dont need to traverse its left subtree and similarly if its greater than r we can skip the right subtree"
X Link @diwa810 2025-10-16T20:11Z XX followers, XX engagements
"Day XX of #100DaysOfCodeSolved the POTD on #GFG Remove BST keys outside given range Approach Used #DFS traversal in postorder (left right root) For each node checked if its value lies within the range based on that returned the appropriate left or right child #DSA #LeetCode"
X Link @diwa810 2025-10-16T20:17Z XX followers, XX engagements
"Day XX of #100DaysOfCode Solvde potd on #gfg Median of BST & #LeetCode 3397 X first calculate no of nodes and run the inorder traverse for (total+1)/2 and return that node X sort the array and use the last no i can create from the prev no and acc to that inc the cnt #Coding #DSA"
X Link @diwa810 2025-10-18T21:01Z XX followers, XX engagements