Package g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences

Class Solution

java.lang.Object

g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences.Solution

public class Solution
extends Object

1941 - Check if All Characters Have Equal Number of Occurrences.<p>Easy</p> <p>Given a string <code>s</code>, return <code>true</code> <em>if</em> <code>s</code> <em>is a <strong>good</strong> string, or</em> <code>false</code> <em>otherwise</em>.</p> <p>A string <code>s</code> is <strong>good</strong> if <strong>all</strong> the characters that appear in <code>s</code> have the <strong>same</strong> number of occurrences (i.e., the same frequency).</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> s = &ldquo;abacbc&rdquo;</p> <p><strong>Output:</strong> true</p> <p><strong>Explanation:</strong> The characters that appear in s are &lsquo;a&rsquo;, &lsquo;b&rsquo;, and &lsquo;c&rsquo;. All characters occur 2 times in s.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> s = &ldquo;aaabb&rdquo;</p> <p><strong>Output:</strong> false</p> <p><strong>Explanation:</strong> The characters that appear in s are &lsquo;a&rsquo; and &lsquo;b&rsquo;. &lsquo;a&rsquo; occurs 3 times while &lsquo;b&rsquo; occurs 2 times, which is not the same number of times.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= s.length <= 1000</code></li> <li><code>s</code> consists of lowercase English letters.</li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	areOccurrencesEqual(String s)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

areOccurrencesEqual

public boolean areOccurrencesEqual(String s)