Using the above image, one would can Ninja-encode a phrase by replacing each letter by the corresponding phrase.
For example, my name (Lokesh) came out to be 'ta~mo~me~ku~ari~ri'. Notice, I have placed '~' among the sub-words to make the reverse translation easier. I will follow the same notation while converting any other word to Ninja name.
Now, write a program that converts any name in English to Ninja name. Solve this puzzle and enter the answer below
1 2 3 4 5 6 7 8 9 10 |
|
Given an array and an element , the floor of an element is defined as the greatest element present in the array which is less than or equal to .
What is the worst case complexity of the most efficient algorithm for finding a floor of an element in a sorted array?
Details and Assumptions:
If the array is and , then the output will be .
can't be less than the minimum element in the list.
Given a singly linked list of size what is the time complexity of finding the 10th element form the front and the 10th element from the end respectively?