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
Software Development Interview Questions
36,993 software development interview questions shared by candidates
Hasp map concepts theory questions coding question : Program to check if binary tree is a BST Complexity of the module written
Create a Queue using two Stacks.
Give you an array of integers without duplication. Let you write a piece of code to return the pairs that their sum is 100.
Given an array of integers and k, print all the pairs of numbers (a,b), both of them inside the array, such that a+b=k
Most efficient algorithm for sorting infinitely long array
Questions related to stacks, queues (Eg:Implement a queue using stacks) Trees were heavily asked as well (Print a tree spirally, check if one BT is a mirror of another BT)
Check given binary tree is BST or not
design the objects needed to run a jukebox.
In an array, all numbers appear even times, while on number appears odd times. Find that number
Viewing 771 - 780 interview questions