https://github.com/alefmemtav/preparing-for-bigtech-interviews

Preparing for interviews at big tech companies
https://github.com/alefmemtav/preparing-for-bigtech-interviews

amazon apple google interview interview-preparation interview-questions meta uber

Last synced: 10 months ago
JSON representation

Preparing for interviews at big tech companies

• Host: GitHub
• URL: https://github.com/alefmemtav/preparing-for-bigtech-interviews
• Owner: AlefMemTav
• Created: 2023-07-02T01:11:17.000Z (almost 3 years ago)
• Default Branch: master
• Last Pushed: 2025-06-30T21:21:32.000Z (12 months ago)
• Last Synced: 2025-08-30T09:39:03.877Z (10 months ago)
• Topics: amazon, apple, google, interview, interview-preparation, interview-questions, meta, uber
• Language: C
• Homepage:
• Size: 60.5 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# 👨‍🎓📚💪💻 Preparing for Google, Meta, Amazon interviews

Most Leetcode exercises (Top 150), especially: Arrays, Strings, HashMap, Trees, Graphs, Dynamic Programming

## Arrays

### Easy

1. Merge two sorted arrays [(Solution)](arrays/MergeTwoSortedArrays)

2. Remove duplicates from an array [(Solution)](arrays/RemoveDuplicatesFromAnArray)

3. Count the frequency of an element in an array [(Solution)](arrays/CountTheFrequencyOfAnElementInAnArray/)

4. Two sum [(Solution)](arrays/TwoSum/) #1

5. Find the minimum (or maximum) element of an array

6. Remove duplicates from sorted array

7. Remove element in-place

8. Search Insert Position

9. Maximum Subarray

10. Plus One

11. Convert Sorted Array to Binary Search Tree (Arrays/Binary Trees)

12. Single Number

13. Count Primes

14. Contains Duplicate

15. Third Largest Number

16. Count Odd Even

    

### Medium

1. Move all zeros to the beginning/end of an array

2. Find if a given element is in a sorted array (binary search)

3. Rotate an array

4. Largest sum of non-adjacent numbers (Dynamic Programming) [(Solution)](arrays/LargestSumOfNon-adjacentNumbers/)

5. A Product Array Puzzle

6. Maximum Product Subarray (Dynamic programming)

7. Shortest Unsorted Continuous Subarray

8. Maximum sum of hour glass in matrix

9. Paint House (Dynamic programming)

10. Minimum number of jumps to reach end

11. Find duplicates in O(n) time and O(1) extra space

12. Find three numbers with the maximum product

13. Maximum Sum Circular Subarray

14. Minimum number of swaps to sort an array

### Hard

1. Rotate a 2D array

2. Create change with coins (dynamic programming

3. Sliding window maximum

4. Find the smallest positive number missing from an unsorted array

5. Find the missing number in unordered Arithmetic Progression

6. Find the maximum j – i such that arr[j] > arr[i] (Distance maximising problem)

7. Array manipulation

8. Median of Two Sorted Arrays

9. Sudoku Solver

10. Largest Rectangle in Histogram

11. Maximal Rectangle in binary matrix

12. Find Minimum in Rotated Sorted Array

13. Count of Smaller Numbers After Self

14. Palindrome Pairs

15. Sort an array containing 0’s, 1’s and 2’s

16. Longest increasing subsequence

17. Trapping Rain Water

## Strings

### Easy

1. Remove Vowels from a String [(Solution)](strings/RemoveVowelsFromAString)

2. Defanging an IP Address

3. Jewels and Stones

4. Shuffle String

5. Split a String in Balanced Strings

6. To Lower Case

7. Unique Morse Code Words

8. Count Substrings with Only One Distinct Letter

9. Robot Return to Origin

10. Fizz Buzz

11. First Unique Character in a String

12. Reverse String

13. Valid Anagram

14. Valid Palindrome

15. Implement Strstr()

16. Valid Parentheses

17. Roman to Integer

18. Longest Common Prefix

19. Excel Sheet Column Number

20. Palindrome Permutation

    

### Medium

1. Longest Substring Without Repeating Characters

2. Longest Palindromic Substring

3. String to Integer (atoi)

4. Letter Combinations of a Phone Number

5. Generate Parentheses

6. Count and Say

7. Group Anagrams

8. Decode Ways

9. Palindrome Partitioning

10. Word Break

11. Fraction to Recurring Decimal

12. Largest Number

13. Implement Trie (Prefix Tree)

14. Basic Calculator II

15. Longest Substring with At Least K Repeating Characters

16. Palindrome Partitioning

17. Reorganize String

18. ZigZag Conversion

19. Decode String

20. Multiply Strings

### Hard

1. Regular Expression Matching

2. Wildcard Matching

3. Minimum Window Substring

4. Word Ladder

5. Word Break II

6. Word Search II

7. Serialize and Deserialize Binary Tree

8. Longest Valid Parentheses

9. Edit Distance

10. Alien Dictionary (string/graph)

11. Design Search Autocomplete System

## Lists

### Medium

1. Add Two Numbers [(Solution)](lists/addTwoNumbers) #2