Anagram Checks - Amazon Top Interview Questions


Problem Statement :


Given two strings s0 and s1, return whether they are anagrams of each other.

Constraints

n ≤ 100,000 where n is the length of s0
m ≤ 100,000 where m is the length of s1


Example 1


Input
s0 = "listen"
s1 = "silent"


Output
True



Example 2

Input
s0 = "bedroom"
s1 = "bathroom"


Output
False


Solution :



title-img 




                        Solution in C++ :

int primes[26] = {2,  3,  5,  7,  11, 13, 16, 17, 23, 29, 31, 41, 43,
                  47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101};

bool solve(string s0, string s1) {
    long long firstCode = 0;
    long long secondCode = 0;

    for (auto &c : s0) {
        firstCode += (c - 'a' + 1) * primes[(c - 'a')];
    }

    for (auto &c : s1) {
        secondCode += (c - 'a' + 1) * primes[(c - 'a')];
    }

    return firstCode == secondCode;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public boolean solve(String s0, String s1) {
        if (s0.length() != s1.length())
            return false;

        int[] store = new int[256];

        for (int i = 0; i < s0.length(); i++) {
            store[s0.charAt(i)]++;
            store[s1.charAt(i)]--;
        }

        for (int n : store)
            if (n != 0)
                return false;

        return true;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, s0, s1):

        freq = {}
        freq2 = {}

        if len(s0) != len(s1):
            return False

        for ch in s0:
            if ch in freq:
                freq[ch] += 1
            else:
                freq[ch] = 1

        for ch in s1:
            if ch in freq2:
                freq2[ch] += 1
            else:
                freq2[ch] = 1

        for key in freq.keys():
            if key not in freq2 or freq[key] != freq2[key]:
                return False

        return True


View More Similar Problems

Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

View Solution →

Reverse a linked list

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio

View Solution →

Compare two linked lists

You’re given the pointer to the head nodes of two linked lists. Compare the data in the nodes of the linked lists to check if they are equal. If all data attributes are equal and the lists are the same length, return 1. Otherwise, return 0. Example: list1=1->2->3->Null list2=1->2->3->4->Null The two lists have equal data attributes for the first 3 nodes. list2 is longer, though, so the lis

View Solution →

Merge two sorted linked lists

This challenge is part of a tutorial track by MyCodeSchool Given pointers to the heads of two sorted linked lists, merge them into a single, sorted linked list. Either head pointer may be null meaning that the corresponding list is empty. Example headA refers to 1 -> 3 -> 7 -> NULL headB refers to 1 -> 2 -> NULL The new list is 1 -> 1 -> 2 -> 3 -> 7 -> NULL. Function Description C

View Solution →

Get Node Value

This challenge is part of a tutorial track by MyCodeSchool Given a pointer to the head of a linked list and a specific position, determine the data value at that position. Count backwards from the tail node. The tail is at postion 0, its parent is at 1 and so on. Example head refers to 3 -> 2 -> 1 -> 0 -> NULL positionFromTail = 2 Each of the data values matches its distance from the t

View Solution →

Delete duplicate-value nodes from a sorted linked list

This challenge is part of a tutorial track by MyCodeSchool You are given the pointer to the head node of a sorted linked list, where the data in the nodes is in ascending order. Delete nodes and return a sorted list with each distinct value in the original list. The given head pointer may be null indicating that the list is empty. Example head refers to the first node in the list 1 -> 2 -

View Solution →