Microsoft Interview Question
1,056 Interview Reviews |
Back to all Microsoft Interview Questions & Reviews
Interview questions and reviews posted anonymously by interview candidates
Interview Question for Software Engineer at Microsoft:
How many unique paths are there from B-L point to the T-R point of a chess table? What would be your approach to calculate this?
| Tags: | recursive algorithm, chess See more , See less 8 |
Helpful Question?
Yes |
No
Inappropriate?
Answers & Comments (6)
Helpful Answer?
Yes |
No
Inappropriate?
Helpful Answer?
Yes |
No
Inappropriate?
0 of 2 people found this helpful
Helpful Answer?
Yes |
No
Inappropriate?
0 of 3 people found this helpful
Helpful Answer?
Yes |
No
Inappropriate?
1 of 1 people found this helpful
f(x, y) = f(x-1, y) + f(x, y-1); where f(1,1) = 1
f(8,8) = 3432
If allow moving in vertical or horizontal or diagonal direction:
f(x, y) = f(x-1, y) + f(x, y-1) + f(x-1, y-1); where f(1,1) = 1
f(8,8) = 48639
Helpful Answer?
Yes |
No
Inappropriate?
Members can
answer or comment on this question
–
Join Now (It's Free) or
Sign In



0 of 2 people found this helpful
by B.P.: