Software Engineer

You have been given two strings, 'str1' and 'str2'.

Your task is to return true if the given two strings are isomorphic to each other, else return false.

Note :

Two strings are isomorphic if a one-to-one mapping is possible for every character of the first string ‘str1’ to every character of the second string ‘str2’ while preserving the order of the characters.

All occurrences of every character in the first string ‘str1’ should map to the same character in the second string, ‘str2’.

For example :

If str1 = “aab” and str2 = “xxy” then the output will be 1. ‘a’ maps to ‘x’ and ‘b’ maps to ‘y’.

If str1 = “aab” and str2 = “xyz” then the output will be 0. There are two different characters in 'str1', while there are three different characters in 'str2'. So there won't be one to one mapping between 'str1' and 'str2'.

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:

[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.

The questions were conceptual questions from DBMS, SQL, CPP, OOPS, OS like 

What is semaphores?

What is complexity?

Types of joins and explanation. 

Some query questions like use of which and like in SQL. 

Polymorphism, types of memory, networking, types of model and explanation.

Why do you want to join us?

What are your strengths and weaknesses?

What are your hobbies?