Freaks City

Problem Description A robot is located at the top - left corner of an m x n grid (marked 'Start'). The robot can only move either down or right at any point. The goal is to reach the bottom - right corner (marked 'Finish'). We need to determine the number of unique paths possible. Examples Example 1: Input: rows = 3, cols = 7 Output: 28 Exampl ...