I went through two technical interviews.

In the first interview, I was asked to introduce myself first. Then, I was asked about a point in one of my projects mentioned in my resume. Next, I was asked a DSA question related to string manipulation. Finally, I got the chance to ask the interviewer a few questions, and he gladly answered them. The interviewer was really polite and cooperative, helping me along the way whenever I needed any.

Question difficulty - Easy

In the second interview, I was asked two DSA questions, one related to arrays and the other related to trees.

Question difficulty - Medium, Easy

1. Given two strings, find if the second string can be formed using the first string by applying at most one conversion at a time. In a conversion, you have to convert all occurrences of one Latin alphabet to another.

2a. Given a binary array (an array consisting of only '1's and '0's) of length n, find the minimum number of operations necessary to collect all the '1's at the ith position. In one operation, you can shift only one '1' to an adjacent position. Return the minimum number of operations required for every index from 1 to n.

2b. Given a binary tree, flatten the binary tree into one dimension in such a way that the order in which one can access the elements is the same as a preorder traversal and only the left child nodes can contain values; the right child has to point to NULL.