Algorithm · Bloomberg · Easy
Given two strings s and t, create a function that decides whether t is an anagram of s. Assume both strings contain lowercase letters only. Do not use OrderedDict, and describe the code's execution flow in detail. Example Explanation: Both strings contain the same lowercase characters with identical frequencies, so silent is an anagram of listen.
Checking your access…