Software Engineer Internship Interview Questions

When did you do your onsite interview if i may ask?

November 28, 2017

Thanks. Any tips for someone whose about to interview onsite?

If you know how to write a class, constructor, use a Hashmap, you'll be fine.

Hey, I also had a similar question on the phone interview. Can you please help out with your timeline of the interviews and the type of questions asked in the onsite interview? Thank you for this post!

Hi there, can you share your some hints about the type of questions asked in the onsite interview?

Need for information. For example, what is the relation between instruments, stock exchanges, and trades?

Do you have additional information? I was thinking there could be an overarching class called 'market', which has a vector of all trades, and a vector of all exchanges. Each function just modifies the arrays in some way(add, delete, etc.) and to get all trades between two times, we can just do a linear or binary search for the two times and return another vector of the trades. I am implementing all of this in C++. Is this the type of thing that is expected?

Are there any issues of concurrency or parallelization that arise in this scenario? It seems that's what they expect us to be challenged with, but I do not see any real issues here that can't be solved with just a few mutexes/

Setup two integer arrays with length of 52. Iterate through characters in T, count the occurrence of each character and store the frequencies in the array. Iterate the first T.length() letters of S and count the frequency in the other array. From there, increment the new character and decrement the last character until you reach the end of the string S. (Sliding window approach). Time complexity: O(N + M) where N = length of S and M = length of T

The answer above seems incomplete as it does not consider all the permutations of T, which are about n! (n being the length of T). In my opinion, what I would do is find the permutation of T then by length find their occurrences in S.

That would be very inefficient. As you mentioned you have n! Permutation by doing so your time complexity would be about n*n! The first answer is correct and complete. You don’t need to print out all of the permutation. You can just have a hash map with all characters of S and compare each strings in the sliding window. If a string has all characters of T in the hash S then you good.

K Closest Points to Origin: you can use a heap to keep the k closest points to origin!

Max Profit Buy Sell Stocks: What you can do is to go checking for the minimum value and then check if (price - min_val) is max every time!

Copy List with Random Pointers: You can use a hash map where you add all the nodes, but first save the head node, then go through the list again and connect the current node to it's next/random pointer that are going to be in the map (except if they are null), finally return map[head].

Apply a strategy similar to binary search where you pick the middle of the matrix and see if the element is larger or smaller. Based on that result, it narrows down how much you have to search to 3 out of 4 partitions (assuming each partition is 1/4 of the matrix). Implement this searching algorithm.

"Apply a strategy similar to binary search where you pick the middle of the matrix and see if the element is larger or smaller. Based on that result, it narrows down how much you have to search to 3 out of 4 partitions (assuming each partition is 1/4 of the matrix). Implement this searching algorithm." This is impossible, since you cannot pick the middle of the matrix again in 3/4 of matrix.

The search is recursively applied 3 times, once to each 1/4 partition of the original matrix (except for the one the element clearly cannot be in). Each 1/4 partition is a rectangular matrix representing a quadrant of the original matrix, and thus has a middle element.

Was this question your CodeVue interview, or the in-person interview?

"Given five numbers between 1-52 check whether you can generate 42 by using operations addition, multiplication and subtraction." This question was on Code Vue, I was given 30 minutes.

How did you go about solving this? Bruteforce?