Making Anagrams

Problem Statement :

We consider two strings to be anagrams of each other if the first string's letters can be rearranged to form the second string. In other words, both strings must contain the same exact letters in the same exact frequency. For example, bacdc and dcbac are anagrams, but bacdc and dcbad are not.

Alice is taking a cryptography class and finding anagrams to be very useful. She decides on an encryption scheme involving two large strings where encryption is dependent on the minimum number of character deletions required to make the two strings anagrams. Can you help her find this number?

Given two strings,  s1 and s2, that may not be of the same length, determine the minimum number of character deletions required to make  s1 and s2 anagrams. Any characters can be deleted from either of the strings.

Function Description

Complete the makingAnagrams function in the editor below.

makingAnagrams has the following parameter(s):

string s1: a string
string s2: a string

int: the minimum number of deletions needed
Input Format

The first line contains a single string, s1.
The second line contains a single string, s2


1  <=   | s1 | ,  | s2 |  <=  10^4

It is guaranteed that s1 and s2 consist of lowercase English letters, ascii[a-z]..

Solution :


                            Solution in C :

In   C++  :

#include <cmath>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    char s1[10010],s2[10010];
    int a[26]={0};
    for(int i=0;i<strlen(s1);i++)
    for(int i=0;i<strlen(s2);i++)
    long long int ans = 0;
    for(int i=0;i<26;i++)
        ans += abs(a[i]);
    return 0;

In   Java  :

import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) throws Exception{
        BufferedReader br = new BufferedReader(new InputStreamReader(;
        String str1 = br.readLine();
        String str2 = br.readLine();
        int[] counts1 = new int[256];
        int[] counts2 = new int[256];        
        for(int i=0; i<str1.length();i++)
            int index = (int)(str1.charAt(i) - '\0');
            counts1[index] += 1;
        for(int i=0; i<str2.length();i++)
            int index = (int)(str2.charAt(i) - '\0');
            counts2[index] += 1;
        int ans = 0;
        for(int i=0; i<256;i++)
            ans += Math.abs(counts1[i] - counts2[i]);

In   C :

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

    char str1[20000];
    char str2[20000];
    scanf("%s", str1);
    scanf("%s", str2);
    int n1 = strlen(str1);
    int n2 = strlen(str2);
int i, j;
    char s1[26] = {0};
    for (i = 0; i < n1; ++i) {
        s1[str1[i] - 97] += 1;
    for (i = 0; i < n2; ++i) {
        s1[str2[i] - 97] -= 1;
    int count = 0;
    for (i = 0; i < 26; ++i) {
        count += abs(s1[i]);
    printf("%d\n", count);
    return 0;

In   Python3 :

import sys
from functools import *

a = sys.stdin.readline()
b = sys.stdin.readline()

x = {}

def f(w, cf = 1):
    for c in w:
        if c not in 'abcdefghijklmnopqrstuvwxyz':
        if c not in x:
            x[c] = 0
        x[c] += cf

f(b, -1)

res = reduce(lambda a, b: a + abs(x[b]), x.keys(), 0)


View More Similar Problems

Queries with Fixed Length

Consider an -integer sequence, . We perform a query on by using an integer, , to calculate the result of the following expression: In other words, if we let , then you need to calculate . Given and queries, return a list of answers to each query. Example The first query uses all of the subarrays of length : . The maxima of the subarrays are . The minimum of these is . The secon

View Solution →


This question is designed to help you get a better understanding of basic heap operations. You will be given queries of types: " 1 v " - Add an element to the heap. " 2 v " - Delete the element from the heap. "3" - Print the minimum of all the elements in the heap. NOTE: It is guaranteed that the element to be deleted will be there in the heap. Also, at any instant, only distinct element

View Solution →

Jesse and Cookies

Jesse loves cookies. He wants the sweetness of all his cookies to be greater than value K. To do this, Jesse repeatedly mixes two cookies with the least sweetness. He creates a special combined cookie with: sweetness Least sweet cookie 2nd least sweet cookie). He repeats this procedure until all the cookies in his collection have a sweetness > = K. You are given Jesse's cookies. Print t

View Solution →

Find the Running Median

The median of a set of integers is the midpoint value of the data set for which an equal number of integers are less than and greater than the value. To find the median, you must first sort your set of integers in non-decreasing order, then: If your set contains an odd number of elements, the median is the middle element of the sorted sample. In the sorted set { 1, 2, 3 } , 2 is the median.

View Solution →

Minimum Average Waiting Time

Tieu owns a pizza restaurant and he manages it in his own way. While in a normal restaurant, a customer is served by following the first-come, first-served rule, Tieu simply minimizes the average waiting time of his customers. So he gets to decide who is served first, regardless of how sooner or later a person comes. Different kinds of pizzas take different amounts of time to cook. Also, once h

View Solution →

Merging Communities

People connect with each other in a social network. A connection between Person I and Person J is represented as . When two persons belonging to different communities connect, the net effect is the merger of both communities which I and J belongs to. At the beginning, there are N people representing N communities. Suppose person 1 and 2 connected and later 2 and 3 connected, then ,1 , 2 and 3 w

View Solution →