🚀 Day 51 of #PTOD �� #geekstreak60 Day 41 Solved: Articulation Point 💡 Key: low[v] >= tin[u] #Graph #DFS #GFG #CodingJourn@ey @geeksforgee@ks @NPCI_NPP7g

Day 154: Open the Lock BFS Treat each state as node, explore all combinations level by level #LeetCode #BFS #Graph 🔐M

Disentangling and Re-evaluating Similarity-Based Graph Structure Learning for GNNs on Node Classification openreview.net/forum?id=j7xOZ… #graph #networks #embeddings

FYI: Änderungen an Mails in #Exchange per #Graph-API werden ab 31.12.2026 eingeschränkt - für Entwickler von Anwendungen relevant, die müssen reagieren. borncity.com/blog/2026/03/2…

Day 33/60 – #geekstreak60 Solved Articulation Points (Cut Vertices) using DFS + Low Time (Tarjan’s Algorithm) to find critical nodes whose removal increases connected components Time – O(V + E) | Space – O(V) #Graph #DataStructures #DFS @syntaxsquad30 @gfg_sstc @NPCI_NPCI

100+ hours of hard work, a big brand like Coal India, and then... Rejection. I felt bad saying it, but a brand designer never accepts defeat. My work was rejected, but not my talent. This struggle is part of my branding. I will come back, and bank better! #NeverGiveUp #Graph

Day 153: Surrounded Regions DFS (Boundary Traversal) Mark border-connected 'O's, convert remaining to 'X' #LeetCode #DFS #Graph

Cherche graphiste pour me faire une affiche (rémunéré) Venez mp #graphiste #affiche #graph

🚀 Day 21 – Graph Series Problem: Circle of Strings Solved using Graph + Eulerian Circuit concept 💡 💻 Practicing with consistency in #100DaysChallenge with Rohit Negi & Aditya Tandon 🙋 #DSA #Graph #Coding #Consistency #PlacementPNb4p

Day 31/60 – #geekstreak60 Solved Number of Ways to Arrive at Destination using Dijkstra + Path Counting to find total shortest paths in a weighted graph Time – O((V + E) log V) | Space – O(V + E) #Graph #ShortestPath #DataStructures @syntaxsquad30 @gfg_sstc @NPCI_NPCI

Day 152: Pacific Atlantic Water Flow DFS (Reverse Flow) Start from oceans and move inward to find common reachable cells #LeetCode #DFS #Graph 🌊U

Day 151: Rotting Oranges BFS (Multi-source) Start from all rotten oranges and spread level by level (minutes) #LeetCode #BFS #Graph 🍊r

Day 30/60 – #geekstreak60 Solved Minimum Height Trees using Topological Sort (Leaf Trimming BFS) to find centroids of a tree Progress: Half Done Time – O(V + E) | Space – O(V) #Graph #TopologicalSort #BFS #DataStructures @syntaxsquad30 @gfg_sstc @NPCI_NPCI

- Equal Sum Grid Partition I - Used Presum to calculate row wise and col wise sums and check can we partition one of those sum arrays to get total_sum/2 sum in each part. #graph #toposort #matrix #dsa #algorithms

Variational Graph Structure Learning for GNNs by using Marginal Likelihood openreview.net/forum?id=fVMr2… #softmax #graphs #graph

Day 7/100 : Game architecture + Daily Challenge (Graph, Matrix) 1. Course Schedule I : Simple Topological sort algorithm to check whether a cycle exists in the graph or not. And also we can use dfs to solve it. I solved this problem using both ways. #DSA #graph #toposort #dfs

Day 150: Clone Graph DFS + HashMap Clone each node and store mapping to avoid cycles #LeetCode #Graph #DFS

Day 29/60 – #geekstreak60 Solved Course Schedule I using Topological Sort (Kahn’s Algorithm) to detect cycle in a directed graph. Time – O(V + E) | Space – O(V) #Graph #DFS #TopologicalSort #BFS #DataStructures @syntaxsquad30 @gfg_sstc @NPCI_NPCI

#graph #GRAPHT

[Design] Du métro aux galeries André, graffeur de 19 ans… youtube.com/watch?v=yv0lJJ… #graph #andre