Problem of the day
Do prepare for previous interview experiences of company in which you are applying and also pay more focus to data structures related questions. Also prepare for aptitude as well, as many companies ask aptitude questions as part of interview process.
Mention things that you are confident of. Don’t try to write extra skills which you are not sure about as most of the questions are asked after seeing the skills mentioned in your resume.
There was only one round and it was MCQ + Coding round. Total of 18 MCQs were asked and 2 coding questions were asked.
MCQ’s (10 Aptitude, 5 English, 3 Data structures - 18 MCQ’s)
Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not necessarily contiguous.
This is a standard Dynamic programming question. I solved it using 2D DP by comparing current characters and filled DP using previous DP fields.
Two numbers A and B are said to be Co-Prime or mutually prime if the Greatest Common Divisor(GCD) of them is 1. You have been given two numbers A and B, find if they are Co-prime or not.
I simply calculated GCD of two numbers using the Euclid algorithm and just check the GCD whether it is one or not. If it is 1 then they are co-prime else not.