Implement a stack that supports push, pop and mode(the one from statistics) operation. Gave an O(log n ) push and pop and O(1) mode operation.Another good question was implement atoi function. I assumed it as base 10 but was asked to support from binary to any base numbers(even base 50).
Give you an array of integers without duplication. Let you write a piece of code to return the pairs that their sum is 100.
The input to a function is an array of n elements.Output of that function is also an array where each element is product of all elements in the input array except the one with same index. Input ::::: 1 2 3 4 Output ::::: 2*3*4 1*3*4 1*2*4 1*2*3
Hasp map concepts theory questions coding question : Program to check if binary tree is a BST Complexity of the module written
Given a binary search tree and a number find the closest node to that number.
How would you reverse a doubly-linked list?
Write a function in java to calculate all the possible palindromes in a string.
how to find a number in a circularly sorted array?
If you get an array of integers, find the only integer that is repeated for an odd number of times.
Tell me about a time when you made a mistake and what you did to fix it.
Viewing 1251 - 1260 interview questions