Question
There are two words, "PLAYGROUND" and "DETERMINATION".
In the word "PLAYGROUND", the letters that come towards the left of 'R' are changed into their immediate succeeding letter. The letters that come towards the right of 'G' are changed into their immediate preceding letter. In the word "HANDCRAFTS", the letters that come before 'M' in the alphabetical series are changed into their immediate succeeding letter. The remaining letters are changed into their immediate preceding letter. Then, all the repeated letters are deleted. After that, the remaining letters are arranged in alphabetical order from the left end. Which letter will come fourth from the right end?Solution
In PLAYGROUND, P        L         A        Y        G        R        O        U        N        D Q        M        B        Z         H        Q        N        T         M        C In HANDCRAFTS, H        A        N        D        C        R        A        F         T         S I          B        M        E        D        Q        B        G        S        R Now in both the words all the repeated vowels are deleted. Z         H        N        T         C        I          E        D        G        S        R Now, the remaining letters are arranged in alphabetical order from the left end. C        D        E        G        H        I          N        R        S        T         Z ‘R’ is fourth from the right end.
Which of the following represents the Preorder Traversal of the binary tree given below?
       A       / \      B   C   ...A data analysis script receives data in JSON format. Which of the following is a valid JSON data type for a value?
A queue follows which principle for data access?
What is the space complexity of storing an adjacency matrix for a graph with V vertices and E edges?
Given the following code snippet, which operation is performed on the binary tree to produce the output: 4, 2, 5, 1, 3 ?
class Node {Â Â Â Â Â in...Which of the following statements best describes polymorphism in object-oriented programming?
Given a singly linked list with 'n' nodes, what is the time complexity to delete the last node?
In the context of asymmetric encryption, which of the following is a key feature of public-private key pairs?
Which algorithm is used for shortest path in graphs?
In a data warehouse, which of the following best describes the concept of "data granularity"?