2 phone screen's of 45 mins each

Phone Screen 1:

• Given height,width output the following sequence of characters:
  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.

Phone Screen 2:

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

2nd Interview went very well, i was able to come up with 2 way BFS solutions and interviewer seemed satisfied.
I screwed up first interview because of 2nd question (asynchronous) .
The interviewer's were very kind and helpful .