💻 Day-138/365 series of Consistent-Coding-Daily-DSA! 💻 Go with some easy queue concepts: ✅ Queue Implementation Using Array ✅ Deque Implementation Using Array 💾 Codgithub.com/Ashutosh2128/C…DIE #DSA #LeetCode #GFG #ProblemSolving #CodingChallen3PG

Day 38/60, POTD from @geeksforgeeks powered by @NPCI_NPCI Problem: Articulation Points in Graph Approach: Used DFS (Tarjan’s Algo) with discovery & low time to find cut vertices Output: Identified articulation points, Time: O(V+E), Space: O(V) #geekstreak60 #npci #gfg

Day 30/60 – GFG POTD (NPCI Challenge) 🚀 Problem: Articulation Point - II Halfway through the challenge with@NPCI_NPCI! 🏁🔥 • Tech: Tarjan's Algorithm (DFS) 🧠 • Time: O(V+E) | Space: O(V) #geekstreak60 #npci #GFG #@DSA @geeksforge@eks @NPCI_NwSfY

📅 Day 1 – 28 March 2026 Problem:Articulation Point - II Difficulty:Hard Link:geeksforgeeks.org/problem-of-the…7🧠 Key Learnings: Used DFS with discovery time and low arrays Identified articulation points using backtracking logic Handled disconnected graph case@s @geeksforgeeks #gfg #potG1

Day 41/60 🔥 Geekstreak Solved: Articulation Point ⚡ Approach: • DFS + Tarjan’s Algorithm • Use disc & low arrays to detect cut vertices TC: O(V+E) | SC: O(V) �geeksforgeeks.org/problems/artic…eo #geekstreak60 #npci #GfG #POTD #DS@A @geeksforgeek@s @NPCI_NPCcf

Victory is 1111/1111 test cases green! ✅ Just conquered "Articulation Point - II" on @GeeksforGeeks. This one was a beast—dealing with skewed graphs and recursion limits really makes you appreciate the power of an iterative DFS. many more to go! 🚀 #GFG #POTD #NPCI #CodingZ

Solved today's POTD day 52/90 I'll practice daily❤️ #gfg #geeksforgeeks #potd

Day - 87 GeeksforGeeks - POTD Problem : Articulation Point - II #geekstreak60 #npci #gfg #geekstreak2026 #POTD #365daysofcode #coding #POTDwithGFG @NPCI_NPCI

Day - 87 #GFG #POTDwithGFG

Day 40/60 GFG POTD Challenge✅ Solved Articulation Point - II (Hard) 🔥 Learned Tarjan Algorithm (disc[] & low[]), handled disconnected graphs & fixed DFS stack overflow using iterative approach �@� @geeksforgeek@s @NPCI_NPCI #GFG #POTD #Day40 #DSA #Graphs #CodingJourneeF

WOOO! Friday Edition of RANKED RUNS! Edibles , Wine and DINGERS!!! | Co-op w/ @callmeplayz4 | #Nelson #GFG twitch.tv/boricualoko93

1.Max Consecutive Bit 2.Missing in Array #gfg #LeetCode

🌟 Day 39/60 – Geekstreak Solved: Articulation Point - II #geekstreak60 #npci #GfG #POTD #DSA #100DaysOfCode @geeksforgeeks@NPCI_NPCIZ

Day 30 of #GFG60DaysChallenge 📅 27 March 2026 Continuing my 60-Day Problem of the Day streak on@geeksforgeeks powered by@NPCI_NPCI 🚀 Problem: Chocolates Pickup 30 days of consistency — halfway there 🚀🔥 #GeeksforGeeks #GFG #NPCI #JavaProgramming #DSAPractice #ConsisteXDQb

Day 41/60 🚀 Problem:Number of occurrence Platform: GFG geeksforgeeks.org/problems/numbe…X6 #GFG #DSA #Python #60DaysOfCode Quote of the Day: "Things work out best for those who make the best of how things work out." Problem: Number of occurrencR5

Day 41 of #gfg 60 day geekstreak challenge Solved Chocolates pickup and cleared all test cases #geekstreak60 #npci @geeksforgeeks @NPCI_NPCI

🚀 Day 42/60 – GFG Problem of the Day Challenge Starting my 60 Days consistency journey with GeeksforGeeks 💻 One problem every day. No excuses. Let’s build logic. Let’s build discipline. �� #GFG #ProblemOfTheDay #geekstreak60 #npXp5

Day 37/60, POTD from @geeksforgeeks powered by @NPCI_NPCI Problem: Chocolates Pickup Approach: Used 3D DP (row, col1, col2) to track both robots and maximize chocolates Output: Collected max chocolates efficiently, Time: O(n·m²), Space: O(n·m²) #geekstreak60 #npci #gfg

Solved today's POTD on @gfg Day 37 of 60-day POTD challenge on gfg by @NPCI_NPCI Today's question: Chocolates Pickup #gfg #npci Approach: Used 3D DP with two pointers to maximize chocolates collected by exploring all 9 possible moves per step. TC: O(n × m² × 9) SC: O(n × m²)