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. 

You have been given an integer 'N'.

Your task is to return true if it is a power of two. Otherwise, return false.

An integer 'N' is a power of two, if it can be expressed as 2 ^ 'K' where 'K' is an integer.

For example:

'N' = 4,
4 can be represented as 2^2. So, 4 is the power of two, and hence true is our answer.