Graph Series by Striver (take U forward)

Raj Vikramaditya (Striver) of take U forward teaches graph algorithms for coding interviews, with code in both C++ and Java. The series covers what graphs are and their types, representation in C++ and Java, connected components, breadth-first and depth-first search, and problems such as number of provinces, number of islands, flood fill, rotten oranges, cycle detection with BFS and DFS, nearest-cell distance, surrounded regions and enclaves, going on to shortest paths and spanning trees. It suits interview candidates who know basic DSA.