InterviewDigestCoding2026-08-16
A dynamic programming problem of Medium level (e.g., Knight's Problem)
AI-Expanded — inferred from the question title, not from the original candidate report
Given an $N \times N$ chessboard, calculate the total number of distinct sequences of $K$ moves a knight can make such that it remains within the boundaries of the board at every step. You must return the probability that the knight is still on the board after $K$ moves, assuming it chooses each of its eight possible moves with equal probability at each turn.
Context & Summary
Conducted on HackerRank with 3 questions of Easy-Medium difficulty. Time limit was 2 hours.
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.