Unique Paths

medium Points: 100

Problem Statement

A robot is located at the top-left corner of a m x n grid. The robot can only move either down or right at any point in time. Return the number of possible unique paths that the robot can take to reach the bottom-right corner.

Constraints

  • 1 ≤ n ≤ 105
  • Input is a list of integers

Examples

Input: [2, 7, 11, 15], target = 9
Output: [0, 1]
Solve Now Ask an Expert

Need Help?

Connect with expert programmers on CodeConnect for real-time collaborative coding, video meetings, and whiteboard sessions.