Solve This (? + ? + ?=30)

If 1111=R, 2222=T, 3333=E, 4444=N Then 5555=?

Guess the Hindi Muhawara from the following whatsapp Emoticons?

Sweet, Medicine, Film, Girl, City, Car, Place, Doggy all are name same, guess which word it is?

Guess me who am I, I am the first on earth, the second in heaven...

Four Question, One Answer: One River Name, One Flower Name, One Film Name, One Actress Name?

A girl is blind, deaf, dumb and uneducated too. A boy loves her. How would he propose without touching her?

Which Indian cricketer is known as "Brown Bradman"?

Which of the countries has had a prime minister whose name featured the name of his country?

Which of the gulf city was a dependency of Bombay Presidency under British rule for almost a century?

Given 2 strings s1, s2 and s1 is equal to s2 if they are lexicographically sorted, Find minimum number of swaps required to transform s1 to s2?

Swap Definition: Problem 1 : we can transform index i with i+1 where 0<=i< s1.length()-1 Problem 2 : we can transform index i with i+1 where 0<=i< s1.length()-1 and other operation we can swap first character of string with last

example: s1="abc", s2="cba" In problem1 3 swaps required abc ---> bac ---> bca ---> cba In problem2 1 swaps required abc ---> cba [swap first and last element]

For any given index, if the characters in both the strings are not equal. There is a mismatch. Since the mismatched character from first string will cause a mismatch in the second string at another position j. So the total number of mismatches will always be a multiple of 2.

One swap corrects position of 2 characters. So the optimal number of mismatches is half the total number of mismatches.

Convert the given string into palindrome with minimum number of appends(at end of the given string). O(n) algorithm will be appreciated ??

Input :=> Malayal Output :=> Malayalam

WAP to find the minimum number of swaps required for arranging pairs adjacent to each other?

Input: pairs[] = {1->3, 2->6, 4->5} // 1 is paired with 3, 2 with 6 ... arr[] = {3, 5, 6, 4, 1, 2}

Output: 2 {3, 1, 5, 4, 6, 2} by swapping 5 & 6, and 6 & 1

How to convert one string to another such that only one character is changed at a time and after each change the transformed string is in the dictionary. You need to do this in the minimum number of transformations. For example the transformation from rat-->boy can be done as follows:

rat-->bat-->bot-->boy (if dictionary has bat and bot)

Any suggestion on how to achieve this?

Given a string and dictionary of words, form a word by removing minimum number of characters. Characters can be removed in-order only.

Given an array of denominations and array Count , find minimum number of coins required to form sum S.

for example:

coins[]={1,2,3}; count[]={1,1,3};

i.e we have 1 coin of Rs 1 , 1 coin of Rs 2 , 3 coins of Rs 3.

Now if we input S = 6 then output should be 2 with possible combination : 3+3 = 6