Tip 1 : Practice Data Structure questions as much as you can. Also, be confident during the interview about your solution. For practice, you can prefer internet.
Tip 2 : Read About Previously asked questions by the company.
Tip 1 : Keep it short. Mention the academic and professional projects you've done. Add your educational details properly with the percentage or CGPA obtained.
Tip 2 : Only write those things in the resume which you are confident of and keep practicing.
This round was taken by a senior engineer working there. he asked a lot of questions about my work and projects in my resume. He asked 2 coding questions.



A mapping from Digits to Letters (just like in Nokia 1100) is shown below. Note that 1 does not map to any letter.

Used backtracking to generate all possible combinations.



1. Both STR and PTR consist of English uppercase letters.
2. Length of string 'STR' will always be greater than or equal to the length of string ‘PTR’.
3. In case, there is no anagram substring, then return an empty sequence.
4. In case of more than one anagrams, return the indices in increasing order.
Maintain a window of len(p) in s, and slide to right until finish. Time complexity is O(len(s)).
This round was held in the evening and was taken by an engineering lead. He asked a lot of Conceptual questions on Java. and 2 coding questions.



1. ‘.’ matches to any single character.
2. ‘*’ matches to zero or more of the preceding element.
1. You have to match the entire string with the pattern given.
2. Both the strings, 'S' and 'P' contain only lower-case alphabets.
3. Only the pattern will contain additional characters ‘*’ and ‘.’ along with alphabets.
Search from left to right and maintain a max height of left and right separately, which is like a one-side wall of partial container. Fix the higher one and flow water from the lower part. For example, if current height of left is lower, we fill water in the left bin. Until left meets right, we filled the whole container.



Let the given string be “(()())((”.
Here the valid parentheses substrings are: “()”, “()” and “(()())”. Out of these the longest valid string is “(()())” which has a length 6.
Scan the string from beginning to end.
If current character is '(',
push its index to the stack. If current character is ')' and the
character at the index of the top of stack is '(', we just find a
matching pair so pop from the stack. Otherwise, we push the index of
')' to the stack.
After the scan is done, the stack will only
contain the indices of characters which cannot be matched. Then
let's use the opposite side - substring between adjacent indices
should be valid parentheses.
If the stack is empty, the whole input
string is valid. Otherwise, we can scan the stack to get longest
valid substring as described in step 3.
This round was primariily to discuss about Work, location, compensation and some basic questions.
Formal Introduction about myself.
What do you know about Blue yonder?
Why do you want to work here?
Weakness and strengths?
Are you able to relocate to Noida?
Tip 1 : Practice Hr questions
Tip 2 : Be confident.
Tip 3 : Ask all your doubts about the company and compensation.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?