Data Analyst

Mostly questions were of OOPs, Cloud computing, SQL and basics on computer science

Number Of MCQs - 20

You have been given a string ‘ST’ of length ‘N’ and ‘X’ words all containing lowercase alphabets. You call a word matching from ‘ST’ if by removing some characters of ‘ST’ you can form that word.

Your task is to return the largest matching word among these ‘X’ words. If there are multiple strings of largest length return lexicographically smallest string. If no word matches from ‘ST’ return ‘#’ as the string.

Example:

Let’s say you have “abcd” as string ‘ST’ and 2 words “bd” and “db”. “bd” matches with the string ‘ST’ as you can remove ‘a’ and ‘c’ character to form “bd”. “db” does not match with the string ‘ST’ because it is impossible to form “db” from the string ‘ST’ by removing characters.

Note:

You cannot change the order of characters in ‘ST’ after removing some characters. 

Explain your project.

Why do you want to join this company?

Are you ok with the location?