$ leetcode version -v
 _           _                  _
| |         | |                | |
| | ___  ___| |_  ___  ___   __| | ___
| |/ _ \/ _ \ __|/ __|/ _ \ / _` |/ _ \
| |  __/  __/ |_  (__| (_) | (_| |  __/
|_|\___|\___|\__|\___|\___/ \__,_|\___|  CLI v2.6.22

[Environment]
Node                 v8.10.0
OS                   linux 4.4.0-17763-Microsoft
Cache                /home/ping/.lc/leetcode/cache
Config               /home/ping/.lc/config.json

[Configuration]
autologin            {"enable":false,"retry":2}
code                 {"editor":"vim","lang":"cpp"}
file                 {"show":"${fid}.${slug}","submission":"${fid}.${slug}.${sid}.${ac}"}
color                {"enable":true,"theme":"default"}
icon                 {"theme":""}
network              {"concurrency":10,"delay":1}
app                  "leetcode"

[Themes]
Colors               blue,dark,default,molokai,orange,pink,solarized,solarized.light
Icons                ascii,default,win7

[Plugins]
solution.discuss     2019.02.03
company              2017.12.18
cache                default
retry                default
leetcode.cn          2018.11.25
leetcode             default

$ leetcode show 62

[62] Unique Paths  

https://leetcode.com/problems/unique-paths/description/

* algorithms
* Medium (50.99%)
* Likes:    2348
* Dislikes: 170
* Total Accepted:    386.9K
* Total Submissions: 757.9K
* Testcase Example:  '3\n2'

<p>A robot is located at the top-left corner of a <em>m</em> x <em>n</em> grid (marked &#39;Start&#39; in the diagram below).</p>

<p>The robot can only move either down or right at any point in time. The robot is trying to reach the bottom-right corner of the grid (marked &#39;Finish&#39; in the diagram below).</p>

<p>How many possible unique paths are there?</p>

<p><img src="https://assets.leetcode.com/uploads/2018/10/22/robot_maze.png" style="width: 400px; height: 183px;" /><br />
<small>Above is a 7 x 3 grid. How many possible unique paths are there?</small></p>

<p><strong>Note:</strong> <em>m</em> and <em>n</em> will be at most 100.</p>

<p><strong>Example 1:</strong></p>

<pre>
<strong>Input:</strong> m = 3, n = 2
<strong>Output:</strong> 3
<strong>Explanation:</strong>
From the top-left corner, there are a total of 3 ways to reach the bottom-right corner:
1. Right -&gt; Right -&gt; Down
2. Right -&gt; Down -&gt; Right
3. Down -&gt; Right -&gt; Right
</pre>

<p><strong>Example 2:</strong></p>

<pre>
<strong>Input:</strong> m = 7, n = 3
<strong>Output:</strong> 28</pre>