1) Update the existing map without creating another map. 2) Write code to show the deadlock. 3) Find the maximum number from the given array. 4) Write the signature of service returning all the records from the provided table. 5) Explain about the Json format.
Multiply 2 long numbers without using multiplication.
The most difficult questions are about some particular algorithms or mathematical problems that interviewer is very familiar with but the candidate has never heard of. Not only it may create a stressful situation (candidate thinks that it is something he/she is supposed to know), it is not how the people solve new problems in IT. Many people may not be able to fully understand a particular mathematical (e.g. theoretical) theorem in a matter of 10-15 minutes and without good understanding of that particular theorem it may be hard to apply it to the real-life problem presented by the interviewer. For example, the question about finding the majority number in a large input sequence.
The question was basically inorder traversal- how would I write out the nodes of a binary tree from left to right
solve a live coding challenge in one hour using C# and visual studio. Free to use google.
How does ping work?
How would you troubleshoot slow loading web pages and poorly performing stored procedures?
Coding round : If A,B,C are 3 non-zero digits(1-9), find all combinations of A,B,C such that AB * AB = CAB.
Online Test : 1. count how many 1 bits are set after multiplication of 2 numbers 2. Implement CD (Unix command) functionality Technical Round 1 :: 1. formal introduction 2. Role in Current Project 3. Which UI framework/technology is better 4. Write a Decompressing Program to convert the string Ex :: i/p -> 3[b2[ca]] o/p -> bcacabcacabcaca
Can you explain the 5 basic principals for object oriented programming?
Viewing 291 - 300 interview questions