Google still asks the hardest algorithmic questions. Expect graph problems, dynamic programming, and questions that require multiple approaches.

• Arrays/Strings:
  • • Find the longest substring with at most K distinct characters
  • • Given a string of parentheses, find minimum insertions to make it valid
  • • Merge overlapping intervals with specific constraints
• Graphs:
  • • Find shortest path in a grid with obstacles (variations with teleportation)
  • • Detect cycle in a directed graph with specific starting conditions
  • • Find all paths from source to target in a DAG
• Dynamic Programming:
  • • Minimum cost to reach the end of an array with jump constraints
  • • Count number of ways to partition a string into palindromes
  • • Word break variations with dictionary constraints

Meta emphasizes speed. You'll typically get 2 problems in 45 minutes. They're usually medium difficulty but you need to solve them fast.

• Common Patterns:
  • • Two pointers: Valid palindrome with at most one removal
  • • BFS/DFS: Minimum time to rot all oranges in a grid
  • • Trees: Lowest common ancestor variations
  • • Binary search: Find peak element, search in rotated array
• Product-Oriented:
  • • Design an algorithm for feed ranking (simplified)
  • • Find mutual friends efficiently
  • • Implement a simplified news feed merge

Amazon coding rounds are often medium difficulty, but they care a lot about edge cases and testing. They also tie questions back to LPs.

• Frequently Asked:
  • • Two Sum variations (with sorted array, with multiple pairs)
  • • LRU Cache implementation
  • • Number of islands (and variations)
  • • Merge K sorted lists
  • • Find the Kth largest element
• Amazon-Specific Twists:
  • • Warehouse optimization problems (grid-based)
  • • Package delivery routing
  • • Inventory management simulations

Apple interviews are less standardized and often team-specific. Expect domain questions related to the team you're interviewing for.

• General:
  • • Implement a data structure (LRU cache, trie)
  • • String manipulation with memory constraints
  • • Tree traversals and modifications
• Domain-Specific:
  • • iOS: Memory management scenarios, concurrency
  • • ML: Feature engineering questions, model evaluation
  • • Hardware: Low-level optimization, bit manipulation

Netflix hires mostly senior engineers. Expect harder problems and deeper discussions about trade-offs and production concerns.

• Common Areas:
  • • Streaming-related: Buffer management, adaptive bitrate logic
  • • Recommendation systems: Similarity algorithms, ranking
  • • Distributed systems: Consistency, availability trade-offs in code

Google (Googleyness & Leadership)

• • Tell me about a time you had to navigate ambiguity
• • Describe a situation where you had to influence without authority
• • How do you handle disagreement with your manager?
• • Tell me about your biggest failure and what you learned
• • How do you prioritize when everything is urgent?

Meta (Move Fast, Impact)

• • Tell me about a time you shipped something quickly
• • Describe your most impactful project
• • How do you make decisions with incomplete information?
• • Tell me about a time you had to convince others of your idea
• • What's the most innovative thing you've built?

Amazon (Leadership Principles)

• • Tell me about a time you went above and beyond for a customer (Customer Obsession)
• • Describe when you took ownership of something outside your job (Ownership)
• • Tell me about a time you simplified a complex process (Invent and Simplify)
• • When did you make a decision without having all the data? (Bias for Action)
• • Describe a time you had to earn someone's trust (Earn Trust)

See my full Amazon LP guide for more.

Netflix (Culture Fit)

• • Tell me about a time you gave difficult feedback
• • How do you handle high-stakes decisions?
• • Describe a time you disagreed with a decision but committed anyway
• • What does "freedom and responsibility" mean to you?
• • How do you stay effective without close management?