Given a number n, find if its prime or not. Your function should be recursive and it should not loop beyond n/2. Example: given n=13, your recursion should not go beyond 13/2 i.e. 6
Applications Software Engineer Interview Questions
6,684 applications software engineer interview questions shared by candidates
Problem solving
Questions were on based on every technical subject...
As a college grad design and architecture questions were my weak points during the interview
Basic Java Questions
difference between webservice and website what is basic usage of interfaces collections multithreading internals of webservice,https
Simple problem solving question where we have to apply our Object Oriented skills.
In second coding round they gave a very simple program and later we were asked to modify the code according to oops concept and then some random changes were asked to be made like making the coder more readable and expressive
The first coding round had a very easy array problem.
Find the longest palindrome in a continuous alphanumeric string
Viewing 5501 - 5510 interview questions