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
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]
"Given an array of strings, find the string which is made up of maximum number of other strings contained in the same array. e.g. “rat”, ”cat”, “abc”, “xyz”, “abcxyz”, “ratcatabc”, “xyzcatratabc” Answer: “xyzcatratabc”
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
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
