Write an algorithm to return the intersect of two arrays.
Software Developer Engineer Interview Questions
466,919 software developer engineer 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?
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?
During the phone interview, the coding question was done on a google doc and asked: In Java, given a String of [a-z] characters, find and return the first character that appears only once. I implemented it using a counting array and in the end the manager asked if I could implement it in another way, which I mentioned I could do it using a HashMap.
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.
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
It was positive experience. People were nice. Like craft demo which help to have discussion with team instead of traditional interview structure.
Viewing 1031 - 1040 interview questions