Meta Coding Interview Questions

DesignGurus · 45 questions

Progress: 0/45 solved (0.0%)

Easy 0/6Med. 0/29Hard 0/10

#	Title	Acceptance	Difficulty
1	Toeplitz Matrix (easy)	0.0%	Med.
2	Remove All Adjacent Duplicates In String (easy)	0.0%	Med.
3	Minimum Depth of a Binary Tree (easy)	0.0%	hard
4	Tree Diameter (easy)	0.0%	easy
5	Hidden Document	0.0%	Med.
6	Hidden Document	0.0%	Med.
7	Hidden Document	0.0%	Med.
8	Hidden Document	0.0%	hard
9	Hidden Document	0.0%	hard
10	Hidden Document	0.0%	easy
11	Diagonal Traverse (medium)	0.0%	Med.
12	Shortest Path in Binary Matrix (medium)	0.0%	hard
13	Maximum Swap (medium)	0.0%	Med.
14	Custom Sort String (medium)	0.0%	Med.
15	Binary Tree Vertical Order Traversal (medium)	0.0%	hard
16	Buildings With an Ocean View (medium)	0.0%	Med.
17	Hidden Document	0.0%	easy
18	Hidden Document	0.0%	Med.
19	Hidden Document	0.0%	Med.
20	Hidden Document	0.0%	Med.
21	Hidden Document	0.0%	easy
22	Hidden Document	0.0%	hard
23	Hidden Document	0.0%	Med.
24	Hidden Document	0.0%	Med.
25	Hidden Document	0.0%	hard
26	Hidden Document	0.0%	Med.
27	Hidden Document	0.0%	Med.
28	Hidden Document	0.0%	Med.
29	Hidden Document	0.0%	hard
30	Hidden Document	0.0%	Med.
31	Hidden Document	0.0%	Med.
32	Hidden Document	0.0%	easy
33	Hidden Document	0.0%	Med.
34	Hidden Document	0.0%	Med.
35	Hidden Document	0.0%	Med.
36	Sliding Window Median (hard)	0.0%	easy
37	Alien Dictionary (hard)	0.0%	Med.
38	Minimum Window Substring (hard)	0.0%	hard
39	Best Meeting Point (hard)	0.0%	Med.
40	Hidden Document	0.0%	Med.
41	Hidden Document	0.0%	Med.
42	Hidden Document	0.0%	Med.
43	Hidden Document	0.0%	hard
44	Hidden Document	0.0%	Med.
45	Hidden Document	0.0%	Med.