FAANG-Coding-Interview-Questions

KO | EN

gitlite — search

#javascript #python #ai #typescript #go #android #deep-learning #linux #docker #java #windows #vue #awesome-list #open-source

FAANG-Coding-Interview-Questions

(★ 16)

A curated List of Coding Questions Asked in FAANG Interviews

FAANG-Coding-Interview-Questions Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# FAANG Coding Interview Questions - 2025 Edition

<div align="center">
  <p><em>Your star helps keep this collection updated with fresh interview questions. Follow for notifications on new resources that could help you land your dream tech job.</em></p>
  
  <p>
    <a href="https://github.com/ombharatiya/FAANG-Coding-Interview-Questions/stargazers">
      <img src="https://img.shields.io/badge/⭐%20STAR%20THIS%20REPO-yellow?style=for-the-badge" alt="Star This Repo" />
    </a>
    <a href="https://github.com/ombharatiya?tab=followers">
      <img src="https://img.shields.io/badge/👨‍💻%20FOLLOW%20@OMBHARATIYA-39D353?style=for-the-badge" alt="Follow @ombharatiya" />
    </a>
  </p>

<h3>🚨 NEW: <a href="./NeetCode-150.md">NeetCode 150</a> & <a href="./Blind-75.md">Blind 75</a> Essential Problems + <a href="./SYSTEM_DESIGN_INTERVIEW.md">System Design Guide</a> and <a href="./FAANG-Recent-Questions.md">Latest FAANG Questions</a>! 🚨</h3>
  
  <p><i>A curated collection of coding and system design questions asked at top tech companies. Helping you ace your next interview!</i></p>
</div>

## 🎯 Essential Interview Preparation Resources

### 🔥 Top Problem Collections
- **[NeetCode 150 - Essential Problems for FAANG Interviews](./NeetCode-150.md)** ⭐ *NEW!*
- **[Blind 75 - The Ultimate Interview Preparation List](./Blind-75.md)** ⭐ *NEW!*
- [Top 75 LeetCode Questions to Crack The Coding Interviews](./TopLeetCodeProblems.md)

### 🏢 Company-Specific Questions  
- [Most Recently Asked Questions at FAANG and other top companies](./FAANG-Recent-Questions.md)
- [System Design Interview Guide](./SYSTEM_DESIGN_INTERVIEW.md)

### 🤖 AI & Machine Learning Resources
- [LLM Papers Cheatsheet for Beginners and Experts - Essential Research Papers for LLMs](./LLM_PAPERS_CHEATSHEET.md)
- [Complete Machine Learning Interview Preparation Guide for Beginners to Experts](./ML_INTERVIEW_PREP.md)

### 💻 Programming Resources
- [Python Programming Language Resources to Learn](./PythonResources.md)

## Table of Contents

| SNo. | Contents |
| ---- | -------- |
| 1. | [FAANG Must Do Problems](#faang-must-do-problems) |
| 2. | [Amazon](#amazon) |
| 3. | [Microsoft](#microsoft) |
| 4. | [Meta (Facebook)](#meta-facebook) |
| 5. | [Google Top 50](#google-top-50) |
| 6. | [Google](#google) |
| 7. | [LinkedIn](#linkedin) |
| 8. | [Flipkart](#flipkart) |
| 9. | [Netflix](#netflix) |
| 10. | [OpenAI](#openai) |
| 11. | [Databricks](#databricks) |
| 12. | [Machine Learning & AI Resources](#resources) |

## 🚀 Quick Start Guide

### 🎯 **Beginner Track** (0-3 months)
- Start with **[Blind 75](./Blind-75.md)** for fundamentals
- Practice 2-3 problems daily focusing on patterns  
- Review [Python Resources](./PythonResources.md) for clean code

### 📈 **Intermediate Track** (1-6 months)  
- Complete **[NeetCode 150](./NeetCode-150.md)** for comprehensive coverage
- Focus on [Recent FAANG Questions](./FAANG-Recent-Questions.md)
- Start [System Design](./SYSTEM_DESIGN_INTERVIEW.md) preparation

### 🎖️ **Advanced Track** (Targeting specific roles)
- Review company-specific sections below
- Practice [ML Interview Questions](./ML_INTERVIEW_PREP.md) for ML roles
- Study [AI/LLM Papers](./LLM_PAPERS_CHEATSHEET.md) for cutting-edge roles

## FAANG Must Do Problems

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |
| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | Medium | O(n) | O(min(m,n)) |
| 3 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | O(n²) | O(1) |
| 4 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | Medium | O(n) | O(1) |
| 5 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) |
| 6 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | Medium | O(n) | O(1) |
| 7 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |
| 8 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | Easy | O(n+m) | O(1) |
| 9 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) |
| 10 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | Medium | O(log n) | O(1) |
| 11 | [Combination Sum](https://leetcode.com/problems/combination-sum) | Medium | O(2ⁿ) | O(n) |
| 12 | [Rotate Image](https://leetcode.com/problems/rotate-image) | Medium | O(n²) | O(1) |
| 13 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | Medium | O(n k log k) | O(n k) |
| 14 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | Easy | O(n) | O(1) |
| 15 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | Medium | O(m×n) | O(1) |
| 16 | [Jump Game](https://leetcode.com/problems/jump-game) | Medium | O(n) | O(1) |
| 17 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | Medium | O(n log n) | O(n) |
| 18 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | O(n) | O(n) |
| 19 | [Unique Paths](https://leetcode.com/problems/unique-paths) | Medium | O(m×n) | O(m×n) |
| 20 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | Easy | O(n) | O(1) |
| 21 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | Medium | O(m×n) | O(1) |
| 22 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(n) | O(k) |
| 23 | [Word Search](https://leetcode.com/problems/word-search) | Medium | O(m×n×4ᵏ) | O(k) |
| 24 | [Decode Ways](https://leetcode.com/problems/decode-ways) | Medium | O(n) | O(n) |
| 25 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | Medium | O(n) | O(h) |
| 26 | [Same Tree](https://leetcode.com/problems/same-tree) | Easy | O(n) | O(h) |
| 27 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | Medium | O(n) | O(n) |
| 28 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | Easy | O(n) | O(h) |
| 29 | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | Medium | O(n) | O(n) |
| 30 | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock) | Easy | O(n) | O(1) |

</details>

## Amazon

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | O(max(m,n)) | O(max(m,n)) |
| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | Medium | O(n) | O(min(m,n)) |
| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | O(log(min(m,n))) | O(1) |
| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | O(n²) | O(1) |
| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | Medium | O(n) | O(n) |
| 7 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Medium | O(n) | O(1) |
| 8 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) or O(n) |
| 9 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Medium | O(4ⁿ) | O(n) |
| 10 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |

</details>

## Microsoft

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |
| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | O(max(m,n)) | O(max(m,n)) |
| 3 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | O(log(min(m,n))) | O(1) |
| 4 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | O(n²) | O(1) |
| 5 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Medium | O(n) | O(1) |
| 6 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | O(n) | O(1) |
| 7 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) or O(n) |
| 8 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |
| 9 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | Easy | O(n+m) | O(1) |
| 10 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) |

</details>

## Meta (Facebook)

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | Hard | O(m×n) | O(m×n) |
| 2 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | O(n) | O(1) |
| 3 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) or O(n) |
| 4 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Medium | O(4ⁿ) | O(n) |
| 5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |
| 6 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) |
| 7 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | Hard | O(n) | O(1) |
| 8 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | Easy | O(n) | O(1) |
| 9 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | Easy | O(n×m) | O(1) |
| 10 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | Medium | O(log n) | O(1) |

</details>

## Google Top 50

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |
| 2 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | O(n) | O(n) |
| 3 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | O(n) | O(n) |
| 4 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(n) | O(k) |
| 5 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | Hard | O(m×n) | O(n) |
| 6 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | Hard | O(n log n) | O(n) |
| 7 | [Maximal Square](https://leetcode.com/problems/maximal-square) | Medium | O(m×n) | O(m×n) |
| 8 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | Hard | O(log n) insert, O(1) find | O(n) |
| 9 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | Medium | O(n) | O(1) |
| 10 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | Hard | O(n log n) | O(n) |

</details>

## Google

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |
| 2 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | O(n) | O(n) |
| 3 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | O(n) | O(n) |
| 4 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(n) | O(k) |
| 5 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | Hard | O(m×n) | O(n) |
| 6 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | Hard | O(n log n) | O(n) |
| 7 | [Maximal Square](https://leetcode.com/problems/maximal-square) | Medium | O(m×n) | O(m×n) |
| 8 | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream) | Hard | O(log n) insert, O(1) find | O(n) |
| 9 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | Medium | O(n) | O(1) |
| 10 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | Hard | O(n log n) | O(n) |

</details>

## LinkedIn

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | Medium | O(n) | O(n) |
| 2 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | Medium | O(n) | O(n) |
| 3 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | Medium | O(n) | O(n) |
| 4 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | Easy | O(n) | O(n) |
| 5 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | Medium | O(n) | O(n) |
| 6 | [Max Stack](https://leetcode.com/problems/max-stack) | Medium | O(n) | O(n) |
| 7 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | Medium | O(n) | O(n) |
| 8 | [All O'one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | Hard | O(1) for each operation | O(n) |
| 9 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | Easy | O(n) | O(1) |
| 10 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | Medium | O(2ⁿ) | O(n) |
| 11 | [Paint House](https://leetcode.com/problems/paint-house) | Medium | O(n) | O(1) |
| 12 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | Hard | O(n×k) | O(n) |
| 13 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | Medium | O(n) | O(n) |
| 14 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | Easy | O(n) | O(1) |
| 15 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | O(n) | O(n) |
| 16 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | Hard | O(n²) | O(n²) |
| 17 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | Medium | O(n) | O(n) |
| 18 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | Hard | O(n²) | O(n) |
| 19 | [Partition to K Equal Sum Subsets](https://leetcode.com/problems/partition-to-k-equal-sum-subsets) | Hard | O(n×2^n) | O(n) |
| 20 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | Medium | O(1) for each operation | O(n) |
| 21 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | Medium | O(m×n) | O(m×n) |
| 22 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | Medium | O(n) | O(n) |
| 23 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | Medium | O(n²) | O(1) |
| 24 | [Valid Number](https://leetcode.com/problems/valid-number) | Medium | O(n) | O(1) |
| 25 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | Medium | O(n) | O(n) |

</details>

## Flipkart

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | O(max(m,n)) | O(max(m,n)) |

</details>

## Netflix

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity |
| --- | ------- | ---------- | --------------- | ---------------- |
| 1 | [LRU Cache](https://leetcode.com/problems/lru-cache) | Medium | O(1) for each operation | O(n) |
| 2 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | Hard | O(n log k) | O(n) |

</details>

## OpenAI

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity | Notes |
| --- | ------- | ---------- | --------------- | ---------------- | ----- |
| 1 | [LRU Cache](https://leetcode.com/problems/lru-cache) | Medium | O(1) | O(capacity) | System design classic |
| 2 | [Time Based Key-Value Store](https://leetcode.com/problems/time-based-key-value-store) | Medium | O(log n) | O(n) | Practical data structure |
| 3 | [Design Search Autocomplete System](https://leetcode.com/problems/design-search-autocomplete-system) | Hard | O(p + q log q) | O(n) | Real-world system |
| 4 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | Medium | O(m) | O(ALPHABET_SIZE×N×M) | NLP applications |
| 5 | [Word Search II](https://leetcode.com/problems/word-search-ii) | Hard | O(m×n×4^s) | O(n) | Advanced trie usage |
| 6 | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree) | Hard | O(n) | O(n) | Data persistence |
| 7 | [Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system) | Hard | O(m + k log k) | O(n) | Unix cd simulation |
| 8 | [LFU Cache](https://leetcode.com/problems/lfu-cache) | Hard | O(1) | O(capacity) | Advanced caching |
| 9 | [Design Twitter](https://leetcode.com/problems/design-twitter) | Medium | O(n log n) | O(n) | Social media system |
| 10 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements) | Medium | O(n log k) | O(n + k) | ML preprocessing |
| 11 | [K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin) | Medium | O(n log k) | O(k) | ML algorithms |
| 12 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) | Distributed systems |
| 13 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | Medium | O(V + E) | O(V + E) | Dependency resolution |
| 14 | [Word Ladder](https://leetcode.com/problems/word-ladder) | Hard | O(M²×N) | O(M²×N) | NLP transformations |
| 15 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(|s| + |t|) | O(|s| + |t|) | String processing |
| 16 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | Medium | O(1) amortized | O(1) | Rate limiting |
| 17 | [Design Log Storage System](https://leetcode.com/problems/design-log-storage-system) | Medium | O(n) | O(n) | System monitoring |
| 18 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) | Code parsing |
| 19 | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix) | Hard | O(m×n) | O(m×n) | DP optimization |
| 20 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | Medium | O(n) | O(1) | ML loss functions |

</details>

## Databricks

<details>
<summary>View Problems</summary>

| No. | Problem | Difficulty | Time Complexity | Space Complexity | Notes |
| --- | ------- | ---------- | --------------- | ---------------- | ----- |
| 1 | [Binary Search](https://leetcode.com/problems/binary-search) | Easy | O(log n) | O(1) | Core algorithm |
| 2 | [Search Insert Position](https://leetcode.com/problems/search-insert-position) | Easy | O(log n) | O(1) | Binary search variant |
| 3 | [Find Peak Element](https://leetcode.com/problems/find-peak-element) | Medium | O(log n) | O(1) | Binary search on unsorted |
| 4 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | Medium | O(log n) | O(1) | Modified binary search |
| 5 | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array) | Medium | O(log n) | O(1) | Rotation point |
| 6 | [Search a 2D Matrix](https://leetcode.com/problems/search-a-2d-matrix) | Medium | O(log(m*n)) | O(1) | 2D binary search |
| 7 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | O(log(min(m,n))) | O(1) | Advanced binary search |
| 8 | [Shortest Path in Binary Matrix](https://leetcode.com/problems/shortest-path-in-binary-matrix) | Medium | O(n²) | O(n²) | BFS shortest path |
| 9 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | Medium | O(m×n) | O(m×n) | DFS/BFS |
| 10 | [Word Ladder](https://leetcode.com/problems/word-ladder) | Hard | O(M²×N) | O(M²×N) | BFS word transformation |
| 11 | [Course Schedule](https://leetcode.com/problems/course-schedule) | Medium | O(V+E) | O(V+E) | Topological sort |
| 12 | [Course Schedule II](https://leetcode.com/problems/course-schedule-ii) | Medium | O(V+E) | O(V+E) | Topological ordering |
| 13 | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary) | Hard | O(C) | O(1) | Topological sort |
| 14 | [Valid IP Addresses](https://leetcode.com/problems/restore-ip-addresses) | Medium | O(3^4) | O(1) | IP validation |
| 15 | [LRU Cache](https://leetcode.com/problems/lru-cache) | Medium | O(1) | O(capacity) | Data structure design |
| 16 | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree) | Medium | O(m) | O(26×N×M) | Trie data structure |
| 17 | [Design Hit Counter](https://leetcode.com/problems/design-hit-counter) | Medium | O(1) amortized | O(1) | Time series design |
| 18 | [Logger Rate Limiter](https://leetcode.com/problems/logger-rate-limiter) | Easy | O(1) | O(M) | Rate limiting |
| 19 | [Print in Order](https://leetcode.com/problems/print-in-order) | Easy | O(1) | O(1) | Concurrency |
| 20 | [Print FooBar Alternately](https://leetcode.com/problems/print-foobar-alternately) | Medium | O(n) | O(1) | Concurrency/Threading |

</details>

---

## About This Repository

**The ultimate collection for technical interview success!** This repository provides comprehensive coverage of:

- **400+ Curated Problems** across 15+ top tech companies
- **NeetCode 150** & **Blind 75** - Industry-standard problem sets
- **Latest 2025 Questions** from FAANG and emerging companies  
- **System Design** interview preparation
- **AI/ML Resources** for specialized roles

Perfect for FAANG, unicorns, and top tech interviews!

## System Design Interview Questions

📚 **[Complete System Design Interview Guide](SYSTEM_DESIGN_INTERVIEW.md)** - Top 25 system design problems with complexity ratings and company tags.

## Contributing

Contributions are welcome! Please feel free to submit a pull request.

## Connect With Me

If you found this repository helpful, please consider following me:

- **GitHub**: [@ombharatiya](https://github.com/ombharatiya)
- **Twitter**: [@ombharatiya](https://twitter.com/ombharatiya)
- **LinkedIn**: [ombharatiya](https://linkedin.com/in/ombharatiya)

I regularly share tech interview preparation resources, coding tips, and career advice for developers aiming for top tech companies. Your support means a lot! ⭐

<div align="center">
  
### If you found this resource helpful, give it a ⭐ and share it with others!

</div>

## License

This project is licensed under the GPL-3.0 license - see the [LICENSE](LICENSE) file for details.

FAANG-Coding-Interview-Questions

FAANG-Coding-Interview-Questions Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

FAANG-Coding-Interview-Questions

FAANG-Coding-Interview-Questions Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README