LinkedIn 2019 -01
其实2017年也面了一次，翻开笔记发现自己啥都没准备，真是作死。到现在才补...希望这次能拿到offer
L家特点：些边界比较tricky的题，DP会考，union find会考, trie不确定，string manipulation，树和LinkedList。也挺偏重数据结构design。听说onsite会有3轮sys design，真的很系统的公司。
Culture : https://blog.linkedin.com/2015/03/11/linkedins-culture-of-transformation
Transformation：culture of transform
Yourself, Leave LinkedIn a better professional than when you started
Company, Enable LinkedIn to realize its full potential
World, Create economic opportunity for every member of the global workforce
Integrity : We don't believe the ends justify the means, We expect employees to do the right thing.
Collaboration : We believe great ideas and inspirations come from everyone.
Humor : Don't wait for other people to make you laugh
Result : We set clear, actionable goals and have high expectations for our performance. If you can't mesure it you can't fix it.
Value :
Our member come first; relationships matter; be open honest and constructive; Demand excellence; take intelligent risks(learn from misstakes and move on); act like an owner
Some suggestions :
Edge case show understanding what can go wrong. is something interviewers look for since it show that the candidate is able to adapt to real world situations.
Even if the answer seems obvious, walking through a solution and verifying the assumptions being made before coding indicates experience in problem solving
Type of queston :
Binary Searches; Graph Algorithms; Backtracking algorithms; Recursive algorithms; Dynamic programming algorithms (rare)
Data structure :
HashMaps; HashSets; Binary Trees; Lists; Stacks; Custom Data Structures
Use whole Name : eg. TreeNode not TNode; if the hack would not pass code review, won't pass LinkedIn's interview. Clean Code
Candidates should discuss the following topics at the minimum:
The general idea behind the solution
The next step. What is it? Are there optimizations? Trade-offs?
Any potential blocks. What is blocking progress on the problem? If there’s no progress for 20 to 30 seconds, a candidate should explain what is causing the block.
Why certain code is being refactored if the candidate is changing things in their algorithm/code.
Manners of testing.
What we actually want to see is how the candidate thinks about and breaks down the problem, and then from there how well they can translate their ideas into an actual working solution.
272 Closest Binary Search Tree Value II
170 Two Sum III - Data structure design
366 Find Leaves of Binary Tree
150 Evaluate REverse Polish Notation
698 Partition to K Equal Sum subsets
730 Count Different Palindromic Subsequences
636 Exclusive Time of Functions
380 Insert Delete GetRandom O 1
297 Serialize and Deserialize Binary Tree
671 Second Minimum Node in a Binary Tree
341 Flatten Nested List Iterator
102 Binary Tree Level Order Tranversal
236 Lowest Common Ancestor of a Binary Tree
323 Number of Connected Components in an Undirected graph
744 Find Smallest Letter Greater Than Target
879 Profitable Schemes
33 Search in Rotated Sorted Array
104 Maximum Depth of Binary Tree
373 Find K Pairs with Smallest Sums
381 Insert Delete GetRandom O 1 - Duplicates allowed
34 Find First and Last Position of Element in Sorted Array
451 Sort Characters by Frequency
160 Intersection of Two Linked Lists
245 Shortest Word Distance III
706 Design HashMap
655 Print Binary Tree
349 Intersection of Tow Arrays
449 Serialize and Deserialize BST
311 Sparse Matrix Multiplication
103 Binary Tree Zigzag Level Order Traversal
528 Random Pick with Weight
428 Serialize and Deserialze N-ary Tree
468 Validate IP Address
796 Rotate String
173 Binary Search Tree Iterator
658 Find K Closest Elements
81 Search in Rotated Sorted Array II
98 Validate Binary Search Tree
153 Find Minimum in Rotated Sorted Array
138 Copy List With Random Pointer
Last updated