页面顶部 Top
文件:  root - text - article - 2020 - 02 - staying-on-a-chess-board.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 333 次阅读, 22250 次搜索 | 94 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by Google:

A chess board is an 8x8 grid. Given a knight at any position (x, y) and a number of moves k, we want to figure out after k random moves by a knight, the probability that the knight will still be on the chessboard. Once the knight leaves the board it cannot move again and will be considered off the board.

Here's some starter code:

def is_knight_on_board(x, y, k, cache={}):
# Fill this in.

print is_knight_on_board(0, 0, 1)
# 0.25
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 333 次阅读, 22250 次搜索 | 94 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Puzzle: Minimum Size Subarray Sum
  2. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  3. Daily Interview Question: Word Search
  4. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  5. Top K Frequent words
  6. Algorithm Interview: Level Order Traversal of Binary Tree
  7. Daily Interview Problem: Longest Substring With K Distinct Characters
  8. Daily Interview Problem: Trapping Rainwater
  9. Daily Interview Problem: Count Number of Unival Subtrees
  10. Fix Brackets

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />