Implement x^y function in an imaginary proccessor who doesnt have +, /, * operators.
Software Engineers Interview Questions
419,495 software engineers interview questions shared by candidates
Expectation for coding Questions: Must be sort of analytical questions testing knowledge of DS/Algos and problem-solving skills, that could be done in 65-70 minutes. Reality: Problem Solving tricky questions, I would say they are not really checking candidate's Data Structures knowledge. Standard DS/Algos can be used to come up with the sol, but again coming up with the optimised sol. is the challenging part, I feel. I though it could only be done in the given time frame with most optimised approach, only if candidate had gone through that kind of question in the past. Brute Force or Semi-optimised approach can be thought of, but coming up with most optimised approach in the given time frame, needs some serious practice and some luck too😅. According to me, either questions' difficulty level should be reduced or time can be increased.
There are 25 horses. You get to race them 5 at a time, determining relative ranking. How many races does it take to figure out the top 3?
Write a program to test endianess of storage.
can we find the end of circular linked list?
write an algorithm to determine is "happy" ... a number is happy if the sum of the square of the digits ever equals one. An example of a happy number is 19: 1^2 + 9^2 = 82 8^2 + 2^2 = 68 6^2 + 8^2 = 100 1^2 + 0^2 + 0^2 = 1 If it is not happy then it will eventually hit repeat back to a number that it already saw
Take an input string and output the reverse of that string. May use any programming language.
sum of k smallest number
Write a function to divide a number by two without using the division operator
Is JVM a process based system or a thread based system
Viewing 1811 - 1820 interview questions