- Published on
Meta New Grad SWE full loop/onsite
- Author
- Shared Anonymously
I recently completed the full loop/onsite. I was able to go directly to the last round because I've had prior internship experience with Meta. I havent gotten the results but I'll update when I do.
Questions asked:
- Clone Graph but return the overall graph and not a node(you design the Node and graph classes too)
- Top K most frequent elements
- Merge 3 sorted arrays (with no duplicates in final array)
- a version of Simplify Path where you are given two strings. The first is the current directory path. The second is the path changes to get to a desired directory (could be the same as the currently in). return the resulting file path. You dont have to worry about // or ///. There are only " /" , " . ", "..", and directory names within the change directory string.
I wrote the most optimal solution for all of them (albiet the answer for merge 3 sorted was very clunky). In terms of studying I did almost all the green and orange colored questions of the Facebook tagged when sorted by freq in last 6 months-- skipping the hard-- (so the top 43). I also did a couple of the blues that were mentioned repeatedly here in the discusion. Because of this I had experience with 3/4 questions asked because I practiced that exact question or something very similar.
I did do 22 questions of the neetcode 150 but I think that was unneccesary.