Write a program that reads N phrases and determines if one phrase is a permutation of the other. For example: Phrase 1 is: “One World One Dream” Phrase 2 is: “World One One Dream”. Then the output should say that phrase 1 is permutation of phrase 2. Note that spaces/tabs are not counted as characters. Sample Input: 3 One World One Dream World One One Dream No World No Dream Sample Output: Phrase 1 is permutation of Phrase 2
2248Post New Nirma ICET Interview Questions
in IBM PC -AT.WAT AT REFERS TO?
Define root?
Explain the uses of database trigger.
What are Broadcast Variables?
How do I handle python pathing not having a python 2.x in /usr/bin/python on a remote machine?
Where are t-code name and program values stored? Explain how can you find a list of all t-codes in the sap system?
What is the need to provide size option on create collection?
What will happen when windows 7 is no longer supported?
all interview questions with answers of ntpc (2000-2009
Why is spring boot preferred for microservices? : Spring Boot
What do xml namespaces actually contain?
What do you mean by parsing?
Give examples of some companies that are using Hadoop structure?
How we calculate the service time of buildings
What the identified advantages are of hibernate?