Summary
Full Transcript
Graph/Trees Playlist : https://youtube.com/playlist?list=PLauivoElc3ghxyYSr_sVnDUc_ynPk6iXE FREE COMPETITIVE PROGRAMMING COURSE PLAYLIST : https://youtube.com/playlist?list=PLauivoElc3ggagradg8MfOZreCMmXMmJ- 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/breadth-first-search.html https://www.hackerearth.com/practice/algorithms/graphs/breadth-first-search/practice-problems/ Timestamps: Explanation: (0:00) Code: (6:17) Be a part of our awesome Community. Join ○ Discord : https://discord.gg/GMH23tq7Y7 ○ Telegram : https://t.me/LuvIsMeYT You can follow me on below platforms for all the latest updates ○ Instagram : https://www.instagram.com/i._m_.luv/ ○ Twitter : https://twitter.com/Luvk1412 ○ Linkedin : https://www.linkedin.com/in/luvk1412/ Blog(Not frequently updated) ○ Blog : https://www.codewithluv.in Hashtags #shortest #path #nakanj #spoj #bfs
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.
