Compute Distinct Paths in Grid

# Introduction

In this challenge, we will create a function named `uniquePaths` that computes the quantity of distinct paths possible for a robot to take in a $m \times n$ grid to reach the lower-right corner. The robot is only capable of making downward or rightward movements at any time. The purpose is to enumerate all conceivable paths. For instance, when presented with a 3 x 2 grid, there exist 3 potential paths starting at the top-left corner and terminating at the bottom-right corner.