Name: What Big Tech Data Structures And Algorithms Interviews Generally Look Like
Uploaded: 2022-04-19T00:32:07+00:00
Duration: 51 s
Description: FAANG interviews are some of the most well-defined in the industry

What Big Tech Data Structures And Algorithms Interviews Generally Look Like

FAANG interviews are some of the most well-defined in the industry. However, this style of software engineer interview is often completely failed due to a lack of preparation. Here's what to expect when it comes to data structures and algorithms interviews for Big Tech.

Here are the core points from the video:
- **Phone screens are Leetcode easy and medium** - This will either be 2 easy problems or 1 medium problem. This means that if you haven't progressed to onsite rounds yet, don't spend much time on Leetcode hard problems: That's a premature optimization. Make sure you have your easy and medium problem mastery down, so you can even make it to that final round.
- **Onsites are Leetcode medium and hard** - This will either by 2 medium problems or 1 hard problem. If you receive a problem that's more on the medium side, make sure to budget your time well. There's a good chance the interviewer wants you to solve another problem on top of that.

Related resources:
- [[Masterclass] How To Ace Your Big Tech Interview - Data Structures & Algorithms](https://www.jointaro.com/lesson/V4sTACzfOh22nMVcUV3w/how-to-ace-your-big-tech-interview-data-structures-and-algorithms-7172021/) - This is the full video this clip is taken from
- [[Masterclass] How To Ace Your Big Tech Interview - System Design](https://www.jointaro.com/lesson/J3I9fTW9ulr6T9KjxpqY/how-to-ace-your-big-tech-interview-system-design-1162021/)

FAANG interviews are some of the most well-defined in the industry

[Masterclass] How To Ace Your Big Tech Interview - Data Structures And Algorithms

Data structures and algorithms (often abbreviated as "DSA") is an infamous staple of the software engineer interview experience. Data structures and algorithms problems are the most well-known for being part of the FAANG interview process, especially for Google.

Here are our Top 5 favorite points from this masterclass (in no particular order):

- **DSA prep is insanely high ROI** - In fact, the return on investment for time spent on DSA studying makes it one of the highest yield activities any human can do period. If you haven't worked at FAANG / Big Tech before, switching into it is likely to increase your pay by 50%+. If you're in the US, this will often mean a raise of $50k+. So the next time you're feeling burnt out from DSA studying, keep this very bright light at the end of the tunnel in mind.
- **Leetcode and Glassdoor are all you need** - DSA studying is a solved problem. You can use other, newer tools if you want, but the old-school ones still work just fine. Glassdoor in particular is naturally very effective given the "Big" nature of "Big Tech". Go through the recent data points from Glassdoor if you're interviewing for Big Tech and make sure you have a good grip on recurring recent problems.
- **Learning DSA is all about pattern recognition** - For 80%+ of DSA problems, there will be some 1-2 liner "trick" that represents the whole solution. For example, the "trick" to 2 sum is "Look for the difference and use a set/dictionary". It is not scalable to memorize solutions as code - Look for patterns and remember solutions as that high-level insight.
- **Communicate, communicate, communicate** - Since FAANG companies are so huge, there are naturally going to be far more stakeholders on every project, making alignment far more important. Because of this, Big Tech companies will often closely judge your communication skills during the interview. Don't just code in silence - Even if you get the right answer, you may still fail for not maintaining a dialogue with your interviewer.
- **Don't forget about space** - Most people are aware of big O run-time complexity, but candidates often forget about space complexity. Make sure to talk about both when you analyze your solution. As a side note, remember that a recursive solution will *not* be O(1) space.

Related resources:

- [\[Course\] Master The Data Structures And Algorithms Interview](https://www.jointaro.com/course/master-the-data-structures-and-algorithms-interview/)
- [How Alex Got Into Meta With 0 Prior LeetCode Experience](https://www.jointaro.com/lesson/ZYiTbN21FsqFxFdpwt5a/how-alex-got-into-meta-with-0-prior-leetcode-experience/)
- ["How do I balance my time between studying DSA and fleshing out my portfolio?"](https://www.jointaro.com/question/fhV2SCn56aYF4gfPVLmV/how-do-i-balance-my-time-between-studying-dsa-and-fleshing-out-my-portfolio/)
- ["Should I quit to prep for interviews?"](https://www.jointaro.com/question/Cno3oaZkvUu7BPLhHB7g/should-i-quit-to-prep-for-interviews/)
- [Presentation Slides](https://docs.google.com/presentation/d/13uLUHDvZifjp2aVClGsW29nfuVpQYvrkGLP8cej0R_k/edit#slide=id.p)