Technical Interview Questions

Anonymous Muskox - "Things on which Site performance depends Page Speed: The time it takes to load the webpage. It comprises the metrics like Server response time [Amount of time when a web client makes a request and a server responds to the request], Transfer time [Time it takes to download a webpage], and render time [Duration of time it takes to render the HTML page in browser]. DNS lookup speed: Every website name is mapped with the corresponding IP Address. So the browser lookup up the IP for t"See full answer

Sudhansu T. - "There are few points which we need to understand while advising engineering team. Risk assessments. Cost Benefit Analysis Vendor relationship Vendor Lock in."See full answer

Exponent - "This is a Technical question. It tests your ability to understand high level technical concepts. Even though your job won't have any coding involved, you'll still need to understand these concepts. Being able to cover all these topics with clarity communicates confidence in your interviewer. Unfortunately, there's no formula for technical questions, but some general tips are: Use analogies when you can Break your solution into clear, bite-size steps Don't be afraid to use examples to b"See full answer

Luca D. - "Classes are represented in memory as areas where code and class shared objects are. The JVM use class loader to load classes and unload them if no more required at runtime as specified at https://docs.oracle.com/javase/specs/jls/se8/html/jls-12.html#jls-12.7, to name a very consolidated version of JVM. The interviewers supposed memory was freed without being subject to GC. I asked to discuss to clarify which hypothesis is right, the interviewers dismissed me. I'm very happy they didn't select m"See full answer

Sanobar K. - "public static Dictionary FindPairsWitkkDifference(int k, int[] nums) { Dictionary pairsWithkDifference = new Dictionary(); int n = nums.Length; if( n== 0 || n == 1) Return 0; for(int i =0; i< n;i++) { for(int j = i+1; j < n; j++) { if(Math.Abs(nums[i] - nums[j]) == k) { pairsWithkDifference(nums[i], nums[j]); } } } Return pairsWithkDifference ; }"See full answer

מיכל ש. - "משימת בית פרונט עם התחברות לשרת רמה היה ממש קל"See full answer