{"id":29437787,"url":"https://github.com/alefmemtav/preparing-for-bigtech-interviews","last_synced_at":"2025-08-30T09:39:04.581Z","repository":{"id":177963537,"uuid":"661157561","full_name":"AlefMemTav/preparing-for-bigtech-interviews","owner":"AlefMemTav","description":"Preparing for interviews at big tech companies","archived":false,"fork":false,"pushed_at":"2025-06-30T21:21:32.000Z","size":62,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-08-30T09:39:03.877Z","etag":null,"topics":["amazon","apple","google","interview","interview-preparation","interview-questions","meta","uber"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/AlefMemTav.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2023-07-02T01:11:17.000Z","updated_at":"2025-07-07T21:21:03.000Z","dependencies_parsed_at":null,"dependency_job_id":"5d1ba655-6504-40cd-a2e4-a29c6f4531cb","html_url":"https://github.com/AlefMemTav/preparing-for-bigtech-interviews","commit_stats":null,"previous_names":["alefmemtav/study-for-google-and-meta-interview","alefmemtav/preparing-for-google-meta-amazon-interview","alefmemtav/preparing-for-bigtech-interviews","alefmemtav/preparing-for-google-and-meta-interview"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/AlefMemTav/preparing-for-bigtech-interviews","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlefMemTav%2Fpreparing-for-bigtech-interviews","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlefMemTav%2Fpreparing-for-bigtech-interviews/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlefMemTav%2Fpreparing-for-bigtech-interviews/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlefMemTav%2Fpreparing-for-bigtech-interviews/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/AlefMemTav","download_url":"https://codeload.github.com/AlefMemTav/preparing-for-bigtech-interviews/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/AlefMemTav%2Fpreparing-for-bigtech-interviews/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":272833293,"owners_count":25000870,"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","status":"online","status_checked_at":"2025-08-30T02:00:09.474Z","response_time":77,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["amazon","apple","google","interview","interview-preparation","interview-questions","meta","uber"],"created_at":"2025-07-13T07:06:33.295Z","updated_at":"2025-08-30T09:39:04.572Z","avatar_url":"https://github.com/AlefMemTav.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 👨‍🎓📚💪💻 Preparing for Google, Meta, Amazon interviews\nMost Leetcode exercises (Top 150), especially: Arrays, Strings, HashMap, Trees, Graphs, Dynamic Programming\n\n## Arrays\n### Easy\n1. Merge two sorted arrays [(Solution)](arrays/MergeTwoSortedArrays)\n2. Remove duplicates from an array [(Solution)](arrays/RemoveDuplicatesFromAnArray)\n3. Count the frequency of an element in an array [(Solution)](arrays/CountTheFrequencyOfAnElementInAnArray/)\n4. Two sum [(Solution)](arrays/TwoSum/) #1\n5. Find the minimum (or maximum) element of an array\n6. Remove duplicates from sorted array\n7. Remove element in-place\n8. Search Insert Position\n9. Maximum Subarray\n10. Plus One\n11. Convert Sorted Array to Binary Search Tree (Arrays/Binary Trees)\n12. Single Number\n13. Count Primes\n14. Contains Duplicate\n15. Third Largest Number\n16. Count Odd Even\n    \n### Medium\n1. Move all zeros to the beginning/end of an array\n2. Find if a given element is in a sorted array (binary search)\n3. Rotate an array\n4. Largest sum of non-adjacent numbers (Dynamic Programming) [(Solution)](arrays/LargestSumOfNon-adjacentNumbers/)\n5. A Product Array Puzzle\n6. Maximum Product Subarray (Dynamic programming)\n7. Shortest Unsorted Continuous Subarray\n8. Maximum sum of hour glass in matrix\n9. Paint House (Dynamic programming)\n10. Minimum number of jumps to reach end\n11. Find duplicates in O(n) time and O(1) extra space\n12. Find three numbers with the maximum product\n13. Maximum Sum Circular Subarray\n14. Minimum number of swaps to sort an array\n\n### Hard\n1. Rotate a 2D array\n2. Create change with coins (dynamic programming\n3. Sliding window maximum\n4. Find the smallest positive number missing from an unsorted array\n5. Find the missing number in unordered Arithmetic Progression\n6. Find the maximum j – i such that arr[j] \u003e arr[i] (Distance maximising problem)\n7. Array manipulation\n8. Median of Two Sorted Arrays\n9. Sudoku Solver\n10. Largest Rectangle in Histogram\n11. Maximal Rectangle in binary matrix\n12. Find Minimum in Rotated Sorted Array\n13. Count of Smaller Numbers After Self\n14. Palindrome Pairs\n15. Sort an array containing 0’s, 1’s and 2’s\n16. Longest increasing subsequence\n17. Trapping Rain Water\n\n## Strings\n### Easy\n1. Remove Vowels from a String [(Solution)](strings/RemoveVowelsFromAString)\n2. Defanging an IP Address\n3. Jewels and Stones\n4. Shuffle String\n5. Split a String in Balanced Strings\n6. To Lower Case\n7. Unique Morse Code Words\n8. Count Substrings with Only One Distinct Letter\n9. Robot Return to Origin\n10. Fizz Buzz\n11. First Unique Character in a String\n12. Reverse String\n13. Valid Anagram\n14. Valid Palindrome\n15. Implement Strstr()\n16. Valid Parentheses\n17. Roman to Integer\n18. Longest Common Prefix\n19. Excel Sheet Column Number\n20. Palindrome Permutation\n    \n### Medium\n1. Longest Substring Without Repeating Characters\n2. Longest Palindromic Substring\n3. String to Integer (atoi)\n4. Letter Combinations of a Phone Number\n5. Generate Parentheses\n6. Count and Say\n7. Group Anagrams\n8. Decode Ways\n9. Palindrome Partitioning\n10. Word Break\n11. Fraction to Recurring Decimal\n12. Largest Number\n13. Implement Trie (Prefix Tree)\n14. Basic Calculator II\n15. Longest Substring with At Least K Repeating Characters\n16. Palindrome Partitioning\n17. Reorganize String\n18. ZigZag Conversion\n19. Decode String\n20. Multiply Strings\n\n### Hard\n1. Regular Expression Matching\n2. Wildcard Matching\n3. Minimum Window Substring\n4. Word Ladder\n5. Word Break II\n6. Word Search II\n7. Serialize and Deserialize Binary Tree\n8. Longest Valid Parentheses\n9. Edit Distance\n10. Alien Dictionary (string/graph)\n11. Design Search Autocomplete System\n\n\n## Lists\n### Medium\n1. Add Two Numbers [(Solution)](lists/addTwoNumbers) #2\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falefmemtav%2Fpreparing-for-bigtech-interviews","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Falefmemtav%2Fpreparing-for-bigtech-interviews","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Falefmemtav%2Fpreparing-for-bigtech-interviews/lists"}