SDE - 1

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. 

Design a system for shortening URL application.

Design a database for Warehouses for the Delhivery team .

There is a network failure in a distributed database . Discuss the scenario in all three possible cases using CAP theorem.

You have been given a Binary Tree of integers. You are supposed to return the reverse of the level order traversal.

For example:

For the given binary tree

The reverse level order traversal will be {7,6,5,4,3,2,1}.

Design a database for an organisation such that it has employees, every employee can have a role. One role can have many permissions for example Rola – Manager can code, can manage, can recruit . Role – Coder can code but not manage, Role – HR can manage and recruit. All tables should be in BCNF