Skip to content

Commit b4812ba

Browse files
committed
Create README - LeetHub
1 parent 219c0a5 commit b4812ba

File tree

1 file changed

+44
-0
lines changed

1 file changed

+44
-0
lines changed
Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
<h2><a href="https://leetcode.com/problems/move-pieces-to-obtain-a-string/">2337. Move Pieces to Obtain a String</a></h2><h3>Medium</h3><hr><div><p>You are given two strings <code>start</code> and <code>target</code>, both of length <code>n</code>. Each string consists <strong>only</strong> of the characters <code>'L'</code>, <code>'R'</code>, and <code>'_'</code> where:</p>
2+
3+
<ul>
4+
<li>The characters <code>'L'</code> and <code>'R'</code> represent pieces, where a piece <code>'L'</code> can move to the <strong>left</strong> only if there is a <strong>blank</strong> space directly to its left, and a piece <code>'R'</code> can move to the <strong>right</strong> only if there is a <strong>blank</strong> space directly to its right.</li>
5+
<li>The character <code>'_'</code> represents a blank space that can be occupied by <strong>any</strong> of the <code>'L'</code> or <code>'R'</code> pieces.</li>
6+
</ul>
7+
8+
<p>Return <code>true</code> <em>if it is possible to obtain the string</em> <code>target</code><em> by moving the pieces of the string </em><code>start</code><em> <strong>any</strong> number of times</em>. Otherwise, return <code>false</code>.</p>
9+
10+
<p>&nbsp;</p>
11+
<p><strong class="example">Example 1:</strong></p>
12+
13+
<pre><strong>Input:</strong> start = "_L__R__R_", target = "L______RR"
14+
<strong>Output:</strong> true
15+
<strong>Explanation:</strong> We can obtain the string target from start by doing the following moves:
16+
- Move the first piece one step to the left, start becomes equal to "<strong>L</strong>___R__R_".
17+
- Move the last piece one step to the right, start becomes equal to "L___R___<strong>R</strong>".
18+
- Move the second piece three steps to the right, start becomes equal to "L______<strong>R</strong>R".
19+
Since it is possible to get the string target from start, we return true.
20+
</pre>
21+
22+
<p><strong class="example">Example 2:</strong></p>
23+
24+
<pre><strong>Input:</strong> start = "R_L_", target = "__LR"
25+
<strong>Output:</strong> false
26+
<strong>Explanation:</strong> The 'R' piece in the string start can move one step to the right to obtain "_<strong>R</strong>L_".
27+
After that, no pieces can move anymore, so it is impossible to obtain the string target from start.
28+
</pre>
29+
30+
<p><strong class="example">Example 3:</strong></p>
31+
32+
<pre><strong>Input:</strong> start = "_R", target = "R_"
33+
<strong>Output:</strong> false
34+
<strong>Explanation:</strong> The piece in the string start can move only to the right, so it is impossible to obtain the string target from start.</pre>
35+
36+
<p>&nbsp;</p>
37+
<p><strong>Constraints:</strong></p>
38+
39+
<ul>
40+
<li><code>n == start.length == target.length</code></li>
41+
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
42+
<li><code>start</code> and <code>target</code> consist of the characters <code>'L'</code>, <code>'R'</code>, and <code>'_'</code>.</li>
43+
</ul>
44+
</div>

0 commit comments

Comments
 (0)