Santa Banta | POTD | GFG Problem of the Day | C++ | Java | Python

Hey guys !! In this video, I've explained the gfg potd( Problem of the Day ) - Santa Banta. This is really interesting problem based on Graph and DFS, BFS. So do watch the full video and hit like if you like the video.

At last I've, explained the implementation in C++, Java and Python

Recommended speed is: 1.25x to 1.5x

Timestamps: -
0:00 Understanding the Problem Statement❓
04:00 Solution: Approach and Tasks🤔
04:40 Task 1: Group of Maximum Size👈
12:00 Task 2: Kth Prime Number👈
16:09 Complexity⌛
16:30 Code Explanation: C++, Java, Python✒️✒️

gfg potd, gfg potd today, potd, gfg, Problem of the Day, Santa Banta gfg, Santa Banta gfg potd, Santa Banta, Santa Banta problem of the day, Santa Banta 2 June, Santa Banta 2 June potd, 2 June gfg potd, 2 June gfg,2 June, C++, Java, Python

#gfg #potd #python #problemoftheday #leetcode #dsa #coding #arrays

Happy Coding :)
Keep Learning !!