Phone: 1. Find the first occurrence of a character that appears in the string more than once. 2. Shortest unique prefix
Graduate Software Engineer Interview Questions
3,320 graduate software engineer interview questions shared by candidates
You can train and even take the pre-screen for free, I believe. You can retry it every two weeks, I recommend doing that and maybe you will get lucky and get more easy questions and a decent score. If you are applying to this position, they will request that you do the Pre-screen, but if you have already done it, you do not have to do it again.
Array and String manipulations.
Some medium algorithm questions
Implement an interface.
Write a java program to encode data in a specific way - NDA
Print a MxN matrix in spiral.
- Find indices of elements for 2-sum, 3-sum, and 4-sum all in optimal time. 2-sum is easy, but 3-sum and 4-sum should be O(n^2) which is tricky because you need to find indices, not just the elements and there can be duplicate elements. Still don't understand solution to this day - Connect next pointers of all leaf nodes in binary tree. Tricky part is you must do it without extra space so you can't create a queue. I solved using a queue at first and thought solving without extra space was just a followup but I got rejected so seems like you have to do optimal space or else you'll get no hire.
Compute the longest group of characters in a given string. (e.g. Given "aabbbaabaa", the output should be b3, as "bbb" is the longest substring consisting of the same character in the string.)
Why bloomberg, why SWE, what projects I have worked on that are relative to the job, technologies I have used?
Viewing 1291 - 1300 interview questions