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

0 Answers   Nirma,

---

hai am manasa i want group2 previos qu papers pls eny one healp me manasa_u2001@yahoo.com send me this e mail.

1 Answers  

---

What is getline(),getfile()

0 Answers  

---

sangati is novel by

1 Answers   Hyderabad Central University,

---

who is the founder of modern hockey?

0 Answers  

---

---

If” janata” is coded as 26 and” deposit “as 52 how can be the code number for “janatadepositscheme”

3 Answers  

---

CCl4 is inert to water but BCl3 hydrolises in moist air.Why?

0 Answers   Wipro,

---

i want become a IAS/IPS?first how to prepare exam&which books?what exam i have to write?

9 Answers   IAF, Satyam,

---

What is the largest phase of Meiosis -I?

1 Answers  

---

which of the following state of india largest producer of groundnut?

2 Answers  

---

If it took eight men ten hours to build a wall, how long would it take four men to build it?

3 Answers  

---

Who is The Magna Carta ?

1 Answers  

---