Hegde Sumanth Shyam
342 posts

Hegde Sumanth Shyam
@ItsDarkMilton
Software Engineer @ABSYZ | 2x Certified | Mastering Salesforce, Golang, and Nextjs 🚀
Bharat Katılım Temmuz 2019
76 Takip Edilen31 Takipçiler

I never run out of content to post anymore.
Built an automation that monitors 50+ news sources, scores articles for relevance, and writes social posts automatically.
It finds trending topics in my niche before they explode everywhere else.
Saves me 15-20 hours monthly and keeps me ahead of every trend.
Comment "NEWS" and I'll DM it to you (must be following)

English

I never run out of content to post anymore.
Built an automation that monitors 50+ news sources, scores articles for relevance, and writes social posts automatically.
It finds trending topics in my niche before they explode everywhere else.
Saves me 15-20 hours monthly and keeps me ahead of every trend.
Comment "NEWS" and I'll DM it to you (must be following)

English

Day 39/60 – 60 Days POTD Challenge 💻🔥
Minimum Height Trees 🌳🧠
Applied topological trimming (removing leaf nodes layer by layer) to find centroids that yield minimum tree height.
@geeksforgeeks
@NPCI_NPCI
#Day39 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 38/60 – 60 Days POTD Challenge 💻🔥
Course Schedule I 📚🧠
Used topological sorting (Kahn’s Algorithm) to detect cycles in the dependency graph and determine if all courses can be completed.
@geeksforgeeks
@NPCI_NPCI
#Day38 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 37/60 – 60 Days POTD Challenge 💻🔥
Length of Longest Cycle in a Graph 🧠
Used DFS with visitation state tracking and depth indexing to detect cycles and compute their lengths efficiently.
@geeksforgeeks
@NPCI_NPCI
#Day37 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 36/60 – 60 Days POTD Challenge 💻🔥
Rotten Oranges 🍊🧠
Used multi-source BFS to simulate the spread of rot level by level and compute the minimum time to rot all oranges.
@geeksforgeeks
@NPCI_NPCI
#Day36 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 35/60 – 60 Days POTD Challenge 💻🔥
Number of BST from Array 🌳🧠
Applied dynamic programming with Catalan number logic to count unique BSTs that can be formed from given elements.
@geeksforgeeks
@NPCI_NPCI
#Day35 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 34/60 – 60 Days POTD Challenge 💻🔥
Predecessor and Successor 🌳🧠
Traversed the BST using inorder logic to efficiently find the immediate predecessor and successor of a given key.
@geeksforgeeks
@NPCI_NPCI
#Day34 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 33/60 – 60 Days POTD Challenge 💻🔥
Distribute Candies 🍬🧠
Used greedy approach with two-pass traversal to ensure each child gets candies based on relative ratings while minimizing total count.
@geeksforgeeks
@NPCI_NPCI
#Day33 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 32/60 – 60 Days POTD Challenge 💻🔥
Burning Tree 🔥🌳🧠
Converted tree to a graph using parent mapping and applied BFS from the target node to compute minimum time to burn the entire tree.
@geeksforgeeks
@NPCI_NPCI
#Day32 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 31/60 – 60 Days POTD Challenge 💻🔥
K Sum Paths 🧠
Used DFS with prefix sum tracking to count all downward paths in a binary tree whose sum equals K efficiently.
@geeksforgeeks
@NPCI_NPCI
#Day31 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 30/60 – 60 Days POTD Challenge 💻🔥
Vertical Tree Traversal 🧠
Performed BFS while tracking horizontal distance and level to group nodes column-wise and output the vertical order traversal.
@geeksforgeeks
@NPCI_NPCI
#Day30 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 29/60 – 60 Days POTD Challenge 💻🔥
Top View of Binary Tree 🧠
Used BFS with horizontal distance tracking and a map to capture the first node visible at each vertical level.
@geeksforgeeks
@NPCI_NPCI
#Day29 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 28/60 – 60 Days POTD Challenge 💻🔥
Generate IP Addresses 🧠
Used backtracking to explore valid segment partitions while enforcing IP constraints (0–255 and no leading zeros).
@geeksforgeeks
@NPCI_NPCI
#Day28 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 27/60 – 60 Days POTD Challenge 💻🔥
Minimum K Consecutive Bit Flips 🧠
Applied greedy approach with sliding window and flip tracking to minimize the number of K-length bit flips.
@geeksforgeeks
@NPCI_NPCI
#Day27 #geekstreak60 #npci #DSA #60DaysPOTD #POTD

English

Day 26/60 – 60 Days POTD Challenge 💻🔥
Sum of Subarray Minimums 🧠
Used stack to find smaller elements, enabling efficient calculation of each element’s contribution across subarrays in O(n).
@geeksforgeeks
@NPCI_NPCI
#Day26 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 25/60 – 60 Days POTD Challenge 💻🔥
Subarrays with First Element Minimum 🧠
Used monotonic stack to determine the span where the first element remains the minimum and counted valid subarrays efficiently.
@geeksforgeeks
@NPCI_NPCI
#Day25 #geekstreak60 #npci #DSA #60DaysPOTD


English

Day 24/60 – 60 Days POTD Challenge 💻🔥
Largest Number in One Swap 🧠
Identified the optimal swap by tracking the maximum digit on the right to maximize the number with a single exchange.
@geeksforgeeks
@NPCI_NPCI
#Day24 #geekstreak60 #npci #DSA #60DaysPOTD #POTD

English

Day 23/60 – 60 Days POTD Challenge 💻🔥
Pythagorean Triplet 🧠
Squared array elements and applied sorting + two-pointer technique to efficiently detect valid triplets satisfying a² + b² = c².
@geeksforgeeks
@NPCI_NPCI
#Day23 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English

Day 22/60 – 60 Days POTD Challenge 💻🔥
Dice Throw 🎲🧠
Used dynamic programming to count the number of ways to achieve a target sum with n dice having m faces.
@geeksforgeeks
@NPCI_NPCI
#Day22 #geekstreak60 #npci #DSA #60DaysPOTD #POTD


English