This repository contains a comprehensive list of the most recently asked coding interview questions at FAANG (Facebook/Meta, Amazon, Apple, Netflix, Google) companies as well as other top tech companies like OpenAI and Tesla. Questions are organized by company and topic to help you prepare effectively.
| No. | Question | Difficulty |
|---|---|---|
| 1 | Longest Substring Without Repeating Characters | Medium |
| 2 | String to Integer (atoi) | Medium |
| 3 | 3Sum | Medium |
| 4 | Minimum Window Substring | Hard |
| 5 | Valid Palindrome | Easy |
| 6 | Product of Array Except Self | Medium |
| 7 | Integer to English Words | Hard |
| 8 | Subarray Sum Equals K | Medium |
| 9 | Valid Palindrome II | Easy |
| 10 | Move Zeroes | Easy |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Add Two Numbers | Medium |
| 2 | Merge Two Sorted Lists | Easy |
| 3 | Copy List with Random Pointer | Medium |
| 4 | Reorder List | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Validate Binary Search Tree | Medium |
| 2 | Binary Tree Maximum Path Sum | Hard |
| 3 | Clone Graph | Medium |
| 4 | Number of Islands | Medium |
| 5 | Lowest Common Ancestor of a Binary Tree | Medium |
| 6 | Diameter of Binary Tree | Easy |
| 7 | Is Graph Bipartite? | Medium |
| 8 | Accounts Merge | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Letter Combinations of a Phone Number | Medium |
| 2 | Permutations | Medium |
| 3 | Permutations II | Medium |
| 4 | Remove Invalid Parentheses | Hard |
| 5 | Regular Expression Matching | Hard |
| 6 | Subsets | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Search in Rotated Sorted Array | Medium |
| 2 | Find First and Last Position of Element in Sorted Array | Medium |
| 3 | Merge Intervals | Medium |
| 4 | Find Peak Element | Medium |
| 5 | First Bad Version | Easy |
| 6 | Pow(x, n) | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Longest Palindromic Substring | Medium |
| 2 | Longest Valid Parentheses | Hard |
| 3 | Decode Ways | Medium |
| 4 | Best Time to Buy and Sell Stock | Easy |
| 5 | Word Break | Medium |
| 6 | Continuous Subarray Sum | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Two Sum | Easy |
| 2 | Longest Substring Without Repeating Characters | Medium |
| 3 | String to Integer (atoi) | Medium |
| 4 | Container With Most Water | Medium |
| 5 | Integer to Roman | Medium |
| 6 | 3Sum | Medium |
| 7 | Rotate Image | Medium |
| 8 | Group Anagrams | Medium |
| 9 | Minimum Window Substring | Hard |
| 10 | Trapping Rain Water | Hard |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Binary Tree Level Order Traversal | Medium |
| 2 | Symmetric Tree | Easy |
| 3 | Word Ladder | Hard |
| 4 | Number of Islands | Medium |
| 5 | Course Schedule | Medium |
| 6 | Word Search II | Hard |
| 7 | Cut Off Trees for Golf Event | Hard |
| 8 | Flood Fill | Easy |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Longest Palindromic Substring | Medium |
| 2 | Maximum Subarray | Medium |
| 3 | Best Time to Buy and Sell Stock | Easy |
| 4 | Word Break | Medium |
| 5 | Coin Change | Medium |
| 6 | LFU Cache | Hard |
| No. | Question | Difficulty |
|---|---|---|
| 1 | LRU Cache | Medium |
| 2 | Design Search Autocomplete System | Hard |
| 3 | Min Stack | Medium |
| 4 | Serialize and Deserialize Binary Tree | Hard |
| 5 | Design Twitter | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Two Sum | Easy |
| 2 | 3Sum | Medium |
| 3 | Merge Intervals | Medium |
| 4 | Valid Parentheses | Easy |
| 5 | Rotate Array | Medium |
| 6 | Product of Array Except Self | Medium |
| 7 | Move Zeroes | Easy |
| 8 | Next Permutation | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Binary Tree Level Order Traversal | Medium |
| 2 | Validate Binary Search Tree | Medium |
| 3 | Binary Tree Maximum Path Sum | Hard |
| 4 | Number of Islands | Medium |
| 5 | Lowest Common Ancestor of a Binary Tree | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Print in Order | Easy |
| 2 | Print FooBar Alternately | Medium |
| 3 | Building H2O | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | LRU Cache | Medium |
| 2 | Design Hit Counter | Medium |
| 3 | Logger Rate Limiter | Easy |
| 4 | Design Search Autocomplete System | Hard |
| 5 | Design In-Memory File System | Hard |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Merge Intervals | Medium |
| 2 | Meeting Rooms II | Medium |
| 3 | Trapping Rain Water | Hard |
| 4 | Task Scheduler | Medium |
| 5 | Maximum Frequency Stack | Hard |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Two Sum | Easy |
| 2 | Longest Substring Without Repeating Characters | Medium |
| 3 | Container With Most Water | Medium |
| 4 | 3Sum | Medium |
| 5 | Next Permutation | Medium |
| 6 | Multiply Strings | Medium |
| 7 | Longest Common Prefix | Easy |
| 8 | Expressive Words | Medium |
| 9 | Find And Replace in String | Medium |
| 10 | Minimum Domino Rotations For Equal Row | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Binary Tree Maximum Path Sum | Hard |
| 2 | Word Ladder | Hard |
| 3 | Number of Islands | Medium |
| 4 | Course Schedule | Medium |
| 5 | Count Complete Tree Nodes | Medium |
| 6 | Evaluate Division | Medium |
| 7 | Decode String | Medium |
| 8 | Time Needed to Inform All Employees | Medium |
| 9 | Flip Equivalent Binary Trees | Medium |
| 10 | Delete Nodes And Return Forest | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Longest Palindromic Substring | Medium |
| 2 | Maximum Subarray | Medium |
| 3 | Longest Increasing Path in a Matrix | Hard |
| 4 | Maximum Product Subarray | Medium |
| 5 | Coin Change | Medium |
| 6 | Longest String Chain | Medium |
| 7 | Minimum Distance to Type a Word Using Two Fingers | Hard |
| 8 | Split Array Largest Sum | Hard |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Random Pick with Weight | Medium |
| 2 | Snapshot Array | Medium |
| 3 | Guess the Word | Hard |
| 4 | Maximum Frequency Stack | Hard |
| 5 | Shortest Subarray with Sum at Least K | Hard |
| 6 | Divide Array in Sets of K Consecutive Numbers | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | K-Closest Points to Origin | Medium |
| 2 | Top K Frequent Elements | Medium |
| 3 | Maximum Subarray | Medium |
| 4 | Merge k Sorted Lists | Hard |
| 5 | Word Ladder | Hard |
| 6 | Word Break | Medium |
| 7 | LRU Cache | Medium |
| 8 | Implement Trie (Prefix Tree) | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Valid Parentheses | Easy |
| 2 | LFU Cache | Hard |
| 3 | Longest Substring Without Repeating Characters | Medium |
| 4 | Minimum Window Substring | Hard |
| 5 | Combination Sum | Medium |
| 6 | Course Schedule | Medium |
| 7 | Serialize and Deserialize Binary Tree | Hard |
| 8 | Time Based Key-Value Store | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Design Search Autocomplete System | Hard |
| 2 | Design Twitter | Medium |
| 3 | Design In-Memory File System | Hard |
| 4 | Design Log Storage System | Medium |
| 5 | Design Snake Game | Medium |
| 6 | Design Hit Counter | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Two Sum | Easy |
| 2 | Merge Intervals | Medium |
| 3 | Number of Islands | Medium |
| 4 | Rotate Image | Medium |
| 5 | Word Search | Medium |
| 6 | Binary Tree Level Order Traversal | Medium |
| 7 | Reverse Linked List | Easy |
| 8 | Longest Increasing Subsequence | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | LRU Cache | Medium |
| 2 | Min Stack | Medium |
| 3 | Serialize and Deserialize Binary Tree | Hard |
| 4 | Design HashMap | Easy |
| 5 | Design Underground System | Medium |
| No. | Question | Difficulty |
|---|---|---|
| 1 | Count Primes | Medium |
| 2 | Number of 1 Bits | Easy |
| 3 | Reverse Bits | Easy |
| 4 | Single Number | Easy |
| 5 | Counting Bits | Medium |
| 6 | Find the Duplicate Number | Medium |
| 7 | Maximum Product of Word Lengths | Medium |
| 8 | Sum of Two Integers | Medium |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | Two Sum | Easy | All |
| 2 | Container With Most Water | Medium | Google, Amazon |
| 3 | 3Sum | Medium | All |
| 4 | Product of Array Except Self | Medium | Meta, Apple |
| 5 | Subarray Sum Equals K | Medium | Meta, Amazon |
| 6 | Next Permutation | Medium | Google, Apple |
| 7 | Trapping Rain Water | Hard | Amazon, Netflix |
| 8 | Merge Intervals | Medium | All |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | Longest Substring Without Repeating Characters | Medium | All |
| 2 | String to Integer (atoi) | Medium | Meta, Amazon |
| 3 | Minimum Window Substring | Hard | Meta, Amazon |
| 4 | Valid Palindrome | Easy | Meta |
| 5 | Group Anagrams | Medium | Amazon, Google |
| 6 | Longest Palindromic Substring | Medium | All |
| 7 | Decode String | Medium | Google, Amazon |
| 8 | Longest Common Prefix | Easy |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | Add Two Numbers | Medium | Meta, Amazon |
| 2 | Merge Two Sorted Lists | Easy | Meta, Amazon |
| 3 | Reorder List | Medium | Meta |
| 4 | Copy List with Random Pointer | Medium | Meta, Amazon |
| 5 | Reverse Linked List | Easy | All |
| 6 | Merge k Sorted Lists | Hard | Amazon, Google |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | Number of Islands | Medium | All |
| 2 | Binary Tree Maximum Path Sum | Hard | Google, Meta |
| 3 | Clone Graph | Medium | Meta |
| 4 | Word Ladder | Hard | Google, Amazon |
| 5 | Course Schedule | Medium | Google, Amazon |
| 6 | Validate Binary Search Tree | Medium | Meta, Apple |
| 7 | Binary Tree Level Order Traversal | Medium | Amazon, Apple |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | Word Break | Medium | Meta, Amazon |
| 2 | Longest Increasing Path in a Matrix | Hard | Google, Amazon |
| 3 | Coin Change | Medium | Google, Amazon |
| 4 | Best Time to Buy and Sell Stock | Easy | Meta, Amazon |
| 5 | Maximum Subarray | Medium | Google, Amazon |
| 6 | Longest Palindromic Substring | Medium | All |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | LRU Cache | Medium | Netflix, Amazon |
| 2 | Design Search Autocomplete System | Hard | Amazon, Netflix |
| 3 | Serialize and Deserialize Binary Tree | Hard | Amazon |
| 4 | Min Stack | Medium | Amazon |
| 5 | Design Twitter | Medium | Amazon |
| 6 | LFU Cache | Hard | Amazon |
| No. | Question | Difficulty | Companies |
|---|---|---|---|
| 1 | K-Closest Points to Origin | Medium | OpenAI, Google |
| 2 | Top K Frequent Elements | Medium | OpenAI, Google, Amazon |
| 3 | Word Ladder | Hard | OpenAI, Google, Amazon |
| 4 | Time Based Key-Value Store | Medium | OpenAI, Meta |
| 5 | Design Search Autocomplete System | Hard | OpenAI, Amazon, Netflix |
| 6 | Implement Trie (Prefix Tree) | Medium | OpenAI, Google, Meta |