Pinterest + Meta L4 offers - My journey and advice
Question Details
https://preview.redd.it/n6ikojlayyic1.png?width=631&format=png&auto=webp&s=0cf58b934fead696da12b27f76980a84b060cbd4 For algorithms portion, I completed some parts of blind 75
Full Details
https://preview.redd.it/n6ikojlayyic1.png?width=631&format=png&auto=webp&s=0cf58b934fead696da12b27f76980a84b060cbd4 For algorithms portion, I completed some parts of blind 75 + Grokking the Coding Interview + company problem lists on leetcode. Here is a list of resources that I thought helped a ton. I was unemployed so most of the grind was done in a 3-ish week span studying 10 hours a day. 1. The best resource for me was Grokking the Coding Interview. It is very useful for learning pattern recognition for Sliding Window, 2 pointer, merge intervals, graph/tree traversal, heaps, topsort, combinations and permutations. 2. Pairing up with a buddy. Find another like minded leetcoder and discuss problems and answers together. This helps you efficiently study and understand problems deeper 3. Blind 75 has good commonly asked mediums that I've seen before in interviews. 4. Doing the Pinterest company problem list on leetcode was painfully tough but rewarding. Really good for understanding backtracking, juiced up graph traversals, heaps. 5. If I couldn't get a problem within 15-30 minutes, I looked at the solution. Marked the problem, and then came back to it again after a day to see if I can complete it without help. 6. Not super useful, but interesting for really understanding how binary search works and how to binary search the solution space for very interesting problems <a href="https://leetcode.com/problems/find-k-th-smallest-pair-distance/solutions/769705/python-clear-explanation-powerful-ultimate-binary-search-template-solved-many-problems/;
About This Question
This is a reported interview question from a pinterest interview for a data eng role (mid level) during the oa round reported in 2024.
It covers the following topics: Graph, Sql, Binary Tree, Sliding Window, Binary Search, Dynamic Programming, Backtracking, Heap, Behavioral, Recursion, Two Pointers .