Package g2501_2600.s2506_count_pairs_of_similar_strings

Class Solution

java.lang.Object
g2501_2600.s2506_count_pairs_of_similar_strings.Solution
public class Solution extends Object
2506 - Count Pairs Of Similar Strings.<p>Easy</p> <p>You are given a <strong>0-indexed</strong> string array <code>words</code>.</p> <p>Two strings are <strong>similar</strong> if they consist of the same characters.</p> <ul> <li>For example, <code>&quot;abca&quot;</code> and <code>&quot;cba&quot;</code> are similar since both consist of characters <code>'a'</code>, <code>'b'</code>, and <code>'c'</code>.</li> <li>However, <code>&quot;abacba&quot;</code> and <code>&quot;bcfd&quot;</code> are not similar since they do not consist of the same characters.</li> </ul> <p>Return <em>the number of pairs</em> <code>(i, j)</code> <em>such that</em> <code>0 <= i < j <= word.length - 1</code> <em>and the two strings</em> <code>words[i]</code> <em>and</em> <code>words[j]</code> <em>are similar</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> words = [&ldquo;aba&rdquo;,&ldquo;aabb&rdquo;,&ldquo;abcd&rdquo;,&ldquo;bac&rdquo;,&ldquo;aabc&rdquo;]</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> There are 2 pairs that satisfy the conditions:</p> <ul> <li> <p>i = 0 and j = 1 : both words[0] and words[1] only consist of characters &lsquo;a&rsquo; and &lsquo;b&rsquo;.</p> </li> <li> <p>i = 3 and j = 4 : both words[3] and words[4] only consist of characters &lsquo;a&rsquo;, &lsquo;b&rsquo;, and &lsquo;c&rsquo;.</p> </li> </ul> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> words = [&ldquo;aabb&rdquo;,&ldquo;ab&rdquo;,&ldquo;ba&rdquo;]</p> <p><strong>Output:</strong> 3</p> <p><strong>Explanation:</strong> There are 3 pairs that satisfy the conditions:</p> <ul> <li> <p>i = 0 and j = 1 : both words[0] and words[1] only consist of characters &lsquo;a&rsquo; and &lsquo;b&rsquo;.</p> </li> <li> <p>i = 0 and j = 2 : both words[0] and words[2] only consist of characters &lsquo;a&rsquo; and &lsquo;b&rsquo;.</p> </li> <li> <p>i = 1 and j = 2 : both words[1] and words[2] only consist of characters &lsquo;a&rsquo; and &lsquo;b&rsquo;.</p> </li> </ul> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> words = [&ldquo;nba&rdquo;,&ldquo;cba&rdquo;,&ldquo;dba&rdquo;]</p> <p><strong>Output:</strong> 0</p> <p><strong>Explanation:</strong> Since there does not exist any pair that satisfies the conditions, we return 0.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= words.length <= 100</code></li> <li><code>1 <= words[i].length <= 100</code></li> <li><code>words[i]</code> consist of only lowercase English letters.</li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • similarPairs

      public int similarPairs(String[] words)