Meta Coding Interview Questions | Design Gurus

Meta

DesignGurus · 45 questions

Practice Progress: 0/45 solved (0.0%)

Easy 0/10 Med. 0/25 Hard 0/10

Difficulty

# Title Acceptance Difficulty
1 Toeplitz Matrix (easy) 55.3% easy
2 Remove All Adjacent Duplicates In String (easy) 58.6% easy
3 Minimum Depth of a Binary Tree (easy) 21.5% easy
4 Tree Diameter (easy) 59.3% easy
5 Hidden Document 27.3% easy
6 Hidden Document 76.3% easy
7 Hidden Document 75.4% easy
8 Hidden Document 45.5% easy
9 Hidden Document 86.0% easy
10 Hidden Document 72.1% easy
11 Diagonal Traverse (medium) 38.1% Med.
12 Shortest Path in Binary Matrix (medium) 53.8% Med.
13 Maximum Swap (medium) 42.8% Med.
14 Custom Sort String (medium) 60.6% Med.
15 Binary Tree Vertical Order Traversal (medium) 82.6% Med.
16 Buildings With an Ocean View (medium) 62.8% Med.
17 Hidden Document 43.2% Med.
18 Hidden Document 71.3% Med.
19 Hidden Document 81.1% Med.
20 Hidden Document 56.5% Med.
21 Hidden Document 45.2% Med.
22 Hidden Document 41.5% Med.
23 Hidden Document 25.2% Med.
24 Hidden Document 37.5% Med.
25 Hidden Document 25.0% Med.
26 Hidden Document 69.0% Med.
27 Hidden Document 31.3% Med.
28 Hidden Document 76.3% Med.
29 Hidden Document 49.3% Med.
30 Hidden Document 46.4% Med.
31 Hidden Document 45.6% Med.
32 Hidden Document 64.0% Med.
33 Hidden Document 65.7% Med.
34 Hidden Document 85.7% Med.
35 Hidden Document 50.2% Med.
36 Sliding Window Median (hard) 32.2% hard
37 Alien Dictionary (hard) 45.7% hard
38 Minimum Window Substring (hard) 59.8% hard
39 Best Meeting Point (hard) 50.8% hard
40 Hidden Document 50.0% hard
41 Hidden Document 43.6% hard
42 Hidden Document 71.0% hard
43 Hidden Document 82.6% hard
44 Hidden Document 69.7% hard
45 Hidden Document 52.1% hard