Nilesh H. Thipe

#100DaysOfCode 🚀 Solved today’s GFG POTD — Make the array beautiful Used a stack-based approach to remove adjacent elements with opposite signs and build the final beautiful array efficiently. #GFGPOTD #GeeksforGeeks #DSA #CPP

#100DaysOfCode 🚀 Solved today’s GFG POTD — Not a subset sum Used sorting + greedy approach Missed my POTD and broke a few streaks because of end sem exams and exhaustion, but getting back on track #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 85 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Search for Subarray 🔍 Used a simple sliding comparison approach to find all starting indices where array b appears inside array a ✅ #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 84 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Mother Vertex 🌐 Used DFS to find a potential mother vertex and then verified whether it can reach every node in the graph ✅ #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 83 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Range LCM Queries Initial brute-force solution failed on the last test case due to TLE Optimized it using a Segment Tree for efficient range LCM queries and updates #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 82 of #100DaysOfCode 🚀 Finally optimized today’s GFG POTD — Palindrome Pairs Brute force passed most test cases but gave TLE at the end Used hashing + palindrome splitting approach to reduce complexity and get AC #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 81 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Max Profit from Two Machines ⚙️ Used greedy sorting based on profit difference to maximize total profit efficiently. #GFGPOTD #GeeksforGeeks #DSA #CPP

@achieve71246717 ❤️

@Nileshthipe19 👏

Day 80 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Count Spanning Trees in a Graph Learned about spanning trees and used Cayley’s Theorem for complete graphs. #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 79 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Remove Invalid Parentheses Used BFS + validity checking to generate all valid strings with minimum removals. #GFGPOTD #GeeksforGeeks #DSA #CPP

Day 78 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Check if Subtree Used recursion to compare trees and check whether one binary tree exists as a subtree inside another. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 77 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Size of Binary Tree Used recursion to count total nodes by adding sizes of left and right subtrees. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 76 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Sum of XOR of all pairs Used bit manipulation to count contributions of each bit instead of checking all pairs. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 75 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Palindrome Binary Converted number to binary and checked if it reads the same forward and backward. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 74 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Sort by Set Bit Count Used stable sorting with bit manipulation to order elements based on number of set bits. #GFGPOTD #GeeksforGeeks #DSA #Consistency

@MehraAbhis46255 Thanks bro, means a lot

@Nileshthipe19 Lots of hard work 🫡 --> keep it up bro 👍

Day 73 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Position of the Set Bit Used bit manipulation to check if a number has exactly one set bit and find its position. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 72 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Kth Largest in a Stream Used a min heap to efficiently track the kth largest element while processing the stream. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 71 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Check if an Array is Max Heap Validated heap property by ensuring every parent node is greater than its children. #GFGPOTD #GeeksforGeeks #DSA #Consistency

Day 70 of #100DaysOfCode 🚀 Solved today’s GFG POTD — Min Swaps to Group 1s Used sliding window to find the minimum number of swaps by counting zeros in a fixed-size window. #GFGPOTD #GeeksforGeeks #DSA #Consistency