Application engineer Interview Questions

Cross-site scripting (XSS) is a type of computer security vulnerability typically found in Web applications. XSS enables attackers to inject client-side script into Web pages viewed by other users. A cross-site scripting vulnerability may be used by attackers to bypass access controls such as the same origin policy. - SQL injection is a code injection technique, used to attack data-driven applications, in which malicious SQL statements are inserted into an entry field for execution (e.g. to dump the database contents to the attacker).

I struggled with this a bit and got close. I believe answer is: 23:55

This is a clear case of Geometric progression. Find the nth term Tn1 = a*r^(n-1). where n = (24 * 60)/5,a = 1 and r=2. when the initial value (a) = 2, the values become n = ?, a = 2 and r = 2. Since Tn1 = Tn2, Equate the RHS of both the equation. Since the base are equal, equate the powers, doing so will give the n value. When n is convert into minutes one get 23 hrs 55 minutes.

this is easy, you don't need all the math. The pond was half full five minutes before, so it's 23:55

33%

4/9

From a 3x3x3 Cube you can make 27 1x1x1 cubes, Since one face of the cube is painted blue. once face of 9 1x1 cubes will be blue. hence the answer is 9/27 = 1/3 = 33%

Hi, How long did it take for them to get back with results of the first round?

Hi, How long did it take for them to get back with results of the first round?

2 weeks, you can also check the status of your application online

10=2 100=4 1000=8… Caught the thing .. he didn't like my implementation. don't be nervous!

return (( x!=0) && (x & (x -1) == 0)) a number which is power of two will have single 1 in binary representation ex. 16 00010000 x-1 will have pattern 00001111 hence x&(x-1) will always be 0 for power of two numbers. Need to check condition for x!=0 since 0 is not a power of two. Special case to handle.

if you can figure this out inside an hour, congratulations this isnt something that should be in an interview to be honest the level of difficulty of the answer that algo came up with is at the level of an upper division course that has a proof of it written in wikipedia i honestly like the brute force solution

Hi can you please post the coding challenge questions here..

I am sorry. Only thing I could say is that the challenge was standard and had questions from Cracking the Coding book. Many questions were language based and some were proper algorithm questions.

Hey, what did you mention about your salary expectation that put them off. I have one coming up and was wondering.

public class FactorialSkip{ public static int dofacto(int n){ return n*facto(n-1,true); } public static int facto(int n,boolean skip){ if(n==1 || n==0){ return n; } if(skip){ return facto(n-1,false); } else{ return n*facto(n-1,false); } //Sort each word } public static void main(String args[]){ int factorial = dofacto(5); System.out.println(factorial); } }

Shouldn't it be as mention below ? if(skip){ return facto(n-1,false); } else{ return n*facto(n-1,true); }

#include #include class Solution { public: static long long SkipFact(long long n){ if (n > n; long long output = Solution::SkipFact(n); cout << "Factorial is :" << output << endl; return 0; }