- Q Each of the followed paired numbers have a relationship that's the same for all of the paired numbers. What is the missing number? {4, 100} {7, 111} {8, 1000} {1, 1} {12, 1100} {2, ?}
- Q What is the cost of cheapest electric car unveiled by Tata in Detroit?
- Q ……………………………. Factors relates to the touching distance between the participants.
- Q Get expressions for internal energy and entropy in terms of partition functions.
- Q The rivers of Narmada, Tapti, Mahi & Sabarmati drains into which gulf?
- Q Do you know anyone who works with Wegmans Food Markets?
- Q The place to receive annual rainfall below 50cm is-
- Q What is split-brain condition in red hat cluster?
- Q Can i use the show menu to remove revisions from a document in ms word?
- Q How do you get the best out of people?
- Q DANIYA time!!! Work time also for you lethargic bum. The gentle smile on your face is conspicuous by its absence. Finally DANDIYA day comes. Out of the small number of girls in IIT, an even smaller number has arrived. SENIORS being SENIORS, get priority and pairs are formed. You, poor sod, don't have a partner, and have to do the dirty work of arranging public in circles. The (lucky) boys have already formed the outer circle. The girls have formed the inner one. Your newly elected G.Sec (your wing mate, remember?) puts you to work. The girls being ladies, stay where they are. So you have to rotate the outer circle of boys so as to match them with the girls they have paired up with, or decide if it can't be done. To avoid choas, you would like to have the smallest number of movements.To add to your problems, some guys won't mind dancing with some girls apart from their partners. Input: Two strings of characters of equal length, each on a separate line. You have to find the least index of the character in the second line where the 0th character in the first string should go, so that the two strings match. The characters are numbered from 0 to (length - 1). In short: If a(0) a(1) ... a(n-1) b(0) b(1) ... b(n-1) are the two strings, then find the minimum 'k' so that a(i) = b(k + i (mod n)); for all i = 0, 1, 2,.. (n-1); NOTE: Output -1 if such a 'k' does not exist. Output: The index 'k' as specified above, just the number, on a single line. NOTE: Output -1 if such a 'k' does not exist. Sample Input: aabaa abaaa Sample Output: 4 (Since the 0th character of the first string, a, matches with the 4th character of the second string, so that if you take the 0th character to the 4th character the first string matches with the second.) Epilogue: After spending 4 years in IIT Bombay, Powai-400076, you permanently lose that gentle smile from your lips forever, but atleast learn the value and importance of hard work, so that you are no longer a lethargic bum.