Back to Problems

Maze Path Counter

Medium
dynamic-programming combinatorics grid
Problem Description

Count unique paths from top-left to bottom-right in a grid. You can only move right or down.

Input Format
Two integers m and n (grid dimensions)
Output Format
Number of unique paths
Constraints
1 ≤ m, n ≤ 20
Sample Input/Output
Input: 
3 7
Output: 
28
Explanation

In a 3x7 grid, there are 28 unique paths from (0,0) to (2,6)

Solution Hints
  • Read carefully: Understand input/output format and constraints
  • Start simple: Think of brute force solution first, then optimize
  • Edge cases: Consider empty inputs, single elements, max constraints
  • Data structures: Choose arrays, hash maps, sets based on problem needs
  • Time complexity: Ensure your solution fits within time limits
  • Test examples: Verify logic with provided sample inputs
170
Points
2000ms
Time Limit
256MB
Memory Limit
Code Editor
Register to Submit
Register to Access Code Editor

Create a free account to solve coding problems and track your progress.

Register Now
Feedback