DSA
This page is a living resource, continuously updated with problems and patterns frequently appearing in recent interviews. We're always working to ensure it stays current and relevant.
Introduction
This page serves as a comprehensive guide offering essential tips and strategic advice for individuals preparing for Data Structures and Algorithms (DSA) technical interviews. It is specifically tailored to assist aspiring candidates targeting highly competitive roles at leading tech companies, often referred to as FANG+ (Facebook/Meta, Amazon, Apple, Netflix, Google, and similar top-tier startups and tech giants).
Optimizing Your Coding Interview Preparation
Effective preparation is paramount for success in technical interviews. Consider the following strategies to enhance your problem-solving skills and optimize your study routine:
Implement Timed Practice: Allocate 15 minutes for medium-difficulty problems and 25 minutes for hard-difficulty problems. Adhere strictly to these time limits during practice sessions.
Post-Attempt Analysis and Review: Upon time expiration, evaluate your solution. If unsuccessful, flag the problem for re-attempt. Even with a successful solution, always review the most optimal approach to broaden your understanding.
Prioritize Conceptual Understanding: Focus on comprehending underlying patterns and algorithms rather than memorizing solutions. Deep understanding fosters adaptability to new problems.
Elevate Problem Difficulty: Avoid excessive focus on easy problems. Concentrate on medium-difficulty problems and gradually progress to hard problems to align with interview expectations.
Leverage Curated Problem Lists: Utilize established problem lists such as LC-150, NeetCode-150, Striver’s SDE Sheet. Alternatively, you may refer to our curated problem set below.
Data Structures and Algorithms at a glance
Wild Wild Tech Problem List
Dynamic Programming
Maximum Sum Circular Subarray [Medium]
String Manipulation
Design a text editor [Hard]
Graphs
Bus Routes [Hard]
Parallel Courses [Medium]
Greedy
Candy [Hard]
Furthest building you can reach [Medium]
Stack
Basic Calculator [Hard]
Misc
HashMap + Doubly linked list
All O`one Data Structure [Hard]