Meta Coding Interview Questions

DesignGurus · 45 questions

Progress: 0/45 solved (0.0%)

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

#	Title	Acceptance	Difficulty
1	Toeplitz Matrix (easy)	55.8%	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.2%	easy
5	Hidden Document	27.3%	easy
6	Hidden Document	76.0%	easy
7	Hidden Document	75.9%	easy
8	Hidden Document	46.5%	easy
9	Hidden Document	86.8%	easy
10	Hidden Document	71.7%	easy
11	Diagonal Traverse (medium)	37.6%	Med.
12	Shortest Path in Binary Matrix (medium)	53.4%	Med.
13	Maximum Swap (medium)	42.7%	Med.
14	Custom Sort String (medium)	60.3%	Med.
15	Binary Tree Vertical Order Traversal (medium)	82.2%	Med.
16	Buildings With an Ocean View (medium)	62.4%	Med.
17	Hidden Document	43.5%	Med.
18	Hidden Document	70.9%	Med.
19	Hidden Document	80.4%	Med.
20	Hidden Document	56.1%	Med.
21	Hidden Document	45.2%	Med.
22	Hidden Document	41.4%	Med.
23	Hidden Document	25.2%	Med.
24	Hidden Document	37.4%	Med.
25	Hidden Document	25.0%	Med.
26	Hidden Document	69.0%	Med.
27	Hidden Document	31.2%	Med.
28	Hidden Document	76.2%	Med.
29	Hidden Document	49.3%	Med.
30	Hidden Document	46.3%	Med.
31	Hidden Document	46.0%	Med.
32	Hidden Document	63.6%	Med.
33	Hidden Document	68.2%	Med.
34	Hidden Document	85.5%	Med.
35	Hidden Document	50.7%	Med.
36	Sliding Window Median (hard)	32.2%	hard
37	Alien Dictionary (hard)	45.6%	hard
38	Minimum Window Substring (hard)	59.5%	hard
39	Best Meeting Point (hard)	50.4%	hard
40	Hidden Document	49.3%	hard
41	Hidden Document	43.0%	hard
42	Hidden Document	71.2%	hard
43	Hidden Document	82.1%	hard
44	Hidden Document	69.2%	hard
45	Hidden Document	51.7%	hard