Backend developer with a passion for solving real-world problems. Maintaining my streak on GeeksforGeeks and LeetCode, one challenge at a time!linkedin.com/in/sumit-kumar… India Joined February 2024
⚡️ Day 360 of #geekstreak2025
✅ GFG POTD: Find length of Loop
🧠 Used Floyd’s Cycle Detection (slow & fast pointers).
Once a cycle is detected, counted nodes till slow & fast meet again.
Efficient way to handle loops in linked lists
#dsa#java#geekstreak2025
⚡️ Day 359 of #geekstreak2025
✅ GFG POTD: Sort a linked list of 0s, 1s and 2s
🧠 Counted occurrences of 0, 1 & 2 in the list, then reassigned values in a second traversal.
Simple counting + overwrite = neat & efficient
#dsa#java#gfg160#geekstreak2025
⚡️ Day 358 of #geekstreak2025
Tried today’s POTD (Linked List Group Reverse) but couldn’t submit on GFG because of a technical issue 🙃
Still solved it locally though — so streak is alive!
See you tomorrow🙃
🔥 Day 357 of #geekstreak2025
✅ GFG POTD: Reverse a Doubly Linked List
🧠 Iterated through list → swapped next & prev for each node → tracked last valid node as new head.
Elegant in-place reversal, no extra space.
#dsa#java#linkedlist#geekstreak2025
🔥 Day 356 of #geekstreak2025
✅ GFG POTD: Swap Kth Nodes from Ends
🧠 First counted total nodes → located k-th from start & k-th from end → swapped their values.
Straightforward pointer traversal, no extra space needed
#dsa#java#linkedlist#gfg160#geekstreak2025
🔥 Day 355 of #geekstreak2025
✅ GFG POTD: Sum of Mode
🧠 Used a sliding window + frequency map + treeMap buckets:
Maintain element frequencies
Track mode dynamically per window
Sum up modes across all windows efficiently.
#dsa#java#slidingwindow#geekstreak2025
🔥 Day 354 of #geekstreak2025
✅ GFG POTD: Container With Most Water
🧠 Used two-pointer approach
Start from both ends, calculate area
Move pointer of the smaller height inward
Track max area throughout
#dsa#java#twopointers#gfg160#geekstreak2025
🔥 Day 353 of #geekstreak2025
✅ GFG POTD: The Celebrity Problem
🧠 Brute force check for each person
They don’t know anyone else
Everyone else knows them
If both hold, that’s the celebrity.
#dsa#java#gfg160#geekstreak2025
🔥 Day 352 of #geekstreak2025
✅ GFG POTD: Smallest Window Containing All Characters
🧠 Applied sliding window + hashmap frequency tracking → expand right pointer until all chars of p are covered, then shrink from left to minimize window. #java#slidingwindow#geekstreak2025
🔥 Day 351 of #geekstreak2025
✅ GFG POTD: Maximize Number of 1’s
🧠 Used sliding window approach → expand window while counting zeros, shrink it when zeros exceed k.
kept track of max window length = longest subarray with at most k flips to 1.
#gfg160#geekstreak2025
🔥 Day 350 of #geekstreak2025
✅ GFG POTD: Count the number of possible triangles
🧠 Sorted the array & fixed the largest side.
then applied two-pointer approach → if arr[left] + arr[right] > arr[i], all pairs between left..right-1 are valid triangles.
#geekstreak2025
🔥 Day 349 of #geekstreak2025
✅ GFG POTD: Check if a String is Subsequence of Other
🧠 Used a stack-based approach → pushed chars of s1 and matched them backward with s2. if stack gets empty, s1 is subsequence of s2...
#dsa#java#gfg160#geekstreak2025
🔥 Day 348 of #geekstreak2025
✅ GFG POTD: Maximize Median After K Additions
🧠 Sorted array → focused only on the upper half (since median lies there). Used gaps between elements to distribute k efficiently. Greedy + math-driven approach to maximize median.
#dsa#java#gfg160
🔥 Day 347 of #geekstreak2025
✅ GFG POTD: Minimum Days to Make M Bouquets
🧠 Tried a greedy shortcut → sort + pick the (m×k)(m \times k)(m×k)-th bloom day. Works for some cases, but not the most efficient (ideal approach = Binary Search on Days).
#dsa#gfg160#geekstreak2025
🔥 Day 346 of #geekstreak2025
✅ GFG POTD: Allocate Minimum Pages
🧠 Solved using Binary Search on Answer – checked the feasibility of distributing books among students by keeping the max pages minimal. Classic partition problem
#dsa#java#binarysearch#gfg160#geekstreak2025
🔥 Day 345 of #geekstreak2025
✅ GFG POTD: Median in a Row-wise Sorted Matrix
🧠 Took the brute force route — flattened the matrix, sorted it, and grabbed the middle element. Not the most optimal, but works fine for manageable sizes
#dsa#java#gfgpotd#gfg160#geekstreak2025
🔥 Day 344 of #geekstreak2025
✅ GFG POTD: Maximize the Minimum Difference between k elements
🧠 Sorted the array + used binary search on answer. Checked feasibility with a greedy placement strategy. Classic BS on constraints pattern
#dsa#java#gfgpotd#gfg160#geekstreak2025
🔥 Day 343 of #geekstreak2025
✅ GFG POTD: Search in Fully Rotated Sorted 2D Matrix
🧠 Tried brute-force first (works fine), but then optimized with a binary search treating the matrix as 1D + handling rotation logic. Much faster & cleaner
#dsa#java#gfgpotd#gfg160
2K Followers 2K FollowingA JavaScript Junkie 💻| Documenting my journey in tech 📝 | Daily tweets about Web development ⌨️🤝| A Passionate Chess Player♟️.
306 Followers 923 FollowingGlistenreport is an independent news platform.
Here we provide you only interesting report around the globe, which you will like very much.
132 Followers 386 Following💻 Hire On-Demand Devs for seamless vibe-coding.
📌 Get instant, real-time coding experts.
🌎 Powered by global talent, built for creators.
68 Followers 101 FollowingC++ is my mother tongue
Guru Nanak Dev University Amritsar
Btech CSE
Instagram : vansh.thakur005
Leetcode & gfg username : vanshthakur005
linkedin:
2K Followers 2K FollowingA JavaScript Junkie 💻| Documenting my journey in tech 📝 | Daily tweets about Web development ⌨️🤝| A Passionate Chess Player♟️.
68 Followers 101 FollowingC++ is my mother tongue
Guru Nanak Dev University Amritsar
Btech CSE
Instagram : vansh.thakur005
Leetcode & gfg username : vanshthakur005
linkedin: