String Equivalence in Python | Dataford Interview Questions

RTI Connext DDS applications may validate topic-related strings before configuring communication. Write a function that determines whether two strings are equivalent when character order is ignored.

Two strings are equivalent if they have the same length and every character appears the same number of times in both strings. Comparisons are case-sensitive, and spaces, punctuation, and other characters count like any other character.

Formal Specification

Implement are_equivalent(s1, s2):

Input: Two Python strings, s1 and s2.
Output: Return True if the strings contain identical character frequencies, otherwise return False.
Do not modify either input string.

Constraints

0 <= len(s1), len(s2) <= 10^5
Strings contain Unicode characters supported by Python
Character order is irrelevant
Character multiplicity is significant
Comparisons are case-sensitive and whitespace is significant

Function Signature

def are_equivalent(s1, s2):

Your question is String Equivalence in Python. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem