FAANG / MAANG+ Coding Interview Questions

August 24, 2026 · View on GitHub

A curated collection of coding, system design, and ML interview questions from top tech companies.
Continuously updated with 2025-2026 interview questions across 44 companies: FAANG, frontier AI labs, and AI-first startups.

GitHub stars GitHub forks License Last Commit PRs Welcome

Essential Resources

Problem Collections

Company-Specific Questions

AI & Machine Learning

Programming Resources

What Changed in 2026

The interview format shifted more this past year than in the previous five. The headline: AI-assisted rounds went mainstream, and where AI is allowed the rubric moved to verification: test before you trust the output, and be able to explain it.

  • Meta rolled out an AI-enabled coding round (3-panel CoderPad), now reaching SWE and EM roles up through E7/M2. Google is piloting an AI-assisted code-comprehension round with Gemini, while simultaneously bringing back an in-person round to curb cheating. LinkedIn made its AI-enabled round standard. DoorDash publicly rebuilt its interviews around AI.
  • OpenAI added an agentic coding round in beta, the only live round where AI is allowed (the take-home also permits it for Applied AI roles). Anthropic runs a split policy (AI permitted on the take-home, banned in live rounds) and has redesigned that take-home three times because Claude kept beating it. Sierra dropped algorithm interviews entirely.
  • ByteDance and Palantir explicitly ban AI use. Amazon and Apple report no AI round at all.
  • Work trials are the AI-startup norm: Cursor runs paid 8-9 hour onsite projects; OpenAI's take-home is a paid (~$1,000) work trial.
  • Netflix introduced formal engineering levels (E1-E7). The same answer is now scored against your target level.

Full breakdown in FAANG-Recent-Questions.md and the AI Labs guide.

Table of Contents

Company Questions

SNo.Company
1.FAANG Must Do Problems
2.Google
3.Meta (Facebook)
4.Amazon
5.Apple
6.Netflix
7.Microsoft
8.LinkedIn
9.OpenAI
10.Anthropic
11.Palantir
12.Databricks
13.Stripe
14.NVIDIA
15.Uber
16.ByteDance / TikTok
17.Airbnb
18.DoorDash
19.Tesla
20.Flipkart
21.Anduril
22.Figma
23.Ramp

AI Labs & AI Companies: full guide

SNo.CompanySignature Round
1.Google DeepMind2-hour rapid-fire technical quiz (CS + math + stats + ML)
2.xAIProctored CodeSignal; concurrency-at-scale extensions
3.Mistral AILLM knowledge quiz; ML coding from scratch
4.Meta Superintelligence LabsAI-enabled coding round
5.Amazon AGITransformer debugging + Leadership Principles
6.Perplexity AIFounder final round; RAG/search depth
7.Scale AICard-game OOP simulation; debugging round
8.CohereProduction infra code (Python/Go), no LeetCode tricks
9.Hugging FaceOpen-source take-home (Spaces demo)
10.Cursor (Anysphere)Paid 8-9 hour onsite project on the real codebase
11.Together AICUDA kernel take-home
12.GroqCompiler/LPU depth (NDA before first interview)
13.CerebrasTwo LC Mediums in 45 minutes
14.ElevenLabsProduct decomposition round
15.WaymoModern C++; correctness over speed
16.Character.AIML coding + real-time chat design
17.Sierra AIPlan -> Build (2h with AI) -> Review; no algorithms
18.Glean2-hour on-the-spot build assignment
19.RunwayCraft deep-dive; GPU pipeline design
20.SnowflakeData-processing twists; Cortex/AI platform design

Quick Start Guide

Beginner Track (0-3 months)

  • Start with Blind 75 for fundamentals
  • Practice 2-3 problems daily focusing on patterns
  • Review Python Resources for clean code

Intermediate Track (1-6 months)

Advanced Track (Targeting specific roles)

AI Lab Track (OpenAI, Anthropic, DeepMind, Mistral, xAI)

  • Read the AI Labs & AI Companies guide. These loops look nothing like FAANG
  • Practice implementing attention, tokenizers, and sampling from scratch: no libraries
  • Prepare for debugging rounds (broken Transformers, planted bugs) and progressive multi-level problems
  • Expect concurrency follow-ups on ordinary problems, and values/mission rounds that are real gates

FAANG Must Do Problems

View Problems
No.ProblemDifficultyTime ComplexitySpace Complexity
1Two SumEasyO(n)O(n)
2Longest Substring Without Repeating CharactersMediumO(n)O(min(m,n))
3Longest Palindromic SubstringMediumO(n²)O(1)
4Container With Most WaterMediumO(n)O(1)
53SumMediumO(n²)O(1)
6Remove Nth Node From End of ListMediumO(n)O(1)
7Valid ParenthesesEasyO(n)O(n)
8Merge Two Sorted ListsEasyO(n+m)O(1)
9Merge k Sorted ListsHardO(n log k)O(1)
10Search in Rotated Sorted ArrayMediumO(log n)O(1)
11Combination SumMediumO(2ⁿ)O(n)
12Rotate ImageMediumO(n²)O(1)
13Group AnagramsMediumO(n k log k)O(n k)
14Maximum SubarrayMediumO(n)O(1)
15Spiral MatrixMediumO(m×n)O(1)
16Jump GameMediumO(n)O(1)
17Merge IntervalsMediumO(n log n)O(n)
18Insert IntervalMediumO(n)O(n)
19Unique PathsMediumO(m×n)O(m×n)
20Climbing StairsEasyO(n)O(1)
21Set Matrix ZeroesMediumO(m×n)O(1)
22Minimum Window SubstringHardO(n)O(k)
23Word SearchMediumO(m×n×4ᵏ)O(k)
24Decode WaysMediumO(n)O(n)
25Validate Binary Search TreeMediumO(n)O(h)
26Same TreeEasyO(n)O(h)
27Binary Tree Level Order TraversalMediumO(n)O(n)
28Maximum Depth of Binary TreeEasyO(n)O(h)
29Construct Binary Tree from Preorder and Inorder TraversalMediumO(n)O(n)
30Best Time to Buy and Sell StockEasyO(n)O(1)

Google

View 45 Problems (2025-2026 Most Frequent)

2026 changes: an AI-assisted "code comprehension" round is piloting, in which you debug and optimize an existing codebase with Gemini available; interviewers score AI fluency (prompting, output validation, debugging AI output). An in-person round has been reinstated to curb AI-assisted cheating. The Googleyness round is now part-technical. Roughly 19% of reported problems are Hard. Segment tree / BIT problems are a Google-distinctive category.

No.ProblemDifficultyCategory
1Two SumEasyHash Map / Arrays
2Number of IslandsMediumGraph / DFS
3Merge IntervalsMediumIntervals / Sorting
4LRU CacheMediumDesign / Linked List
5Validate Binary Search TreeMediumTrees / BST
6Course Schedule IIMediumGraph / Topological Sort
7Longest Substring Without Repeating CharactersMediumSliding Window
8Trapping Rain WaterHardTwo Pointers / Stack
9Serialize and Deserialize Binary TreeHardTrees / Design
10Kth Largest Element in an ArrayMediumHeap / Quickselect
11Median of Two Sorted ArraysHardBinary Search
12Group AnagramsMediumHashing / Strings
13Word LadderHardBFS / Graphs
14Merge K Sorted ListsHardHeap / Linked List
15Container With Most WaterMediumTwo Pointers
16Top K Frequent ElementsMediumHeap / Hashing
17Coin ChangeMediumDynamic Programming
18Search in Rotated Sorted ArrayMediumBinary Search
19Product of Array Except SelfMediumArrays / Prefix
20Binary Tree Level Order TraversalMediumTrees / BFS
21Combination SumMediumBacktracking
22Edit DistanceMediumDynamic Programming
23Minimum Window SubstringHardSliding Window
24Implement Trie (Prefix Tree)MediumTrie
25Accounts MergeMediumUnion-Find
26Sliding Window MaximumHardMonotonic Deque
27The Skyline ProblemHardHeap / Divide and Conquer
28Largest Rectangle in HistogramHardMonotonic Stack
29Word Search IIHardTrie / Backtracking
30Rotting OrangesMediumGraph / BFS
31Critical Connections in a NetworkHardGraph / Tarjan's
32Pacific Atlantic Water FlowMediumGraph / Multi-source BFS
33Network Delay TimeMediumGraph / Dijkstra
34Daily TemperaturesMediumMonotonic Stack
35Find the Safest Path in a GridMediumBFS / Binary Search
36The Earliest Moment When Everyone Become FriendsMediumUnion-Find
37Checking Existence of Edge Length Limited PathsHardUnion-Find / Offline Queries
38Longest String ChainMediumDP / Hash
39Maximum Points You Can Obtain from CardsMediumSliding Window
40Step-By-Step Directions From a Binary Tree Node to AnotherMediumTree / LCA
41Swim in Rising WaterHardBinary Search + BFS
42Detect SquaresMediumDesign / Geometry
43Amount of New Area Painted Each DayHardSweep Line / Segment Tree
44Range Sum Query - MutableMediumSegment Tree / BIT
45Best Meeting PointHardMath / Median

Custom problems: restaurant waitlist data structure; number of lakes on an island; root an undirected acyclic graph as a binary tree; top-K most talkative users from chat logs; network of teleporters; car rental booking overlap.

Meta (Facebook)

View 45 Problems (2025-2026 Most Frequent)

2026 changes: The AI-enabled coding round is rolling out to all SWE roles, 60 min in a 3-panel CoderPad (file explorer, editor, AI chat; GPT-5, Claude Sonnet, Gemini, Llama 4 available; AI reads files but cannot edit). Three phases: fix a bug -> build a 120+ line feature -> optimize for larger datasets. Scored on problem solving, code quality, verification, and communication. For E4-E5 it randomly replaces one of the two coding rounds; at E6 it also replaces one of two, so a traditional CoderPad round normally remains. Behavioral weight increased, it can single-handedly downlevel E5 to E4. Candidates increasingly get variants of tagged problems.

No.ProblemDifficultyCategory
1Minimum Remove to Make Valid ParenthesesMediumStack / String
2Binary Tree Vertical Order TraversalMediumTree / BFS
3Basic Calculator IIMediumStack / Expression Parsing
4Valid Palindrome IIEasyTwo Pointers / String
5Kth Largest Element in an ArrayMediumHeap / Divide & Conquer
6Lowest Common Ancestor of a Binary TreeMediumTree / DFS
7Random Pick with WeightMediumBinary Search / Prefix Sum
8Subarray Sum Equals KMediumArray / HashMap / Prefix Sum
9Valid PalindromeEasyTwo Pointers / String
10Two SumEasyArray / HashMap
11Binary Tree Right Side ViewMediumTree / BFS
12Top K Frequent ElementsMediumHeap / HashMap
13Merge IntervalsMediumArray / Sorting
14LRU CacheMediumDesign / HashMap / Linked List
15Clone GraphMediumGraph / BFS / DFS
16Merge k Sorted ListsHardLinked List / Heap
17Maximum SwapMediumMath / Greedy
18Number of IslandsMediumGraph / DFS / BFS
19Accounts MergeMediumUnion-Find / Graph
20Diameter of Binary TreeEasyTree / DFS
21Product of Array Except SelfMediumArray / Prefix Sum
22Word BreakMediumDynamic Programming
23Copy List with Random PointerMediumLinked List / Hash Table
24Making a Large IslandHardGraph / DFS / Union-Find
25Expression Add OperatorsHardBacktracking / Math
26Valid Word AbbreviationEasyString / Parsing
27Lowest Common Ancestor of a Binary Tree IIIMediumTree / Hash Table
28Convert BST to Sorted Doubly Linked ListMediumTree / Linked List
29K Closest Points to OriginMediumHeap / Math
30Interval List IntersectionsMediumTwo Pointers / Intervals
31Simplify PathMediumStack / String
32Insert Delete GetRandom O(1)MediumDesign / Hash Table
33Sliding Window MaximumHardMonotonic Deque
34Regular Expression MatchingHardDP / Recursion
35All Nodes Distance K in Binary TreeMediumTree / BFS
36Validate IP AddressMediumString Parsing
37Remove All Adjacent Duplicates in String IIMediumStack
38Greatest Common Divisor of StringsEasyString / Math
39Find the Length of the Longest Common PrefixMediumTrie / Hash
40Toeplitz MatrixEasyMatrix
41Range Sum Query 2D - ImmutableMediumPrefix Sums
42Diagonal Traverse IIMediumArray / BFS
43Wildcard MatchingHardDP
44Integer to English WordsHardString / Recursion
45First Missing PositiveHardArray / Index Cycle

AI-round problems (~9 in rotation): Maze Solver with Path Printing; Maximize Unique Characters from Word List; Card Game (Three Cards Summing to 15); Friend Recommendation System.

Amazon

View 45 Problems (2025-2026 Most Frequent)

2026 changes: HackerRank OA = 2 coding problems (~70 min) + Work Simulation (~20 min) + Work Style Assessment; the SDE II OA adds a 20-min System Design scenario. ~75-80% of OA problems are Medium, wrapped in Amazon-themed framing (servers, warehouses, parcels). Onsite is ~50/50 coding vs Leadership Principles in every round, plus Bar Raiser. Rising: Dijkstra/weighted-shortest-path problems. No AI-assisted round: Amazon rotates custom OA sets aggressively instead, so pattern prep beats memorization.

No.ProblemDifficultyCategory
1Two SumEasyArray / Hash Table
2Number of IslandsMediumGraph / DFS / BFS
3LRU CacheMediumDesign / Hash + Linked List
4Merge IntervalsMediumArray / Sorting
5Group AnagramsMediumHashing / Strings
6Top K Frequent ElementsMediumHeap / Hashing
7Task SchedulerMediumHeap / Greedy
8Trapping Rain WaterHardTwo Pointers / Stack
9Product of Array Except SelfMediumArray / Prefix Sum
10Longest Substring Without Repeating CharactersMediumSliding Window
11Minimum Window SubstringHardSliding Window
12Kth Largest Element in an ArrayMediumHeap / Quickselect
13Merge k Sorted ListsHardHeap / Linked List
14Course ScheduleMediumGraph / Topological Sort
15Rotting OrangesMediumGraph / BFS
16Serialize and Deserialize Binary TreeHardTrees / Design
17Lowest Common Ancestor of a Binary TreeMediumTrees / DFS
18Coin ChangeMediumDynamic Programming
19Best Time to Buy and Sell StockEasyArray / DP
20Sliding Window MaximumHardDeque / Sliding Window
21Reorganize StringMediumHeap / Greedy
22Insert Delete GetRandom O(1)MediumDesign / Hash Table
23Decode StringMediumStack / Strings
24Koko Eating BananasMediumBinary Search
25Largest Rectangle in HistogramHardMonotonic Stack
26Car PoolingMediumArray / Prefix Sum
27Meeting Rooms IIIHardHeap / Sorting
28K Closest Points to OriginMediumHeap / Math
29Valid ParenthesesEasyStack / String
30Word SearchMediumBacktracking / Matrix
31Course Schedule IIMediumGraph / Topological Sort
32Design Hit CounterMediumDesign / Queue
33Min StackMediumStack / Design
34Maximum Frequency After Subarray OperationMediumArray / Greedy-DP
35Maximize Y-Sum by Picking a Triplet of Distinct X-ValuesMediumHeap / Greedy
36Max Difference You Can Get From Changing an IntegerMediumGreedy / Digits
37Analyze User Website Visit PatternMediumHash / Sorting
38Minimum Cost to Connect SticksMediumHeap / Greedy
39Word Search IIHardTrie + Backtracking
40Alien DictionaryHardTopological Sort
41The Skyline ProblemHardSweep Line / Heap
42Burst BalloonsHardInterval DP
43Count of Smaller Numbers After SelfHardMerge Sort / BIT
44Max Points on a LineHardGeometry / Hash
45Reorder ListMediumLinked List

Custom OA problems (2026): Server Allocation Cost; Warehouse Distribution; Minimum Array Operations; Bug Sorting by Frequency & Code; Distribute Parcels; Suitable Warehouse Locations; Min Cost To Add New Roads (Hard); Dropped Requests (Hard).

Apple

View 30 Problems (2025-2026 Most Frequent)

Still radically team-dependent. No unified loop: some teams ask standard LC mediums, embedded/hardware teams ask C/C++ memory questions, services teams ask API design or debug-broken-code. 2026: design-style coding questions are disproportionately common; loops for experienced hires run 8-9 rounds over several weeks. No AI-assisted rounds reported: human-only interviews graded on correctness, memory behavior, and boundary handling.

No.ProblemDifficultyCategory
1Two SumEasyArray / Hash Table
2LRU CacheMediumDesign / Hash + Linked List
3Number of IslandsMediumGraph / DFS / BFS
4Reverse Linked ListEasyLinked List
5Group AnagramsMediumString / Hash Table
6Valid ParenthesesEasyStack / String
7Merge IntervalsMediumArray / Sorting
8Word BreakMediumDynamic Programming
9Product of Array Except SelfMediumArray / Prefix Sum
10Best Time to Buy and Sell StockEasyArray / DP
113SumMediumArray / Two Pointers
12Trapping Rain WaterHardTwo Pointers / Stack
13Top K Frequent ElementsMediumHeap / Hash Table
14Course ScheduleMediumGraph / Topological Sort
15Lowest Common Ancestor of a Binary TreeMediumTree / DFS
16Serialize and Deserialize Binary TreeHardTree / Design
17Longest Substring Without Repeating CharactersMediumSliding Window
18Median of Two Sorted ArraysHardBinary Search
19Maximum Profit in Job SchedulingHardBinary Search / DP
20Bus RoutesHardGraph / BFS
21Sum Root to Leaf NumbersMediumTrees
22Check Completeness of a Binary TreeMediumTrees / BFS
23Time Based Key-Value StoreMediumDesign / Binary Search
24Design Hit CounterMediumDesign
25Design Add and Search Words Data StructureMediumTrie / Design
26Vertical Order Traversal of a Binary TreeHardTrees
27Binary Search Tree IteratorMediumDesign / Trees
28Subarray Sum Equals KMediumPrefix Sum
29Minimum Unique Word AbbreviationHardBacktracking / Bitmask
30H-IndexMediumSorting

Custom problems: memory-efficient ProRAW image decoder (<=1GB RAM); lock-free queue for watchOS sensor data; debug a PyTorch U-Net shape mismatch; Bag-of-Words similarity search; Library Management System OOP design.

Netflix

View 22 Problems (2025-2026 Most Frequent)

Biggest 2026 change: formal engineering levels. Netflix moved from a single "Senior Engineer" rung to an explicit multi-band ladder (~E1/L4-E7). The same coding answer is now scored against your target level, so an answer that passes at E4 can fail at E6 for being "too tactical." Loops are decentralized and team-owned; the hiring manager is involved from the first screen. Coding favors practical mediums re-skinned with Netflix domain (shows, playlists, watch history). The culture/Keeper Test round is mandatory in every loop.

No.ProblemDifficultyCategory
1LRU CacheMediumDesign / Hash + Linked List
2Merge IntervalsMediumArray / Sorting
3Course Schedule IIMediumGraph / Topological Sort
4Top K Frequent ElementsMediumHeap / Hash Table
5Network Delay TimeMediumGraph / Dijkstra
6Daily TemperaturesMediumMonotonic Stack
7Number of IslandsMediumGraph / DFS / BFS
8Serialize and Deserialize Binary TreeHardTree / Design
9Find Median from Data StreamHardHeap / Design
10Trapping Rain WaterHardTwo Pointers / Stack
11Edit DistanceMediumDynamic Programming
12Minimum Window SubstringHardSliding Window
13Meeting Rooms IIMediumIntervals / Heap
14Koko Eating BananasMediumBinary Search
15Implement Trie (Prefix Tree)MediumTrie / Design
16Rotating the BoxMediumMatrix / Simulation
17Time Based Key-Value StoreMediumDesign / Binary Search
18Logger Rate LimiterEasyDesign
19Word Search IIHardTrie / Backtracking
20Reconstruct ItineraryHardGraph / Euler Path
21Alien DictionaryHardTopological Sort
22Parallel CoursesMediumTopological Sort

Custom problems: TTL Cache with LRU eviction; Weighted Eviction Cache; Versioned Key-Value Store; Streaming Word Counter; group users by overlapping last-K watched movies; playlist add/remove/shuffle; rate limiter with graceful degradation when the limiter itself fails.

Microsoft

View 30 Problems (2025-2026 Most Frequent)

2026 changes: Process compressed. OA (2 mediums) then 4 virtual onsite rounds usually on a single day; SDE2 loops = 2-3 DSA + LLD + HLD + hiring manager. The "As Appropriate" (AA) round is formalized and run by Principal EMs; ~85% who reach it get offers, but it retains veto power. Behavioral "growth mindset" scoring is level-banded. AI-assisted rounds are org-specific, not universal: mostly CoreAI/Copilot teams; ask your recruiter.

No.ProblemDifficultyCategory
1Two SumEasyArray / Hash Table
2LRU CacheMediumDesign / Hash + Linked List
3Longest Substring Without Repeating CharactersMediumSliding Window
4Add Two NumbersMediumLinked List / Math
5Number of IslandsMediumGraph / DFS / BFS
6Maximum SubarrayMediumArray / DP
7Merge Two Sorted ListsEasyLinked List
8Copy List with Random PointerMediumLinked List / Hash Table
9Rotate ImageMediumArray / Matrix
10Set Matrix ZeroesMediumArray / Matrix
11Clone GraphMediumGraph / DFS / BFS
12Binary Tree Level Order TraversalMediumTree / BFS
13Median of Two Sorted ArraysHardBinary Search
14Regular Expression MatchingHardDP / Recursion
15Reverse Nodes in k-GroupHardLinked List
16Asteroid CollisionMediumStack
17Cheapest Flights Within K StopsMediumGraph / DP / BFS
18Construct Binary Tree from Preorder and Inorder TraversalMediumTree / Divide and Conquer
19Largest Rectangle in HistogramHardMonotonic Stack
20Sudoku SolverHardBacktracking / Matrix
21Trapping Rain WaterHardTwo Pointers
22Container With Most WaterMediumTwo Pointers
23Longest Palindromic SubstringMediumDP / Strings
24Next PermutationMediumArrays
25Search in Rotated Sorted ArrayMediumBinary Search
26Spiral MatrixMediumMatrix
27Word SearchMediumBacktracking
28First Missing PositiveHardArrays
29Jump Game IIMediumGreedy
30Generate ParenthesesMediumBacktracking

Custom problems (2026): reconstruct DNA payload strings from tagged fragments; build a CSV query engine; in-memory URL shortener; memory allocation simulation; debug broken queue code; combined rate-limiter + LFU round; traverse an org chart by level; minimum moves on a grid with k-cell jumps.

LLD: Vending Machine, Parking Lot, Snake & Ladder, Elevator Control System (SOLID + State/Strategy probed).

LinkedIn

View 30 Problems (2025-2026 Most Frequent)

2026 changes: The AI-enabled coding round is now standard: one of two coding rounds, on CoderPad with an AI chat panel (Claude/Opus tiers). The AI cannot edit code: you paste and verify. Graded on a 4-point scale where 3 passes, relative to other candidates. The follow-ups are the real bar: after working code, questioning pivots to concurrency/thread safety, scaling, malformed input, and production readiness.

No.ProblemDifficultyCategory
1Nested List Weight SumMediumDFS / Recursion
2Nested List Weight Sum IIMediumStack / DFS
3Can Place FlowersEasyArray / Greedy
4Find Leaves of Binary TreeMediumTree / DFS
5Max StackHardStack / Linked List / Design
6All O'one Data StructureHardHash Table / Linked List / Design
7Shortest Word Distance IIMediumHash Table / Design
8Find the CelebrityMediumTwo Pointers / Graph
9Maximum SubarrayMediumArray / DP
10Maximum Product SubarrayMediumArray / DP
11Merge IntervalsMediumArray / Sorting
12Edit DistanceMediumDynamic Programming
13Design Add and Search Words Data StructureMediumTrie / Design
14Word LadderHardBFS / Graphs
15Insert Delete GetRandom O(1)MediumDesign / Hash Table
16Valid ParenthesesEasyStack / String
17Isomorphic StringsEasyString / Hash Table
18Decode WaysMediumDynamic Programming
19House Robber IIMediumDynamic Programming
20Combination Sum IIMediumBacktracking
21LFU CacheHardDesign (confirmed in AI-enabled round)
22Insert Delete GetRandom O(1) - Duplicates allowedHardDesign
23Max Consecutive Ones IIIMediumSliding Window
24Max Consecutive Ones IIMediumSliding Window
25Design Authentication ManagerMediumDesign / TTL
26Serialize and Deserialize BSTMediumTrees / Design
27Paint House IIIHardDP
28Allocate MailboxesHardDP
29Generate Random Point in a CircleMediumMath / Randomized
30Valid Perfect SquareEasyBinary Search

Custom problems: structured data processing from scratch (parse JSON-like objects, AI-round staple); Merge Intervals reframed as a data-structure-choice design problem; LRU Cache with thread-safety and scaling follow-ups; merge two n-ary trees by key rules; count trips from vehicle logs.

OpenAI

View Problems (2025-2026 -- Production-Oriented)

OpenAI interviews focus on practical engineering over LeetCode puzzles. Problems are drawn from a bank of ~8 core challenges with progressive difficulty layers, and the bank churns. Python is strongly recommended.

New in 2026: (1) Agentic coding round (beta): you get an existing codebase and must add features scoped "too large and complex to tackle by hand," so you're expected to drive an AI coding agent. This is the only live round where AI is permitted. Every other interview strictly prohibits it (the take-home is the one other carve-out, and only for Applied AI roles). (2) The 48-hour take-home is now a paid work trial (~$1,000) under NDA, graded like a senior engineer's PR review, "missing test coverage" is the single most-cited rejection reason. (3) Loop = 2 coding + 1 system design + behavioral + hiring manager, plus a 45-min project presentation round.

Core Custom Problems (Most Frequently Reported)

No.ProblemDifficultyCategoryContext
1KV Store Serialize/DeserializeHardDesign / StringsMulti-part: basic serialization, file persistence, multithreading, versioned store
2CD Directory NavigationHardString / Path ResolutionImplement cd() with relative/absolute paths, .., ., ~, symlink cycle detection
3Excel/Spreadsheet EngineHardGraph / DesigngetCell() O(1), setCell() with formula dependencies, circular dependency detection
4In-Memory DatabaseHardDatabase Designselect() with WHERE, AND, ORDER BY, comparison operators -- no SQL parsing
5Resumable IteratorHardIterator / StateStateful iterator with getState()/setState(); now up to 6 parts: lists -> multi-file -> async -> 2D -> 3D
6Async Node CountingHardDistributed / TreesCount tree nodes using only async parent-child messaging
7Dependency Version Finder (new 2026)Medium-HardIterative RefinementFind earliest version supporting a feature; requirements evolve as test cases are revealed
8GPU Credit AllocationHardDesign / StateHalf-open intervals [start, expiration), consume soonest-expiring first, balance at any timestamp
9Versioned KV StoreHardDesignAuto-versioning; follow-ups: global vs per-key locks, optimistic locking, disk persistence
10Token Consumption Log ParserEasy-MediumParsingParse API-call logs, total tokens per user, sort by user ID

LeetCode-Equivalent Problems

No.ProblemDifficultyCategoryContext
7LRU CacheMediumDesignInference KV cache -- most frequently reported
8Time Based Key-Value StoreMediumDesign / Binary SearchModel checkpoint storage
9Snapshot ArrayMediumDesign / Binary SearchModel state checkpointing
10Alien DictionaryHardGraph / Topological SortTokenizer ordering
11Web Crawler MultithreadedMediumConcurrency / BFSTraining data crawling
12LFU CacheHardDesignAdvanced caching
13Decode StringMediumStack / StringsString processing
14Word LadderHardBFS / GraphsNLP transformations
15Design Memory AllocatorMediumDesign / SimulationGPU memory management
16Game of LifeMediumSimulation / MatrixExtended to infinite board
17Meeting Rooms IIMediumIntervals / HeapInterval scheduling
18Serialize and Deserialize Binary TreeHardTrees / DesignData persistence
19Top K Frequent ElementsMediumHeap / HashML preprocessing
20Course Schedule IIMediumGraph / Topological SortDependency resolution

Anthropic

View Interview Guide (2025-2026 -- Custom Problems + Concurrency Round)

Anthropic uses a CodeSignal OA followed by a 4-6 hour onsite with 4-6 rounds. Python expected. Problems are drawn from a bank of ~6 core custom challenges with progressive difficulty layers, and recruiters tell you which prompt family you'll get days beforehand.

Split AI policy: AI tools are strictly prohibited in all live interviews (candidates have been dropped for using them), but explicitly permitted on the performance take-home. Google/Stack Overflow are allowed in live coding.

The performance take-home has been redesigned three times because Claude kept beating it (Anthropic engineering blog + TechCrunch, Jan 2026): V1 (2024) was a 4-hour simulated-accelerator optimization; V2 (mid-2025) was cut to 2 hours after Claude Opus 4 outperformed most humans; V3 (late 2025) is a Zachtronics-puzzle-style constrained instruction set where you minimize instruction count with no built-in debugging tools, building your own tooling is part of the test. The original is open-sourced at anthropics/original_performance_takehome.

The Values/Culture round (45 min) is the #1 failure point: identical across all roles and levels. It's NOT behavioral/STAR: it evaluates holding complexity, admitting knowledge gaps, second-order reasoning, and intellectual honesty. Scripted STAR stories are the top failure mode, and measured skepticism about the mission scores better than performed enthusiasm.

Core Custom Coding Problems (Most Frequently Reported)

No.ProblemDifficultyCategoryContext
1In-Memory DatabaseHardDesign4 levels: SET/GET/DELETE -> filtered scans -> TTL -> backup/restore
2Web CrawlerHardBFS / ConcurrencyBFS crawl -> multithreaded/async optimization
3LRU Cache (Bugfix + Extend)HardDesign / DebuggingFix bugs, add persistence, handle *args/**kwargs
4Stack Trace / ProfilerHardParsing / DesignConvert sampling data to chronological events
5Tokenization EngineHardString / NLPGreedy longest-match tokenization with unknown-token merging; also a code-review exercise
6Distributed Mode/MedianHardDistributed SystemsCompute across 10 nodes with bandwidth constraints
7Record StoreHardProgressive OAIn-memory DB + conditional writes + historical ("at timestamp") queries; L4 = compression/persistence
8Bank LedgerMedium-HardProgressive OAAccount creation -> merging -> delayed cashback -> spending analytics
9Recipe Catalog / Task TrackerEasy-MediumProgressive OAMetadata storage, search by ingredient/prep time; priority + deadline tracking
10Profiler Trace DenoisingHardAlgorithmsFilter short-lived calls; emit events only after N consecutive appearances

LeetCode Practice Problems (Mapped to Anthropic's Focus Areas)

No.ProblemDifficultyCategory
1LRU CacheMediumDesign
2Web Crawler MultithreadedMediumConcurrency / BFS
3Implement Trie (Prefix Tree)MediumTrie / NLP
4Word BreakMediumDP / Strings
5Design Hit CounterMediumDesign
6Time Based Key-Value StoreMediumDesign / Binary Search
7Serialize and Deserialize Binary TreeHardTrees / Design
8Merge k Sorted ListsHardHeap / Distributed
9Course Schedule IIMediumGraph / Topological Sort
10Number of IslandsMediumGraph / DFS
11Count of Smaller Numbers After SelfHardMerge Sort / BIT (phone screen; O(n log n) required)

Key Focus Areas: AI safety/alignment (Constitutional AI, RLHF, red-teaming), systems engineering (distributed training, inference optimization), concurrency/parallel programming, Transformer architecture depth. Prep material for the values round: Core Views on AI Safety + the Responsible Scaling Policy.

Palantir

View 25 Problems + Unique Interview Format (2025-2026)

Palantir's onsite gives you 3 of 4 round types: Decomposition, System Design, Re-engineering (Debugging), and Coding. Each round includes 20 min of behavioral questions. AI use is strictly prohibited in interviews: a notable divergence from the industry's 2026 drift toward AI-assisted rounds.

The OA is a 3-part practical HackerRank (~90 min): one coding (shape classes OOP) + one SQL (sessions-per-city 3-table join) + one REST API task (paginated restaurant endpoint). Not pure DSA.

Meritocracy Fellowship (launched 2025): an alternative pipeline for high-school grads (SAT >= 1460 / ACT >= 33, $5,400/mo, 4 months). 22 hired from 500+ applicants; successful fellows interview for full-time roles without a degree.

Most Frequently Asked Coding Problems

No.ProblemDifficultyCategory
1Merge IntervalsMediumIntervals / Sorting
2Number of IslandsMediumGraph / DFS / BFS
3LRU CacheMediumDesign / Hash Map
4Course ScheduleMediumGraph / Topological Sort
5Course Schedule IIMediumGraph / Topological Sort
6All Ancestors of a Node in DAGMediumGraph / DFS
7Merge k Sorted ListsHardHeap / Linked List
8Trapping Rain WaterHardTwo Pointers / Stack
9Regular Expression MatchingHardDP / String
10Subdomain Visit CountMediumHash Map / String
11Find the CelebrityMediumArray / Logic
12UTF-8 ValidationMediumBit Manipulation
13Container With Most WaterMediumTwo Pointers
14Max Area of IslandMediumGraph / DFS
15Rotate ImageMediumArray / Matrix
16Integer to English WordsHardString / Math
17Shortest Path to Get All KeysHardBFS / Bitmask
18Construct Quad TreeMediumTree / Recursion
19Inorder Successor in BSTMediumTree / BST
20Contains Duplicate IIIHardBST / Bucket Sort
21Minimum Time DifferenceMediumString / Sorting
22Flood FillEasyBFS / DFS
23Cheapest Flights Within K StopsMediumShortest Path
24Word LadderHardBFS / State-Space Search
25Best Time to Buy and Sell StockEasyArray

Unique Interview Rounds

  • Decomposition: Break down open-ended real-world problems. Non-coding. AI-flavored prompts (new in 2026): an insurer wants LLM-powered claim summarization; a logistics firm wants an agent to reroute shipments; unify bank fraud detection across legacy systems; retailer demand forecasting; a platform for 500 data sources. Classics: "Design tech to help elderly cook safely"; chess; parking garage; social graph; infection spread; taxi dispatch.
  • Re-engineering (Debugging): Debug 500-1000 lines of buggy code with red herrings; sometimes proprietary-library docs are supplied
  • System Design: Focus on data integration, ontology design, access control (ABAC); correctness and fault tolerance are first-class constraints
  • FDSE vs SWE: Forward-deployed roles emphasize client-facing scenarios; backend roles emphasize scale

Databricks

View 30 Problems (2025-2026 Most Frequent -- includes dedicated concurrency round)

Databricks has a unique dedicated concurrency/multithreading round (1 hour), "most companies wave at the topic; Databricks makes it an entire hour." OA is 4 problems in 70 minutes on CodeSignal (2 easy, 2 medium), webcam-proctored, scored on a scale up to 850. The onsite is fully virtual in 2026: 2 algorithm rounds + concurrency + system design + behavioral.

Small question pool, deep follow-up variations: the same core problems (SnapshotSet, Lazy Array, House Robber variants, Tic-Tac-Toe) recycle with escalating twists, including "now distribute this with Spark" follow-ups.

No.ProblemDifficultyCategory
1Capacity To Ship Packages Within D DaysMediumBinary Search
2Trapping Rain WaterHardTwo Pointers / Stack
3Max StackHardStack / Linked List / Design
4All O'one Data StructureHardHash Table / Design
5Word BreakMediumDP / Trie
6Rotting OrangesMediumBFS / Matrix
7All Nodes Distance K in Binary TreeMediumTree / BFS / DFS
8Decode StringMediumStack / Recursion
9K Closest Points to OriginMediumHeap / Math
10Asteroid CollisionMediumStack
11Design Hit CounterMediumDesign / Queue
12Time Based Key-Value StoreMediumDesign / Binary Search
13Snapshot ArrayMediumDesign / Binary Search
14Find All Anagrams in a StringMediumSliding Window
15Cheapest Flights Within K StopsMediumGraph / BFS / DP
16Binary Search Tree IteratorMediumStack / Tree / Design
17House RobberMediumDynamic Programming
18Interval List IntersectionsMediumTwo Pointers
19Print in OrderEasyConcurrency
20Print FooBar AlternatelyMediumConcurrency
21Building H2OMediumConcurrency
22The Dining PhilosophersMediumConcurrency
23Course Schedule IIMediumGraph / Topological Sort
24Alien DictionaryHardGraph / Topological Sort
25Median of Two Sorted ArraysHardBinary Search
26IP to CIDRMediumBit Manipulation
27Max Area of IslandMediumDFS
28House Robber IIMediumDP
29Design Tic-Tac-ToeMediumDesign (variable board + win condition)
30Top K Frequent WordsMediumHeap (in a stream, memory-bounded)

Custom problems: SnapshotSet / versioned iterator (iterator reflects state at creation time, most-reported); Lazy Array (chained map + indexOf); Revenue System with referral chains; in-place delta encoding (+ "distribute with Spark"); replaying shell commands (cp/ls/mv/!<index>); SMS message splitting; lamps on a number line; multi-threaded logger; token-bucket rate limiter with burst probing.

Stripe

View 19 Problems + Unique Interview Format (2025-2026)

Stripe does NOT use traditional LeetCode-style interviews. Problems model real engineering work -- payment processing, debugging, API integration. Code quality valued over algorithmic cleverness. Unique rounds: Bug Squash (debug a GitHub repo), Integration (build with Stripe API), API Design (REST resource modeling).

2026 changes: The new-grad OA is now a single 60-minute multi-part question on HackerRank: "measuring true coding ability with one question." Integration round rules clarified: web/docs search is allowed, but AI coding assistants are NOT permitted. Bug Squash now focuses sharply on financial-logic bugs: race conditions, missing idempotency checks, non-atomic check-then-act, unvalidated refund logic (~5-7 bugs in ~200 lines).

LeetCode-Mapped Practice Problems

No.ProblemDifficultyCategory
1Two SumEasyHash Map (transaction matching)
2LRU CacheMediumDesign (caching patterns)
3Merge IntervalsMediumIntervals (batch scheduling)
4Design Hit CounterMediumDesign (rate limiting)
5Top K Frequent ElementsMediumHeap (merchant ranking)
6Subarray Sum Equals KMediumPrefix Sum (revenue calc)
7Time Based Key-Value StoreMediumDesign / Binary Search
8Course ScheduleMediumGraph / Cycle Detection
9Sliding Window MaximumHardDeque (event log analysis)
10Serialize and Deserialize Binary TreeHardDesign (JSON parsing)
11Coin ChangeMediumDP (fee calculation)
12Group AnagramsMediumHashing / Strings
13Product of Array Except SelfMediumArrays / Prefix
14Longest Substring Without Repeating CharactersMediumSliding Window
15Number of IslandsMediumGraph / DFS
16Evaluate DivisionMediumGraph (currency conversion analogue)
17Invalid TransactionsMediumSimulation (fraud-detection analogue)
18Single-Threaded CPUMediumHeap (notification scheduler analogue)
19LFU CacheHardDesign (idempotency store analogue)

Custom Problems: Accept-Language header parser (parse q-values, sort by quality, the long-standing screen); currency conversion string parsing ("USD:CAD:DHL:5,..." -> multi-hop -> best rate over all paths); card range obfuscation; fraud detection stream (CHARGE/DISPUTE, per-MCC thresholds); subscription notification scheduler; CSV parse + validate with circular dependency detection; invoice reconciliation; request deduplication (idempotency); webhook handler debugging; payment retry with exponential backoff; shipping cost calculator.

NVIDIA

View 25 Problems (2025-2026 -- GPU/Performance Focus)

NVIDIA interviews emphasize performance awareness (cache hierarchies, memory bandwidth, parallelization). After solving the baseline, expect: "How does this behave under memory pressure? How would you parallelize across 10,000 threads?" C++ essential for systems/GPU roles.

2026 changes: Loops are team-scoped with a "build from scratch" preference: interviewers prefer you avoid built-in library functions. Candidates report bespoke variants over tagged problems. Classic problems now get systems extensions: LRU Cache follow-ups ask you to make it thread-safe with a read-write lock (and justify RW lock vs mutex), or relate it to GPU memory caching. AI-infra system design is the new senior bar: batch inference APIs on GPU clusters, tensor+pipeline parallelism across H100s, TensorRT-LLM/vLLM tradeoffs.

No.ProblemDifficultyCategory
1Maximum Number of Events That Can Be AttendedMediumGreedy / Heap
2Min StackMediumStack / Design
3Clone GraphMediumGraph / DFS
4K Closest Points to OriginMediumHeap / Math
5Random Pick with WeightMediumBinary Search / Prefix Sum
6Trapping Rain WaterHardTwo Pointers / Stack
7Number of IslandsMediumGraph / DFS / BFS
8Rotate ImageMediumArray / Matrix
9Word BreakMediumDynamic Programming
10Shortest Path in Binary MatrixMediumBFS / Graph
11Design HashMapEasyDesign / Hash Table
12Longest Increasing Path in a MatrixHardDFS / DP / Topological Sort
13Permutation in StringMediumSliding Window
14Expression Add OperatorsHardBacktracking / Math
15Binary Search Tree IteratorMediumTree / Stack
16Word Ladder IIHardBFS / DFS / Backtracking
17Bus RoutesHardBFS / Graph
18Making A Large IslandHardDFS / Union Find
19Line ReflectionMediumHash Table / Math
20Missing RangesEasyArray / String
21Special Binary StringHardString / Recursion
22LRU CacheMediumDesign (thread-safe RW-lock extension)
23Maximum Binary TreeMediumRecursion / Tree
24Merge k Sorted ListsHardHeap / Linked List
25Longest Substring Without Repeating CharactersMediumSliding Window

CUDA/GPU-Specific: Matrix multiplication optimization (GEMM), CUDA kernel fusion, memory coalescing analysis, thread synchronization across blocks, multi-GPU communication patterns. 2026 conceptual drills: profile a slow kernel with Nsight Compute; fix uncoalesced access / bank conflicts / thread divergence; make a kernel scale across GPU architectures; occupancy analysis.

Custom problems: polynomial multiplication API in C; temperature spike detection from (timestamp, temp) pairs; minimum sum after K operations; log aggregation by HTTP status code; tree planting constraint satisfaction.

Uber

View 24 Problems (2025-2026 -- Domain-Driven)

Uber interviews reflect the product domain -- routing, dispatch, surge pricing map to graph traversal, streaming aggregation, and sliding-window patterns. Code readability is explicitly evaluated.

2026 changes: Machine-coding / LLD rounds are the differentiator at senior levels: coding is the primary gate while system-design quality decides leveling (L5a/L5b/Senior/Staff). Original non-LeetCode problems appear in "Hack2Hire" assessments. Questions cluster into four families: graphs/BFS-DFS, sliding window/two pointers, heaps/streaming, and cache/design, with domain-flavored twists (quadtrees for geo points, rate limiters, autocomplete).

No.ProblemDifficultyCategory
1Maximize Amount After Two Days of ConversionsMediumGraph / BFS
2Bus RoutesHardGraph / BFS
3Alien DictionaryHardTopological Sort
4Number of Islands IIHardUnion Find
5Design Hit CounterMediumDesign / Sliding Window
6Number of IslandsMediumGraph / DFS
7Spiral MatrixMediumMatrix / Array
8Word SearchMediumBacktracking / DFS
9LRU CacheMediumDesign / HashMap + Linked List
10Top K Frequent ElementsMediumHeap / Bucket Sort
11Evaluate DivisionMediumGraph / Weighted
12Construct Quad TreeMediumDivide and Conquer
13Random Pick with WeightMediumPrefix Sum / Binary Search
14Find Median from Data StreamHardTwo Heaps / Design
15Merge IntervalsMediumSorting / Greedy
16Meeting Rooms IIMediumHeap / Intervals
17Course ScheduleMediumGraph / Cycle Detection
18Course Schedule IIMediumGraph / Topological Sort
19Longest Subarray With Absolute Diff <= LimitMediumSliding Window / Monotonic Deque
20Squares of a Sorted ArrayEasyTwo Pointers
21Kth Smallest Element in a BSTMediumBST (O(1)-space Morris follow-up at L5+)
22Group AnagramsMediumHash Table
23Serialize and Deserialize Binary TreeHardTree Encoding
24Design Search Autocomplete SystemHardTrie / Design (Uber Eats framing)

Custom Problems: thread-safe token-bucket rate limiter (machine coding); expiry counter (TTL-based driver sessions); geo heatmap builder (aggregate ride pings); driver-rider matching engine; surge pricing calculator; referral revenue tracker; deep equality of nested records; sort a string of clothing sizes ("XS < S < M"); earliest full connectivity timestamp; adaptive bitrate selector.

ByteDance / TikTok

View 30 Problems (2025-2026 -- High Difficulty)

ByteDance interviews are among the most technically demanding in the industry. Baseline is Medium, Hard is frequent. Candidates solve 2-3 problems per round (vs 1-2 at Google/Meta). Interviewers write their own problems and progressively mutate them mid-round. Compile-ready, bug-free code expected.

2026 changes: The OA was overhauled, switched from HackerRank to CodeSignal, multiple-choice removed entirely, now 4 pure coding problems in 70-90 min (down from ~120 in 2025), with strict proctoring (camera on, screen share, no leaving the window). AI tools are explicitly banned: violations mean immediate disqualification. Questions are increasingly scenario-wrapped (file systems, server infrastructure, data pipelines). The hiring-manager round can include an LC-Hard DP under a strict clock.

No.ProblemDifficultyCategory
1Implement Queue using StacksEasyStack / Queue / Design
2Daily TemperaturesMediumMonotonic Stack
3Merge k Sorted ListsHardLinked List / Heap
4LRU CacheMediumDesign / Hash + Linked List
5Max Consecutive Ones IIIMediumSliding Window
6Sliding Window MaximumHardDeque / Sliding Window
7Number of IslandsMediumGraph / DFS / BFS
8Search in Rotated Sorted ArrayMediumBinary Search
9Binary Tree Maximum Path SumHardTree / DFS
10Trapping Rain WaterHardTwo Pointers / DP
11Course Schedule IIMediumGraph / Topological Sort
123SumMediumTwo Pointers / Array
13Longest Valid ParenthesesHardStack / DP
14N-QueensHardBacktracking
15Serialize and Deserialize Binary TreeHardTree / Design
16Kth Largest Element in an ArrayMediumHeap / Quickselect
17Coin ChangeMediumDynamic Programming
18Regular Expression MatchingHardDP / String
19Longest Increasing Path in a MatrixHardDFS / DP / Topological Sort
20Minimum Difference in Sums After Removal of ElementsHardHeap / Greedy
21Gas StationMediumGreedy
22The kth Factor of nMediumMath
23Zero Array Transformation IMediumPrefix Sum / Diff Array
24Maximum Area Rectangle With Point Constraints IMediumGeometry / Hash
25Maximize Amount After Two Days of ConversionsMediumGraph / DFS
26Count Unhappy FriendsMediumSimulation
27Number of Islands IIHardUnion-Find
28K Inverse Pairs ArrayHardDP
29Sliding Window MedianHardTwo Heaps
30Decode Ways IIHardDP

Custom Problems: GPU resource management (job queue + scheduler + monitor with fairness and bin-packing); Server Investment and Round Robin Load Balancer (new 2026 OA); Map Async Limit, middleware compose(), and bind polyfill (frontend rounds); video chunk scheduler; hashtag trend detector; comment tree flattening; content moderation priority queue; video deduplication via hashing; live viewer count at billion scale.

Airbnb

View 19 Problems (2025-2026 -- Hardest Difficulty Skew)

Airbnb's most distinctive rule is no pseudocode: your code must actually run and pass test cases in the 45-60 min CoderPad screen. ~33% of reported problems are Hard, with heavy DP and simulation emphasis. Problems arrive dressed as product features (interval merging as overlapping reservation windows). Core values and cross-functional rounds are true gates, not chats.

No.ProblemDifficultyCategory
1Text JustificationHardString Simulation
2Maximum Profit in Job SchedulingHardDP + Binary Search
3Palindrome PairsHardTrie / Hash
4Flatten 2D VectorMediumIterator Design
5Combination SumMediumBacktracking
6Smallest Common RegionMediumHash / LCA
7Maximum Candies You Can Get from BoxesHardBFS
8Pour WaterMediumSimulation
9Alien DictionaryHardTopological Sort
10Cheapest Flights Within K StopsMediumBFS / Bellman-Ford
11Sliding PuzzleHardBFS State Search
12Design Excel Sum FormulaHardDesign / Topological
13Trapping Rain WaterHardTwo Pointers
14IP to CIDRMediumBit Manipulation
15Employee Free TimeHardIntervals / Heap
16Simple Bank SystemMediumDesign / Simulation
17Word Search IIHardTrie + Backtracking
18Mini ParserMediumStack Parsing
19Regular Expression MatchingHardDP

System Design: Booking/reservation system with time-based availability and strict payment correctness; geo-aware listing search and ranking; notification service; recommendation engine.

DoorDash

View 17 Problems + AI-Assisted Interview Format (2025-2026)

DoorDash publicly rebuilt its engineering interviews around AI. The new format is a 60-min AI-assisted working session in your own IDE, where free tiers of the common agent tools suffice and all agent features are allowed. You're graded on pragmatic tradeoffs, turning ambiguity into a plan, minimal-repro validation, and narrating reasoning. The policy is transitional: traditional algorithm rounds still ban AI, while the working session mandates it. Loop: CodeCraft (build a business module, extend as requirements arrive), Debugging (subtle bugs in an unfamiliar codebase), System Design, Behavioral.

No.ProblemDifficultyCategory
1Walls and GatesMediumMulti-source BFS
2Shortest Distance from All BuildingsHardMulti-source BFS
301 MatrixMediumMulti-source BFS
4Maximum Profit in Job SchedulingHardDP + Binary Search
5Binary Tree Maximum Path SumHardTree DP
6Basic CalculatorHardStack Parsing
7Longest Increasing Path in a MatrixHardDFS + Memo
8Koko Eating BananasMediumBinary Search
9Search Suggestions SystemMediumTrie / Sorting
10Find K Closest ElementsMediumBinary Search
11Ways to Make a Fair ArrayMediumPrefix Sums
12Check if One String Swap Can Make Strings EqualEasyString
13Largest Rectangle in HistogramHardMonotonic Stack
14Making A Large IslandHardUnion-Find / DFS
15Design HashMapEasyDesign
16Jump GameMediumGreedy / DP
17Longest Common PrefixEasyString

Custom problems: Nearest DashMart (multi-source BFS on a city grid); Dasher pay module with rule stacking (CodeCraft); support-ticket workflow automation engine (AI working session); debugging an unfamiliar codebase with planted bugs.

Tesla

View 25 Problems (2025-2026 -- Greedy + Embedded Focus)

Greedy and string manipulation are heavily tested (Reorganize String is most-asked). OA is ~85-90 min, 3 problems on Codility. New in 2026: take-homes replaced by a ~60-min practical CoderPad screen for many teams, and a shift back toward in-person onsites. Googling and documentation are allowed; LLM use is at interviewer discretion: evaluators watch whether you critically review code rather than paste blindly. Questions are team-tied: Autopilot/firmware/energy loops add sensor parsing, state machines, and scheduling. Difficulty across ~47 tracked problems: 8 Easy / 33 Medium / 6 Hard.

No.ProblemDifficultyCategory
1Reorganize StringMediumGreedy / Heap
2Minimum Area RectangleMediumGeometry / Hash
3Find Peak ElementMediumBinary Search
4Maximum SubarrayMediumKadane / DP
5Subarray Sum Equals KMediumPrefix Sum
6Reverse Words in a StringMediumStrings
7Palindrome PermutationEasyChar Frequency
8Palindrome Linked ListEasyTwo Pointers
9Top K Frequent WordsMediumHeap / Hash
10Group AnagramsMediumHash / Sorting
11Kth Largest Element in an ArrayMediumHeap / Quickselect
12Task SchedulerMediumGreedy / Heap
13Sort ColorsMediumDutch National Flag
14Rotate ImageMediumMatrix
15Find Pivot IndexEasyPrefix Sum
16Search in Rotated Sorted ArrayMediumBinary Search
17Design Hit CounterMediumDesign
18Course Schedule IIMediumTopological Sort
19Word LadderHardBFS
20Merge k Sorted ListsHardHeap
21Alien DictionaryHardTopological Sort
22Trapping Rain WaterHardTwo Pointers
23First Missing PositiveHardArrays
24Minimum Window SubstringHardSliding Window
25Number of 1 BitsEasyBit Manipulation (embedded)

Embedded/firmware: interrupt-safe circular buffers in C, CAN bus protocol design, RTOS task scheduling, mutex vs. semaphore, I2C/UART/SPI selection, bitwise register exercises.

Custom problems: sensor data parsing (noisy streams), state machine implementation (vehicle/charging states), scheduling simulations from an internal question bank.

Flipkart

View Problems
No.ProblemDifficultyCategory
1Add Two NumbersMediumLinked List / Math

About This Repository

This repository covers 1,470+ problem listings across 44 companies (365 unique LeetCode problems, plus 100+ company-specific custom problems that never appear on LeetCode), organized by company and topic, spanning FAANG/MAANG+, frontier AI labs (OpenAI, Anthropic, DeepMind, xAI, Mistral), and AI-first companies (Perplexity, Scale AI, Cursor, Cohere, Waymo, Sierra, Glean). Includes NeetCode 150, Blind 75, system design guides, and ML/AI interview resources.

Every LeetCode link is validated against LeetCode's live problem list.

Latest FAANG/MAANG+ Questions - Company-by-company breakdown with 2026 process changes and custom (non-LeetCode) problem banks.

AI Labs & AI Companies Guide - 20 AI labs and AI-first companies: interview processes, custom problems, ML coding, and system design.

Complete System Design Interview Guide - 25 system design problems with complexity ratings and company tags.

Contributing

Contributions are welcome. Please feel free to submit a pull request with new questions, corrections, or additional company coverage.


🔔 You Found the Shortcut. Don't Lose It.

New questions, papers, and strategies drop here every single week, before they surface anywhere else.

The engineers who land FAANG offers aren't the ones who find a resource. They're the ones who never lose it.

One click. Every update. Zero effort.

Watch Repo   Star Repo

Follow @ombharatiya for exclusive tips, paper breakdowns, and career moves that never make it into the repo:

GitHub Twitter LinkedIn

License

GPL-3.0 -- see LICENSE for details.