create-grid-with-exactly-one-path

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given two integers <code>m</code> and <code>n</code>, representing the number of rows and columns of a grid.

Construct any <code>m x n</code> grid consisting only of the characters <code>&#39;.&#39;</code> and <code>&#39;#&#39;</code>, where:

<ul>
	<li><code>&#39;.&#39;</code> represents a free cell.</li>
	<li><code>&#39;#&#39;</code> represents an obstacle cell.</li>
</ul>

A valid path is a sequence of free cells that:

<ul>
	<li>Starts at the top-left cell <code>(0, 0)</code>.</li>
	<li>Ends at the bottom-right cell <code>(m - 1, n - 1)</code>.</li>
	<li>Moves only:
	<ul>
		<li>Right, from <code>(i, j)</code> to <code>(i, j + 1)</code>, or</li>
		<li>Down, from <code>(i, j)</code> to <code>(i + 1, j)</code>.</li>
	</ul>
	</li>
</ul>

Return any grid such that there is exactly one valid path from the top-left cell to the bottom-right cell.

&nbsp;
Example 1:

<div class="example-block">
Input: m = 2, n = 3

Output: [&quot;..#&quot;,&quot;#..&quot;]

Explanation:

<img src="https://assets.leetcode.com/uploads/2026/05/26/screenshot-2026-05-26-at-61005pm.png" style="width: 200px; height: 95px;" />

The only valid path is: <code>(0,0) &rarr; (0,1) &rarr; (1,1) &rarr; (1,2)</code>
</div>

Example 2:

<div class="example-block">
Input: m = 3, n = 3

Output: [&quot;..#&quot;,&quot;#..&quot;,&quot;##.&quot;]

Explanation:

<img src="https://assets.leetcode.com/uploads/2026/05/26/screenshot-2026-05-26-at-61129pm.png" style="width: 220px; height: 150px;" />

The only valid path is: <code>(0,0) &rarr; (0,1) &rarr; (1,1) &rarr; (1,2) &rarr; (2,2)</code>
</div>

Example 3:

<div class="example-block">
Input: m = 1, n = 4

Output: [&quot;....&quot;]

Explanation:

The only valid path is: <code>(0,0) &rarr; (0,1) &rarr; (0,2) &rarr; (0,3)</code>
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= m, n &lt;= 25</code></li>
</ul>

Biweekly Contest 185

biweekly-contest-185

createGrid

Mid Level

Create Grid With Exactly One Path

Accepted

Wrong Answer

Memory Limit Exceeded

Output Limit Exceeded

Time Limit Exceeded

Runtime Error

Internal Error

Compile Error

Timeout

Restrictions Failed

cangjie

react

vanillajs

You are given two integers m and n, representing the number of rows and columns of a grid.

Construct any m x n grid consisting only of the characters '.' and '#', where:

 * '.' represents a free cell.
 * '#' represents an obstacle cell.

A valid path is a sequence of free cells that:

 * Starts at the top-left cell (0, 0).
 * Ends at the bottom-right cell (m - 1, n - 1).
 * Moves only:
 * Right, from (i, j) to (i, j + 1), or
 * Down, from (i, j) to (i + 1, j).

Return any grid such that there is exactly one valid path from the top-left cell to the bottom-right cell.

 

Example 1:

Input: m = 2, n = 3

Output: ["..#","#.."]

Explanation:

[https://assets.leetcode.com/uploads/2026/05/26/screenshot-2026-05-26-at-61005pm.png]

The only valid path is: (0,0) → (0,1) → (1,1) → (1,2)

Example 2:

Input: m = 3, n = 3

Output: ["..#","#..","##."]

Explanation:

[https://assets.leetcode.com/uploads/2026/05/26/screenshot-2026-05-26-at-61129pm.png]

The only valid path is: (0,0) → (0,1) → (1,1) → (1,2) → (2,2)

Example 3:

Input: m = 1, n = 4

Output: ["...."]

Explanation:

The only valid path is: (0,0) → (0,1) → (0,2) → (0,3)

 

Constraints:

 * 1 <= m, n <= 25