Minimum Number of Steps to Make Two Strings Anagram at DoorDash

Problem Description

You are given two strings of the same length `s` and `t`. In one step you can choose **any character** of `t` and replace it with **another character**. Return _the minimum number of steps_ to make `t` an anagram of `s`. An **Anagram** of a string is a string that contains the same characters with...

Topics

Also asked at 9 companies