Subhartha Das

🚀 Day 57/60 Next Smallest Palindrome Mirror → Compare → Increment Middle → Mirror again O(N) solution, classic interview problem! #GeekStreak60 #DSA #python #npci @geeksforgeeks @NPCI_NPCI

🚀 Day 56 #GeekStreak60 Toeplitz Matrix check 👉 Compare mat[i][j] with mat[i-1][j-1] ❌ Mismatch = Not Toeplitz ✅ All match = Toeplitz ⏱ O(N*M) | Simple pattern trick #coding #python #gfg #dsa #npci @geeksforgeeks @NPCI_NPCI

🚀 Day 55/60 #GeekStreak60 Count increasing subarrays (size ≥2) 💡 Use streak → add (len-1) ⚡ O(n) time | O(1) space #DSA #Coding #Python #gfg #npci @geeksforgeeks @NPCI_NPCI

Day 54 🚀 #GeekStreak60 Solved Sorted Subsequence of Size 3 using an efficient O(n) approach 💡 Key idea: fix middle → check left < mid < right Consistency is the real growth 🚀 #DSA #CodingJourney #npci @geeksforgeeks @NPCI_NPCI

Day 53 🚀 #GeekStreak60 Solved Intersection of Two Sorted Arrays using two pointers Achieved O(n + m) with no extra space 💡 #DSA #CodingJourney #Consistency #npci @geeksforgeeks @NPCI_NPCI

🚀 Day 52/60 – Segregate 0s and 1s ⚡ Two-pointer approach → in-place O(n), O(1) space 💡 Minimal swaps, maximum efficiency — clean partitioning logic Consistency > excuses 🔥 #GeekStreak60 #GFG #DSA #CodingJourney #npci @geeksforgeeks @NPCI_NPCI

Day 51 🚀 #GeekStreak60 Solved Stable Marriage Problem using Gale–Shapley 💍 Stable matching with no blocking pairs in O(n²) ⚙️ Consistency > intensity 🔥 #DSA #Coding #npci @geeksforgeeks @NPCI_NPCI

🚀 Day 50/60 #GeekStreak60 Solved Huffman Encoding using Greedy + Min Heap 🌳 Time: O(n log n) | Space: O(n) ⚙️ Key: maintain index order for correct output 💡 #NPCI #GFG #DSA @geeksforgeeks @NPCI_NPCI

Day 49 🚀 #GeekStreak60 Solved the Target Sum problem using a clever DP transformation. Converted it into a Subset Sum count → efficient over brute force 💡 Consistency > intensity. #DSA #DynamicProgramming #CodingJourney #npci @geeksforgeeks @NPCI_NPCI

Day 48 #GeekStreak60 — Mastered Gray Code Flip just ONE bit at a time → smooth binary transitions Cracked using pattern + bit trick (i ^ i>>1) 💡 From brute force ❌ to elegant logic ✅ #100DaysOfCode #BitManipulation #npci #TechTwitter #python @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 47 Solved “Print Matrix Diagonally” 🔥 💡 Trick: Use (i + j) to group diagonals ⚡ Time: O(n²) ⚠️ Bug: Function name mismatch (diagView) caused runtime error Learning never stops #DSA #Python #100DaysOfCode #npci #GeekStreak60 @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 46 – Painting The Fence 🎨 DP problem: paint n posts with k colors, max 2 same adjacent Key idea → track same & diff states Optimized to O(n) time & O(1) space ⚡ Consistency > motivation 💪 #DSA #Coding #npci #GFG @geeksforgeeks @NPCI_NPCI

🚀 Day 45/60 – #GeekStreak60 🧠 POTD: Consecutive 1’s Not Allowed ⚙️ DP (Fibonacci pattern) | TC: O(n), SC: O(1) 💡 Key: Constraints → pattern recognition ✅ Staying consistent! #DSA #NPCI #GFG @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 44 🧠 Stock Buy/Sell with Fee 💡 Track 2 states: cash & hold ⚡ Sell → pay fee 📈 O(n), O(1) solution #DSA #Coding #GFGPOTD #npci @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 43 🧠 Minimum Cost to Connect Houses → MST problem in disguise 💡 Used Prim’s Algorithm (Min Heap) ⚡ Efficient + Greedy approach Consistency > Motivation 🔥 #DSA #Coding #GFGPOTD #npci @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 42 Partitions with Given Difference 💡 Trick: Convert to subset sum target = (sum + diff) // 2 ⚡ Count subsets using DP Consistency wins 🔥 #npci @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 41 🧠 Articulation Point – II (Cut Vertices) 💡 DFS + tin[] & low[] → find critical nodes ⚡ O(V+E) | Break node = break graph #GFGPOTD #DSA #Graphs #CodingJourney #npci @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 40 🍫 Chocolate Pickup2 robots, 9 moves each step → DP needed!🧠 State: dp[i][j1][j2] ⚡ O(n*m²) optimization Consistency > Motivation 🔥 #GFGPOTD #DSA #CodingChallenge #npci @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 39 🧠 Count shortest paths using Dijkstra + ways[] → shorter path: replace → same path: add Consistency wins 🔥 #GFGPOTD #DSA #NPCI @geeksforgeeks @NPCI_NPCI

🚀 #GeekStreak60 Day 38 🧠 Minimum Height Roots 💡 Trim leaves layer by layer → reach centroids ⚡ BFS + degree (Topological) = O(V) 🔥 Tree ka center hi answer! #GFGPOTD #NPCI #DSA #Graphs #Coding #GeeksforGeeks @geeksforgeeks @NPCI_NPCI