Tip 1 : Do atleast 3 major web dev project
Tip 2 : Practice from interview bit
Tip 1 : Keep it short, one or two page max.
Tip 2 : Attach competitive profiles url.
This online assessment comprised of 30 questions with 2 coding questions and 28 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.
The MCQs were difficult that required good understanding of Computer fundamentals.
It was a telephonic call that lasted for about half an hour.
str = "ababc"
The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome.
There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
The round was a video call and I was asked to share my screen to avoid any cheating cases.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?
Eclipse