count the 1s in an integer
Software Engineer Applications Interview Questions
665,793 software engineer applications interview questions shared by candidates
What is binary search tree? Whats the time complexity of inserting? deleting? seaching? What's the time complexity for the worse case?
Given the daily stock prices of a share during last 30 days, write a program to find out best buying and selling dates for maximum gain. The program should run with O(n) complexity.
given an array of integers(positive or negative), and two integers x, y. write a function that can find a subarray whose sum equals to x and product equals to y
Write a function that allows to convert a string to the corresponding number (i.e. implement the atoi() C function)
Probably the most difficult question they asked me was, he put a binary tree on the whiteboard and I had to write a function that would find if the tree was symmetrical or not. Anyone who's familiar with data structures and recursion should be fine with this, just don't freak out when they propose the question.
implement a stack with a method which can return the minimal value in the stack without remove this value.
Write an algorithm to return the intersect of two arrays.
You need to design a system to provide answers to factorials for between 1 and 100. You can cache 10 numbers. How would you arrange/manage that cache, and what is the worst case for lookup on a cache miss?
2 medium questions and 1 hard
Viewing 1201 - 1210 interview questions