Associate Software Engineer

You are given two strings 'str1' and 'str1'.

You have to tell whether these strings form an anagram pair or not.

The strings form an anagram pair if the letters of one string can be rearranged to form another string.

Pre-requisites:

Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams. 

Other examples include:

'triangle' and 'integral'
'listen' and 'silent'

Note:

Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct. 

Rob has gone to Mars to collect some stones. The bag he carries can hold a maximum weight of M. M stones are weighing from 1 to M on Mars. There are N stones on Mars that are similar to the ones on Earth. Find the number of stones he can bring from Mars such that none are similar to any stone on Earth.

Firstly, I was asked to introduce myself and then cross-questioned me on what I told in my introduction.

I was asked about whether or not I have ever held some position of responsibility and managed people.

Since my hometown is Agra, was asked whether tourism in Agra due to its heritage is draining out the resources in the city.