Software Engineer

Ninja has two strings ‘s’ and ‘t’ of same length, he knows that both strings are equivalent strings which means s[i], t[i] will follow all rules of any equivalence relation that are:

Reflexive : s[i] = t[i]

Symmetric: s[i] = t[i] => t[i] = s[i]

Transitive: if s[i] = t[i] and t[i] = s[j] then s[i] = s[j]

Ninja wants your help to find the lexicographically smallest equivalent string of a given string ‘str’.

Note:

1. String ‘s’, ‘t’ and ‘str’ consist of only lowercase English letters from ‘a’ – ‘z’.
2. String ‘s’ and ‘t’ are of same length.

For example:

Let s = “abc” , t = “xyz” and str = “xbc” then all strings that we can generate are “abc”, “abz”, “ayc”,”ayz”, “xbc”, “xbz”, “xyc”, “xyz” and smallest of all these is “abc”. 

You are given two big numbers ‘A’ and ‘B’ as strings. Your task is to find the product of both the numbers.

Note:

There are no leading zeros in both the strings, except the number 0 itself.
Do not use any built-in Big Integer Library.

For Example:

If, A = 123, and B = 456.
So the product of both numbers will be 56088.

• What is normalization?
• Explain types of normalization
• What are : Primary Key, Foreign Key, Candidate key, Super key
• How will you filter out the people who has the most workload from a given table employee?

The Man in the Elevator Puzzle

A man lives on the tenth floor of a building. Every day he takes the elevator to go down to the ground floor to go to work or to go shopping. When he returns he takes the elevator to the seventh floor and walks up the stairs to reach his apartment on the tenth floor. He hates walking so why does he do it?

You have been given an integer array/list 'ARR' of size 'N'. Write a solution to check if it could become non-decreasing by modifying at most 1 element.

We define an array as non-decreasing, if ARR[i] <= ARR[i + 1] holds for every i (0-based) such that (0 <= i <= N - 2).

• Tell me about yourself
• Have you done any certification courses? 
• Tell me about your family background? 
• What are your strengths and weakness?  
• How will you overcome your weakness?