{"id":13500995,"url":"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions","last_synced_at":"2025-03-29T07:32:16.167Z","repository":{"id":37395887,"uuid":"307782839","full_name":"ombharatiya/FAANG-Coding-Interview-Questions","owner":"ombharatiya","description":"A curated List of Coding Questions Asked in FAANG Interviews","archived":false,"fork":false,"pushed_at":"2025-03-18T23:24:37.000Z","size":233,"stargazers_count":2903,"open_issues_count":14,"forks_count":812,"subscribers_count":52,"default_branch":"main","last_synced_at":"2025-03-18T23:28:06.343Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","codechef","coding","coding-interviews","cpp","data-structures","hacktoberfest","interview","interview-questions","interviewbit","java","leetcode","python"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/ombharatiya.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2020-10-27T17:48:27.000Z","updated_at":"2025-03-18T23:24:41.000Z","dependencies_parsed_at":"2022-07-13T10:50:33.411Z","dependency_job_id":null,"html_url":"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ombharatiya%2FFAANG-Coding-Interview-Questions","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ombharatiya%2FFAANG-Coding-Interview-Questions/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ombharatiya%2FFAANG-Coding-Interview-Questions/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ombharatiya%2FFAANG-Coding-Interview-Questions/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ombharatiya","download_url":"https://codeload.github.com/ombharatiya/FAANG-Coding-Interview-Questions/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246155998,"owners_count":20732355,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","algorithms-and-data-structures","codechef","coding","coding-interviews","cpp","data-structures","hacktoberfest","interview","interview-questions","interviewbit","java","leetcode","python"],"created_at":"2024-07-31T22:01:21.902Z","updated_at":"2025-03-29T07:32:16.157Z","avatar_url":"https://github.com/ombharatiya.png","language":null,"readme":"# FAANG Coding Interview Preparation\n\n\u003cdiv align=\"center\"\u003e\n  \u003ca href=\"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/🚀%20FAANG%20Interview%20Prep-000000?style=for-the-badge\" alt=\"FAANG Interview Prep\" /\u003e\n  \u003c/a\u003e\n  \n  \u003cp\u003e\u003c/p\u003e\n  \n  \u003ca href=\"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions/stargazers\"\u003e\n    \u003cimg src=\"https://img.shields.io/github/stars/ombharatiya/FAANG-Coding-Interview-Questions?style=for-the-badge\u0026color=yellow\" alt=\"GitHub stars\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions/network/members\"\u003e\n    \u003cimg src=\"https://img.shields.io/github/forks/ombharatiya/FAANG-Coding-Interview-Questions?style=for-the-badge\u0026color=orange\" alt=\"GitHub forks\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions/watchers\"\u003e\n    \u003cimg src=\"https://img.shields.io/github/watchers/ombharatiya/FAANG-Coding-Interview-Questions?style=for-the-badge\u0026color=blue\" alt=\"GitHub watchers\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://github.com/ombharatiya\"\u003e\n    \u003cimg src=\"https://img.shields.io/github/followers/ombharatiya?label=Follow%20%40ombharatiya\u0026style=for-the-badge\u0026color=brightgreen\" alt=\"GitHub followers\" /\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://twitter.com/ombharatiya\"\u003e\n    \u003cimg src=\"https://img.shields.io/twitter/follow/ombharatiya?style=for-the-badge\u0026color=1DA1F2\u0026logo=twitter\" alt=\"Twitter Follow\" /\u003e\n  \u003c/a\u003e\n\u003c/div\u003e\n\n\u003cdiv align=\"center\"\u003e\n  \u003cp\u003e\u003cem\u003eYour 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.\u003c/em\u003e\u003c/p\u003e\n  \n  \u003cp\u003e\n    \u003ca href=\"https://github.com/ombharatiya/FAANG-Coding-Interview-Questions/stargazers\"\u003e\n      \u003cimg src=\"https://img.shields.io/badge/⭐%20STAR%20THIS%20REPO-yellow?style=for-the-badge\" alt=\"Star This Repo\" /\u003e\n    \u003c/a\u003e\n    \u003ca href=\"https://github.com/ombharatiya?tab=followers\"\u003e\n      \u003cimg src=\"https://img.shields.io/badge/👨‍💻%20FOLLOW%20@OMBHARATIYA-39D353?style=for-the-badge\" alt=\"Follow @ombharatiya\" /\u003e\n    \u003c/a\u003e\n  \u003c/p\u003e\n\n  \u003ch3\u003e🚨 NEW: Check out \u003ca href=\"./SYSTEM_DESIGN_INTERVIEW.md\"\u003eSystem Design Interview Guide\u003c/a\u003e and \u003ca href=\"./FAANG-Recent-Questions.md\"\u003eMost Recently Asked FAANG Questions\u003c/a\u003e including OpenAI and Tesla! 🚨\u003c/h3\u003e\n  \n  \u003cp\u003e\u003ci\u003eA curated collection of coding and system design questions asked at top tech companies. Helping you ace your next interview!\u003c/i\u003e\u003c/p\u003e\n\u003c/div\u003e\n\n## Resources\n\n- [Top 75 LeetCode Questions to Crack The Coding Interviews](./TopLeetCodeProblems.md)\n- [Python Programming Language Resources to Learn](./PythonResources.md)\n- [Most Recently Asked Questions at FAANG and other top companies](./FAANG-Recent-Questions.md)\n- [System Design Interview Guide](./SYSTEM_DESIGN_INTERVIEW.md)\n- [LLM Papers Cheatsheet for Beginners and Experts - Essential Research Papers for LLMs](./LLM_PAPERS_CHEATSHEET.md)\n- [Complete Machine Learning Interview Preparation Guide for Beginners to Experts](./ML_INTERVIEW_PREP.md)\n\n## Table of Contents\n\n| SNo. | Contents |\n| ---- | -------- |\n| 1. | [FAANG Must Do Problems](#faang-must-do-problems) |\n| 2. | [Amazon](#amazon) |\n| 3. | [Microsoft](#microsoft) |\n| 4. | [Facebook](#facebook) |\n| 5. | [Google Top 50](#google-top-50) |\n| 6. | [Google](#google) |\n| 7. | [LinkedIn](#linkedin) |\n| 8. | [Flipkart](#flipkart) |\n| 9. | [Netflix](#netflix) |\n| 10. | [Machine Learning \u0026 AI Resources](#resources) |\n\n## FAANG Must Do Problems\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |\n| 2 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | Medium | O(n) | O(min(m,n)) |\n| 3 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | O(n²) | O(1) |\n| 4 | [Container With Most Water](https://leetcode.com/problems/container-with-most-water) | Medium | O(n) | O(1) |\n| 5 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) |\n| 6 | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list) | Medium | O(n) | O(1) |\n| 7 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |\n| 8 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | Easy | O(n+m) | O(1) |\n| 9 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) |\n| 10 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | Medium | O(log n) | O(1) |\n| 11 | [Combination Sum](https://leetcode.com/problems/combination-sum) | Medium | O(2ⁿ) | O(n) |\n| 12 | [Rotate Image](https://leetcode.com/problems/rotate-image) | Medium | O(n²) | O(1) |\n| 13 | [Group Anagrams](https://leetcode.com/problems/group-anagrams) | Medium | O(n k log k) | O(n k) |\n| 14 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray) | Easy | O(n) | O(1) |\n| 15 | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix) | Medium | O(m×n) | O(1) |\n| 16 | [Jump Game](https://leetcode.com/problems/jump-game) | Medium | O(n) | O(1) |\n| 17 | [Merge Intervals](https://leetcode.com/problems/merge-intervals) | Medium | O(n log n) | O(n) |\n| 18 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | O(n) | O(n) |\n| 19 | [Unique Paths](https://leetcode.com/problems/unique-paths) | Medium | O(m×n) | O(m×n) |\n| 20 | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs) | Easy | O(n) | O(1) |\n| 21 | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes) | Medium | O(m×n) | O(1) |\n| 22 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(n) | O(k) |\n| 23 | [Word Search](https://leetcode.com/problems/word-search) | Medium | O(m×n×4ᵏ) | O(k) |\n| 24 | [Decode Ways](https://leetcode.com/problems/decode-ways) | Medium | O(n) | O(n) |\n| 25 | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree) | Medium | O(n) | O(h) |\n| 26 | [Same Tree](https://leetcode.com/problems/same-tree) | Easy | O(n) | O(h) |\n| 27 | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal) | Medium | O(n) | O(n) |\n| 28 | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree) | Easy | O(n) | O(h) |\n| 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) |\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) |\n\n\u003c/details\u003e\n\n## Amazon\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | O(max(m,n)) | O(max(m,n)) |\n| 3 | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters) | Medium | O(n) | O(min(m,n)) |\n| 4 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | O(log(min(m,n))) | O(1) |\n| 5 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | O(n²) | O(1) |\n| 6 | [ZigZag Conversion](https://leetcode.com/problems/zigzag-conversion) | Medium | O(n) | O(n) |\n| 7 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Medium | O(n) | O(1) |\n| 8 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) or O(n) |\n| 9 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Medium | O(4ⁿ) | O(n) |\n| 10 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |\n\n\u003c/details\u003e\n\n## Microsoft\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |\n| 2 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | O(max(m,n)) | O(max(m,n)) |\n| 3 | [Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays) | Hard | O(log(min(m,n))) | O(1) |\n| 4 | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring) | Medium | O(n²) | O(1) |\n| 5 | [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi) | Medium | O(n) | O(1) |\n| 6 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | O(n) | O(1) |\n| 7 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) or O(n) |\n| 8 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |\n| 9 | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists) | Easy | O(n+m) | O(1) |\n| 10 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) |\n\n\u003c/details\u003e\n\n## Facebook\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Regular Expression Matching](https://leetcode.com/problems/regular-expression-matching) | Hard | O(m×n) | O(m×n) |\n| 2 | [Roman to Integer](https://leetcode.com/problems/roman-to-integer) | Easy | O(n) | O(1) |\n| 3 | [3Sum](https://leetcode.com/problems/3sum) | Medium | O(n²) | O(1) or O(n) |\n| 4 | [Letter Combinations of a Phone Number](https://leetcode.com/problems/letter-combinations-of-a-phone-number) | Medium | O(4ⁿ) | O(n) |\n| 5 | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses) | Easy | O(n) | O(n) |\n| 6 | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists) | Hard | O(n log k) | O(1) |\n| 7 | [Reverse Nodes in k-Group](https://leetcode.com/problems/reverse-nodes-in-k-group) | Hard | O(n) | O(1) |\n| 8 | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array) | Easy | O(n) | O(1) |\n| 9 | [Implement strStr()](https://leetcode.com/problems/implement-strstr) | Easy | O(n×m) | O(1) |\n| 10 | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array) | Medium | O(log n) | O(1) |\n\n\u003c/details\u003e\n\n## Google Top 50\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |\n| 2 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | O(n) | O(n) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | O(n) | O(n) |\n| 4 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(n) | O(k) |\n| 5 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | Hard | O(m×n) | O(n) |\n| 6 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | Hard | O(n log n) | O(n) |\n| 7 | [Maximal Square](https://leetcode.com/problems/maximal-square) | Medium | O(m×n) | O(m×n) |\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) |\n| 9 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | Medium | O(n) | O(1) |\n| 10 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | Hard | O(n log n) | O(n) |\n\n\u003c/details\u003e\n\n## Google\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Two Sum](https://leetcode.com/problems/two-sum) | Easy | O(n) | O(n) |\n| 2 | [Insert Interval](https://leetcode.com/problems/insert-interval) | Medium | O(n) | O(n) |\n| 3 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | O(n) | O(n) |\n| 4 | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring) | Hard | O(n) | O(k) |\n| 5 | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle) | Hard | O(m×n) | O(n) |\n| 6 | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem) | Hard | O(n log n) | O(n) |\n| 7 | [Maximal Square](https://leetcode.com/problems/maximal-square) | Medium | O(m×n) | O(m×n) |\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) |\n| 9 | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows) | Medium | O(n) | O(1) |\n| 10 | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self) | Hard | O(n log n) | O(n) |\n\n\u003c/details\u003e\n\n## LinkedIn\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Nested List Weight Sum II](https://leetcode.com/problems/nested-list-weight-sum-ii) | Medium | O(n) | O(n) |\n| 2 | [Shortest Word Distance II](https://leetcode.com/problems/shortest-word-distance-ii) | Medium | O(n) | O(n) |\n| 3 | [Closest Binary Search Tree Value II](https://leetcode.com/problems/closest-binary-search-tree-value-ii) | Medium | O(n) | O(n) |\n| 4 | [Two Sum III - Data structure design](https://leetcode.com/problems/two-sum-iii-data-structure-design) | Easy | O(n) | O(n) |\n| 5 | [Nested List Weight Sum](https://leetcode.com/problems/nested-list-weight-sum) | Medium | O(n) | O(n) |\n| 6 | [Max Stack](https://leetcode.com/problems/max-stack) | Medium | O(n) | O(n) |\n| 7 | [Find Leaves of Binary Tree](https://leetcode.com/problems/find-leaves-of-binary-tree) | Medium | O(n) | O(n) |\n| 8 | [All O'one Data Structure](https://leetcode.com/problems/all-oone-data-structure) | Hard | O(1) for each operation | O(n) |\n| 9 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | Easy | O(n) | O(1) |\n| 10 | [Factor Combinations](https://leetcode.com/problems/factor-combinations) | Medium | O(2ⁿ) | O(n) |\n| 11 | [Paint House](https://leetcode.com/problems/paint-house) | Medium | O(n) | O(1) |\n| 12 | [Paint House II](https://leetcode.com/problems/paint-house-ii) | Hard | O(n×k) | O(n) |\n| 13 | [Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation) | Medium | O(n) | O(n) |\n| 14 | [Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance) | Easy | O(n) | O(1) |\n| 15 | [Text Justification](https://leetcode.com/problems/text-justification) | Hard | O(n) | O(n) |\n| 16 | [Count Different Palindromic Subsequences](https://leetcode.com/problems/count-different-palindromic-subsequences) | Hard | O(n²) | O(n²) |\n| 17 | [Binary Tree Upside Down](https://leetcode.com/problems/binary-tree-upside-down) | Medium | O(n) | O(n) |\n| 18 | [Max Points on a Line](https://leetcode.com/problems/max-points-on-a-line) | Hard | O(n²) | O(n) |\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) |\n| 20 | [Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1) | Medium | O(1) for each operation | O(n) |\n| 21 | [Number of Islands](https://leetcode.com/problems/number-of-islands) | Medium | O(m×n) | O(m×n) |\n| 22 | [Exclusive Time of Functions](https://leetcode.com/problems/exclusive-time-of-functions) | Medium | O(n) | O(n) |\n| 23 | [Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number) | Medium | O(n²) | O(1) |\n| 24 | [Valid Number](https://leetcode.com/problems/valid-number) | Medium | O(n) | O(1) |\n| 25 | [Repeated DNA Sequences](https://leetcode.com/problems/repeated-dna-sequences) | Medium | O(n) | O(n) |\n\n\u003c/details\u003e\n\n## Flipkart\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [Add Two Numbers](https://leetcode.com/problems/add-two-numbers) | Medium | O(max(m,n)) | O(max(m,n)) |\n\n\u003c/details\u003e\n\n## Netflix\n\n\u003cdetails\u003e\n\u003csummary\u003eView Problems\u003c/summary\u003e\n\n| No. | Problem | Difficulty | Time Complexity | Space Complexity |\n| --- | ------- | ---------- | --------------- | ---------------- |\n| 1 | [LRU Cache](https://leetcode.com/problems/lru-cache) | Medium | O(1) for each operation | O(n) |\n| 2 | [Department Top Three Salaries](https://leetcode.com/problems/department-top-three-salaries) | Hard | O(n log k) | O(n) |\n\n\u003c/details\u003e\n\n---\n\n## About\n\nA curated list of coding questions asked in FAANG, OpenAI, Tesla, and other top tech company interviews. This repository aims to help you prepare effectively for technical interviews.\n\n## System Design Interview Questions\n\nLooking for system design interview questions? Check out our comprehensive guide:\n\n[System Design Interview Guide](SYSTEM_DESIGN_INTERVIEW.md) - A curated list of the top 25 must-do system design problems for tech interviews with complexity ratings and company-specific information.\n\n## Contributing\n\nContributions are welcome! Please feel free to submit a pull request.\n\n## Connect With Me\n\nIf you found this repository helpful, please consider following me:\n\n- **GitHub**: [@ombharatiya](https://github.com/ombharatiya)\n- **Twitter**: [@ombharatiya](https://twitter.com/ombharatiya)\n- **LinkedIn**: [ombharatiya](https://linkedin.com/in/ombharatiya)\n\nI regularly share tech interview preparation resources, coding tips, and career advice for developers aiming for top tech companies. Your support means a lot! ⭐\n\n\u003cdiv align=\"center\"\u003e\n  \n### If you found this resource helpful, give it a ⭐ and share it with others!\n\n\u003c/div\u003e\n\n## License\n\nThis project is licensed under the GPL-3.0 license - see the [LICENSE](LICENSE) file for details.\n","funding_links":[],"categories":["Others","Uncategorized","blogs \u0026 books"],"sub_categories":["Uncategorized","Also Checkout"],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fombharatiya%2FFAANG-Coding-Interview-Questions","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fombharatiya%2FFAANG-Coding-Interview-Questions","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fombharatiya%2FFAANG-Coding-Interview-Questions/lists"}