谷歌实习挂经

[hero]

两轮店面各45分钟

第一轮

• Knight’s Shortest Path on an Infinite Chessboard
• https://leetcode.com/problems/escape-a-large-maze

第二轮

• Print the pattern
  A,F,G
  B,E,H
  C,D,I
• Given an asynchronous function f(data,callback) , implement a function p(n,f) which executes function f , if it gets result return it, else retry function f n-times and if fails(after n-tries) return error.