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
1778Post New Nirma ICET Interview Questions
- Nirma Data Structures Interview Questions (1)
- Nirma HR Questions Interview Questions (1)
- Nirma Analytical Chemistry Interview Questions (2)
- Nirma Mechanical Engineering Interview Questions (4)
- Nirma Electrical Engineering Interview Questions (1)
- Nirma Electronics Communications Interview Questions (1)
- Nirma Instrumentation Interview Questions (3)
- Nirma Business Administration Interview Questions (1)
- Nirma Taxation Interview Questions (1)
- Nirma Accounting AllOther Interview Questions (1) Nirma ICET Interview Questions (1)
How can default jvm be changed to others?
How to track your team members?
What is foreign key in hibernate?
Explain what is the benefit of using an enum rather than a #define constant?
Describe CDMA with one of advantage?
What's The Error Code For Unique Index Voilation?
Can a subdomain have a different wordpress theme?
What is mm module importance in sap r/3?
Where is zoom button?
They started with the brief introduction followed by few basic C++ questions on polumorphism, inheritance and then virtual functions. What is polymorphims? How you will access polymorphic functions in C? How virtual function mechanism works?
Should database connections be singleton?
Why are dynamic link library used over static one?
What is threading in c# with example?
How do you repair a hydraulic jack?
Difference between :first-child and :nth-of-child
