How to rotate an array by a particular amount, require best time and space complexity.
Development Engineer Interview Questions
37,123 development engineer interview questions shared by candidates
Find Common elements from two same sized Integer Arrays(Unsorted) in O(n) without sorting either of them.
Standard OOPS concepts like diff between interface and abstract class.
Complexity of this algorithm. How to improve the complexity?
Finding a path in a maze which is represented by a grid of characters.
In a collection of strings, output the string that occurs most often.
There was no unexpected or difficult Question. 1. Find the first non repetitive character in a character stream. 2. Check for prime number and Elevator system design. 3. Agent bidding system design 4. Find for subtree within a larger tree.
Write a function to remove all redundant characters in a given string.
Divide without the / operator.
Remove duplicates from a linked list. O(n) time.
Viewing 381 - 390 interview questions