Google:
Phone screen 1: This guy's round 1 https://leetcode.com/discuss/interview-question/930843/google-l3-onsite/767505
Phone screen 2: This guy's round 5 https://leetcode.com/discuss/interview-experience/229559/Google-Onsite-interview-questions-SDE-5-rounds
Phone screen 3: https://leetcode.com/problems/design-hashmap/ and https://leetcode.com/discuss/interview-question/356433/Google-or-OA-2018-or-Min-Abs-Difference-of-Server-Loads/322626

If you can pass google internship interview, you can pass their FTE interview lol.

Amazon:
Phone screen 1: Given two BSTs, find the largest value that each of them share.
E.g

   3                   4
 /   \                / \
1     4              3   5

returns 4

Apple:
Phone screen 1: https://leetcode.com/problems/valid-anagram/ (dont remember follow up but it was something silly)
Phone screen 2: https://leetcode.com/problems/lru-cache (follow up being discussing, not implementing, LFU)

Dropbox:
Phone screen 1: Given a directory tree, and a set of directly accessible files, and the notion that all subdirectries of directly accessible files are accessible, write a function isAccessible to determine if there exists access, either direct or indirect, to a passed in directory.

e.g given

       A
	  / \
	 B   C
	     |
		 D
	    / \ 
	   E   F

and accessible = { B, D }

isAccessible(F) should return true

Phone screen 2: https://leetcode.com/problems/game-of-life/ (With follow up being what if you can't fit entire gameboard in memory)

I accepted offers to 2 big names who aren't on this list, whose questions I won't share because I actually care about their NDA, but I'll say the questions were all listed in the top 50 most common for each of their respective company pages on this site. I'd like to thank this community for helping me prepare. Best of luck boys and girls, we're all gonna make it.