Tip 1 : Regular practice
Tip 2 : Good command over DSA
Tip 3 : Good communication skills are also important
Tip 1 : Should be short and descriptive
Tip 2 : Team projects are helpful
This online assessment comprised of 12 questions with 2 coding questions and 10 MCQs.
Coding Questions:
It was one of the most common Dynamic Programming problems: Longest decreasing sub-sequence.
It was an easy question that needed us to find out the mean, median and mode in an array.



There can be more than one subsequences with the longest length.
For the given array [5, 0, 3, 2, 9], the longest decreasing subsequence is of length 3, i.e. [5, 3, 2]
Try to solve the problem in O(N log N) time complexity.


A palindrome is a word, number, phrase, or another sequence of characters that reads the same backward as forward, such as “madam” or “racecar”.
Given an ‘STR’: ‘aaaaaaa’ The minimum characters that will be replaced are 4. The string can be converted into ‘abcabca’.
Here are multiple possible answers, for example changing all the elements, but we have to find the minimum replacements possible.
There was only one interviewer, I was asked one coding question followed by one puzzle.



There are 3 mislabeled jars, with apple and oranges in the first and second jar respectively. The third jar contains a mixture of apples and oranges. You can pick as many fruits as required to precisely label each jar. Determine the minimum number of fruits to be picked up in the process of labeling the jars.

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