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
Write a function in java to calculate all the possible palindromes in a string.
If you get an array of integers, find the only integer that is repeated for an odd number of times.
Generate all possible parenthesis for a given n
How to tell if a number is even or odd without using if else conditions
How have your experiences prepared you for this role?
Which is faster in c++: post-increment or pre-increment?
Viewing 111 - 120 interview questions