Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- 1. How would your direct reports react if you were to leave your current position?
- 2. find the shortest path from root to leaf
- 3. Unrolled linked list
- 4. Find all entire words before a given index in a string.
- 5. How to find an intersection of two integer arrays?
- 6. Find shortest path on a weighted N-ary Tree.
- 7. Make a system that returns the average number of hits on the site per minute from the past 5 minutes
- 8. Merge two sorted list
- 9. str_str
- 10. longest subarray whose sum is less than K
- 11. Merge K sorted stream
- 12. Do you have performance based evaluation and how frequently?
- 13. Can you give an example of a negative evaluation and how you dealt with improving the case?
- 14. Programming question was to implement a system that accepts number of crawled sites and reports how many sites were crawled in the past 5 min
- I implemented two solutions in Java. First was a hash table based that would have time as key and number of crawled sites as a value. The complexity was O(N), where N is the number of entries in the hash table. I have improved the solution by trimming the hash table to contain only 5 minutes of data and have split the buckets into two: each 2,5 min long. This improved the solution to constant.
- 15. Shunting Yard Algorithm
- 16. Expiring map
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement