How to find Shortest Path using BFS | SPOJ NAKANJ | CP Course | EP 79
Graph/Trees Playlist : • Graph & Trees Course
FREE COMPETITIVE PROGRAMMING COURSE PLAYLIST : • Competitive Programming/DSA Course | Hindi
In this Video I explain you how you can find shortest path using BFS and solve the question of SPOJ NAKANJ which is a chess and knight problem
Practice Questions:
https://codeforces.com/blog/entry/8561
discussed : https://www.spoj.com/problems/NAKANJ/
https://cp-algorithms.com/graph/bread...
https://www.hackerearth.com/practice/...
Timestamps:
Explanation: (0:00)
Code: (6:17)
Be a part of our awesome Community. Join
○ Discord : / discord
○ Telegram : https://t.me/LuvIsMeYT
You can follow me on below platforms for all the latest updates
○ Instagram : / i._m_.luv
○ Twitter : / luvk1412
○ Linkedin : / luvk1412
Blog(Not frequently updated)
○ Blog : https://www.codewithluv.in
Hashtags
#shortest #path #nakanj #spoj #bfs