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?
difference between malloc and calloc OOPS concepts
What do you know about Akamai?
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
LC Medium
Implement an AddressBook (lookup, add, delete)
2 hours 2 questions. 1: array with strings of airports find fastest way to destination. 2: 2d array of maze (strings) find fastest path.
Explain the difference between DML and DDL.
Viewing 81 - 90 interview questions