Linkedin Technical Interview – 77 Questions | Yaozong's Blog
1. Iterating through a k-dimensional array given size of each dimension in an array.2. Binary Tree Upside down (Leetcode 156)
3. Count the number of occurrences of an element in a sorted array (Binary Search)
4. Determine if a string is a number (handle signed / unsigned, floating point, any number of digits) (Leetcode 65 without considering exp)
5. Isomorphic strings (Leetcode 205)
6. Two-sums (Leetcode 1, 167, 170)
7. Parenthesis matching (Leetcode 20)
8. Search a sorted array for the first element larger than k. (Binary search)
9. Create a stack with the usual push(), pop(), but with an additional function getMiddle() that returns the middle element of the stack in constant time. (Vector-implementation) (See also Leetcode 155)
10. Implement pow(a,b) (Leetcode 50)
11. Shortest word distance (Leetcode 243, 244, 245)
12. Given a nested list of integers, returns the sum of all integers in the list weighted by their depth For example, given the list {{1,1},2,{1,1}} the function should return 10 (four 1's at depth 2, one 2 at depth 1), Given the list {1,{4,{6}}} the function should return 27 (one 1 at depth 1, one 4 at depth 2, and one 6 at depth 3). (See myblog)
Read full article from Linkedin Technical Interview – 77 Questions | Yaozong's Blog
No comments:
Post a Comment