We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Apply
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Search
  4. KnightL on a Chessboard
  5. Discussions

KnightL on a Chessboard

Problem
Submissions
Leaderboard
Discussions
Editorial

    You are viewing a single comment's thread. Return to all comments →

  • sizzlingsnigz271
    6 years ago+ 3 comments

    BFS works like a charm here because in unweighted graphs BFS guarantees that the first time you visit a cell it gives the shortest path.

    29|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy