Tip 1 : Be confident
Tip 2 : Be clear
Tip 3 : Good communication
Tip 1 : Clear and truth resume
Tip 2 : Full fill criteria
This round is a objective based and one programming question round



Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
I solved 2 questions fully and there is a wrong test case given for 3rd question, so they consider only 2 questions for evaluation. Out of 500 students, they selected 27, and they shortlisted 30 students for the 2nd online coding test



1.’Left’ and ‘Right’ both are inclusive in the range ‘Left’ to ‘Right’.
‘Left’ = ‘23’ and ‘Right’ = ‘37’

All prime numbers from ‘23’ to ‘37’ are 23, 29, 31, 37
23 is ‘megaprime’ number because ‘2’ and ‘3’ both are prime
29 is not ‘megaprime’ number because ‘9’ is not a prime
31 is not a ‘megaprime’ number because ‘1’ is not a prime number
37 is ‘megaprime’ number because ‘3’ and ‘7’ both are prime numbers
Hence there are two ‘megaprime’ numbers 23, 37 out of 23, 29, 31, 37.
I solved 2 questions fully and there is a wrong test case given for 3rd question, so they consider only 2 questions for evaluation. Out of 500 students, they selected 27, and they shortlisted 30 students for the 2nd online coding test
This round lasted for about 45mins. The first and very obvious question was to INTRODUCE YOURSELF! Then He gives me some instructions that don’t use any inbuilt function and explain before write.



1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.
Consider N = 5 and the list ‘binaryNums’= [“0”, “01”, “010”, “100”, “101”]. This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
Find the missing number from the sorted array consisting of number from 1 to N. (Simple One) I explained to him an iterative solution that we have to compare every value with the last value (Starting from index 1) if the difference is exact 1 then move further otherwise we got our missing number. He is not happy with the approach. He told me to give another solution. Then I explained the new solution that we have to find the sum of all the array elements and subtract it from the sum of 1 to N i.e N*(N+1)/2

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL clause is used to specify the conditions in a query?