word-pattern

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given a <code>pattern</code> and a string <code>s</code>, find if <code>s</code>&nbsp;follows the same pattern.

Here follow means a full match, such that there is a bijection between a letter in <code>pattern</code> and a non-empty word in <code>s</code>. Specifically:

<ul>
	<li>Each letter in <code>pattern</code> maps to exactly one unique word in <code>s</code>.</li>
	<li>Each unique word in <code>s</code> maps to exactly one letter in <code>pattern</code>.</li>
	<li>No two letters map to the same word, and no two words map to the same letter.</li>
</ul>

&nbsp;
Example 1:

<div class="example-block">
Input: pattern = &quot;abba&quot;, s = &quot;dog cat cat dog&quot;

Output: true

Explanation:

The bijection can be established as:

<ul>
	<li><code>&#39;a&#39;</code> maps to <code>&quot;dog&quot;</code>.</li>
	<li><code>&#39;b&#39;</code> maps to <code>&quot;cat&quot;</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: pattern = &quot;abba&quot;, s = &quot;dog cat cat fish&quot;

Output: false
</div>

Example 3:

<div class="example-block">
Input: pattern = &quot;aaaa&quot;, s = &quot;dog cat cat dog&quot;

Output: false
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= pattern.length &lt;= 300</code></li>
	<li><code>pattern</code> contains only lower-case English letters.</li>
	<li><code>1 &lt;= s.length &lt;= 3000</code></li>
	<li><code>s</code> contains only lowercase English letters and spaces <code>&#39; &#39;</code>.</li>
	<li><code>s</code> does not contain any leading or trailing spaces.</li>
	<li>All the words in <code>s</code> are separated by a single space.</li>
</ul>