Software Developer

You are provided with the two strings named X and Y respectively. Y has its own specific order and has no repeating characters. Your task is to arrange the characters of the first string i.e. X in such a way that the order of characters in X is exactly the same as in Y, which means if ‘d’ occurs after ‘c’ in Y then it should also occur after ‘c’ in X ( obviously if X has ‘d’ and ‘c’ as characters in it ). All you have to do is, convert string X in the specific order with respect to string Y.

Note :

Both the strings have only lowercase English alphabets. 
There may be more than one correct solution, you have to return any one of the possible solutions.

You have been given a string ‘S’.

You must return the string ‘S’ sorted in decreasing order based on the frequency of characters.

If there are multiple answers, return any of them.

Example :

Let 'S'= “abAb”. 

Here the characters ‘a’ and ‘A’ have frequency 1 and character ‘b’ has frequency ‘2’.  

Therefore the sorted string is “bbAa”. 

What is polymorphism? Explain different types of polymorphism? (Learn)

What is the difference between method overloading and method overriding? (Learn)

What are different access specifiers? What is the use of which specifier? (Learn)

What are pointers? What is the use of this pointer in Java? Write a code to explain this pointer? (Learn)

What are types of constructor in Java? Write a code to explain all types of constructors? (Learn)

Which type of inheritance is not supported in Java and why? (Learn)

What are TCL commands in SQL? (Learn)

Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.

Example :

Merge Sort Algorithm -

Merge sort is a Divide and Conquer based Algorithm. It divides the input array into two-parts, until the size of the input array is not ‘1’. In the return part, it will merge two sorted arrays a return a whole merged sorted array.

The above illustrates shows how merge sort works.

Note :

It is compulsory to use the ‘Merge Sort’ algorithm.

Given a 2-dimensional matrix of size ‘N’ x ‘M’, rotate the elements of the matrix clockwise.

For example: 
Input Matrix: [ [ 1, 2, 3 ] 
                [ 4, 5, 6 ] 
                [ 7, 8, 9 ] ]

Output Matrix: [ [ 4, 1, 2 ] 
                 [ 7, 5, 3 ] 
                 [ 8, 9, 6 ] ]

The output matrix is generated by rotating the elements of the input matrix in a clockwise direction. Note that every element is rotated only once. 

Note :

You do not need to print anything; it has already been taken care of. Also, update the given matrix in-place.

Is it possible to call the base class method without creating an instance? If yes, then how? (Learn)

Differentiate between data abstraction and encapsulation in operating system. (Learn)

Why is String class considered immutable and StringBuffer considered mutable? (Learn)

What is the use of throw keyword in Java? (Learn)

What is VIEW in SQL? Write a query to create a view from a table? (Learn)

What is RAID in SQL? (Learn)