Write algorithm to compute the intersection of two arrays. What is the time complexity of this algorithm (using the big O notation)?
Software Developer Engineer Interview Questions
466,919 software developer engineer interview questions shared by candidates
Reversal of String Difference between GET and POST REST API
Implement a stack using a Queue
(1) two sums : given a list of numbers, return the indexes of two values whose sum is a given value. (2) Revers a string list
Which sorting algorithm would be good for sorting small-sized integer arrays and why? What is the performance? What about for large-sized integer arrays?
In Array find largest second number ?
I had a difficult question about a cuboid composed of smaller cubes. How many cubes are there where exactly two faces of the cube are exposed?
There are 199 elements in array. It has only one distinct value? How will find this distinct value? Also for solution please tell about O(n)?How can you make it more efficient?
Given a binary tree with only upwards (parent) node references, re-construct the tree adding in child references. You are given a list of leaf nodes (sorted in left to right order). Tricks include making sure to account for extremely unbalanced trees.
How would you count the number of words in a string consisting of uneven number of spaces between words( not dictionary words)? With and without library functions.
Viewing 1251 - 1260 interview questions