Given an array of n element which contains elements from 0 to n-1, with any of these numbers appearing any number of times. Return via Boolean, whether a duplicate exists in the list. 2nd Level/Bonus: do this in O(1) space complexity. 3rd level: Is there a better solution if you are allowed to modify the existing data array?
Internship Interview Questions
104,772 internship interview questions shared by candidates
difference between malloc and calloc OOPS concepts
What do you know about Akamai?
Why do you think this job is right for you?
Should the client and server use the same data language for communication? (e.g. XML, JSON)
What is the angle between hour hand and minute hand at 3.15?
Describe the 3 OOP concepts
1.converging maze nearest meeting cell 2.converging maze maximumweight node 3. converging maze largest sum cycle program
What is your favorite DreamWorks movie?
Are you good at the code?
Viewing 221 - 230 interview questions