File: root - text - article - 2019 - 11 - ways-to-traverse-a-grid.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 482 Views, 19372 Search Bots | 80 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Category: Computing | 482 Views, 19372 Search Bots | 80 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Hi, here's your problem today. This problem was recently asked by Microsoft:
You 2 integers n and m representing an n by m grid, determine the number of ways you can get from the top-left to the bottom-right of the matrix y going only right or down.
Example:
n = 2, m = 2
This should return 2, since the only possible routes are:
Right, down
Down, right.
Here's the signature:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, | English | Home Page | Cateogry: Computing | 482 Views, 19372 Search Bots | 80 Words You 2 integers n and m representing an n by m grid, determine the number of ways you can get from the top-left to the bottom-right of the matrix y going only right or down.
Example:
n = 2, m = 2
This should return 2, since the only possible routes are:
Right, down
Down, right.
Here's the signature:
def num_ways(n, m):
# Fill this in.
print num_ways(2, 2)
# 2
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Daily Interview Problem: Largest BST in a Binary Tree
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Daily Interview Problem: Running Median
- Daily Interview Question: Longest Sequence with Two Unique Numbers
- Algorithm Interview: Permutations of numbers
- Daily Interview Problem: Min Range Needed to Sort
- Daily Interview Problem: Group Words that are Anagrams
- How to Play WAV music under DOS?
- Algorithm Interview: Maximum Path Sum in Binary Tree
- Daily Interview Problem: Room scheduling
©2006~2024 SteakOverCooked - 0.01384 Seconds(s) - 3900.818 KB/s - 10 Online
Memory: 516.38 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !