Check String Permutations | Dataford Interview Questions

Foursquare may compare alternate text representations of a place name during Places search processing. Given two strings, determine whether one is a permutation of the other.

Two strings are permutations if they contain exactly the same characters with the same frequencies. Character casing and whitespace are significant, so "Cafe" and "cafe" are different, as are "New York" and "NewYork".

Formal Specification

Implement are_permutations(s, t).

Input: Two strings s and t.
Output: Return True if t is a permutation of s; otherwise, return False.
Do not modify either input string.

Constraints

0 <= len(s), len(t) <= 10^5
Strings contain printable ASCII characters
Matching is case-sensitive
Spaces and punctuation are treated as ordinary characters

Function Signature

def are_permutations(s, t):

Your question is Check String Permutations. 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