Rearranged String Check (Anagram)

Asked at Stackline · Coding Questions · Difficulty: Easy

Given two strings, determine whether one string can be transformed into another string by rearranging its letters. Consider case-sensitivity. Note that both strings consist only of letters. Valid input examples include: 'abc' and 'cab', 'aBc' and 'bCa'. Please provide a solution with a time and space complexity of O(n).

Loading the problem…