Flipkart Grid | September 2026 | Questions and Video Solutions | Kumar K | Set 43

Question

One was, we are given an undirected graph with N locations and M existing pathways.

 

Choose one location.

Build all missing pathways from that location to every other location.

While doing this, all old pathways connected to that chosen location are removed.

 

So after the operation, the chosen location is connected only to the locations that were previously not connected to it.

 

We can perform this operation on any location, any number of times.

And we need to return if it is possible to make every location pairs directly connected like a complete graph,if yes we needed to print Complete day else Not a Complete day