Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Deletions to Anagrams

Deletions to Anagrams

Difficulty: 1200 3000 ms 128 MB

strings

Delete the minimum number of characters (from either string) so A and B become anagrams of each other. Print that minimum.

Input: two lines: string A, then string B.

Output: the minimum total deletions.

Constraints:

  • 1 ≤ |A|, |B| ≤ 105
  • lowercase letters

Sample Tests

Input 1
cde
abc
Output 1
4
Input 2
aa
aa
Output 2
0

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen