SDE - 1

What is a deadlock?

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 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.

Difference between a doubly linked list and a circular LL.
Vectors vs. an array.
Recursion vs. DP and its Application.
Time complexity and binary search implementation.
Directed graphs and undirected graphs differ from one another.
Queue vs. Stack.
I'll explain the code I used in the coding round and its time complexity

Describe yourself to me.
Why do you wish to move from the civil engineering field to software?
Describe the projects listed on your resume.
What are your knowledge and motivations towards Nagarro?
Do you currently hold a letter of offer?