1st Round: Consider an array of 5 elements. You must create a new array such that at a given position 'i', the number should be product of all elements of original array except the 'i'th element. You have to solve this in least number of iterations possible.
Q: Find the sum of the largest and second largest number in a array
Name some of the primitive datatypes used in C#.
Given numbers 1 to 100 in an array a random number was replaced with 0. Find the which number it was in constant time (100).
They asked about my skills and knowledge.
In JS in an AND condition if the first part is false, would the second get evaluated?
What are your capabilities
What are some concepts of OOP?
print number 1 to 100 without any loop
What is a sandbox?
Viewing 31 - 40 interview questions