Witeso

Rank	Topic	Frequency	Percentage
1	Array	653	47.1%
2	String	315	22.7%
3	Hash Table	267	19.3%
4	Dynamic Programming	210	15.1%
5	Math	203	14.6%
6	Sorting	170	12.3%
7	Depth-First Search	157	11.3%
8	Tree	131	9.4%
9	Greedy	127	9.2%
10	Breadth-First Search	118	8.5%
11	Binary Tree	113	8.1%
12	Binary Search	111	8.0%
13	Two Pointers	109	7.9%
14	Matrix	101	7.3%
15	Database	89	6.4%
16	Stack	83	6.0%
17	Bit Manipulation	78	5.6%
18	Simulation	66	4.8%
19	Design	66	4.8%
20	Heap (Priority Queue)	66	4.8%
21	Graph Theory	57	4.1%
22	Backtracking	53	3.8%
23	Linked List	53	3.8%
24	Prefix Sum	53	3.8%
25	Counting	48	3.5%
26	Sliding Window	47	3.4%
27	Divide and Conquer	36	2.6%
28	Enumeration	33	2.4%
29	Recursion	30	2.2%
30	Union-Find	28	2.0%
31	Monotonic Stack	27	1.9%
32	Binary Search Tree	26	1.9%
33	Ordered Set	24	1.7%
34	Trie	23	1.7%
35	Memoization	21	1.5%
36	Segment Tree	18	1.3%
37	Number Theory	17	1.2%
38	Hash Function	16	1.2%
39	Geometry	15	1.1%
40	Queue	15	1.1%
41	Bitmask	14	1.0%
42	Topological Sort	14	1.0%
43	Binary Indexed Tree	14	1.0%
44	Interactive	12	0.9%
45	Rolling Hash	11	0.8%
46	String Matching	11	0.8%
47	Doubly-Linked List	10	0.7%
48	Shortest Path	10	0.7%
49	Combinatorics	10	0.7%
50	Data Stream	9	0.6%
51	Merge Sort	8	0.6%
52	Game Theory	8	0.6%
53	Randomized	7	0.5%
54	Bucket Sort	5	0.4%
55	Sweep Line	5	0.4%
56	Concurrency	5	0.4%
57	Iterator	5	0.4%
58	Quickselect	4	0.3%
59	Counting Sort	4	0.3%
60	Brainteaser	4	0.3%
61	Shell	4	0.3%
62	Suffix Array	4	0.3%
63	Probability and Statistics	3	0.2%
64	Monotonic Queue	3	0.2%
65	Reservoir Sampling	3	0.2%
66	Eulerian Circuit	2	0.1%
67	Strongly Connected Component	1	0.1%
68	Minimum Spanning Tree	1	0.1%
69	Radix Sort	1	0.1%

No.	Question Title	Link	Difficulty
1	Design Ride Sharing System	Visit	Medium
2	Largest Prime from Consecutive Prime Sum	Visit	Medium
3	Maximum Product of Three Elements After One Replacement	Visit	Medium
4	Longest Balanced Substring II	Visit	Medium
5	Longest Balanced Substring I	Visit	Medium
6	Restricted	Restricted	Hard
7	Restricted	Restricted	Hard
8	Restricted	Restricted	Hard
9	Restricted	Restricted	Hard
10	Restricted	Restricted	Hard
11	Restricted	Restricted	Hard
12	Restricted	Restricted	Hard
13	Restricted	Restricted	Hard
14	Restricted	Restricted	Hard
15	Restricted	Restricted	Hard

Frequently Asked Questions

Common questions about Meta interviews

Meta's coding interviews are comparable to Google and Netflix in difficulty, with a strong emphasis on clean, efficient code and problem-solving under time pressure. The process is unique due to the 'Bar Raiser' round, which assesses cultural add and leadership principles alongside technical skills. For a competitive edge, dedicate 2-3 months to solving 150-200 LeetCode problems (focusing on medium/hard graph, tree, and DP questions) and practicing 10-15 system design problems if interviewing for SDE-2+ roles.

Focus intensely on graph traversal (BFS/DFS), trees (binary search, traversals), recursion/backtracking, sliding window, and dynamic programming—these appear in over 70% of Meta questions. Meta often tests your ability to extend a basic solution into a scalable one, so practice optimizing from O(n²) to O(n log n) or O(n). Also, be prepared to write production-ready code with clear error handling and comments, as evaluators score code quality separately from correctness.

The biggest mistake is treating the 'Bar Raiser' as a casual chat; you must structure every answer using the STAR method and explicitly reference Meta's 16 Leadership Principles (e.g., 'Focus on Impact'). Technically, candidates fail by not vocalizing their thought process during coding—Meta assessors evaluate how you collaborate and handle hints. Always clarify requirements first, discuss trade-offs, and test with edge cases before coding.

Stand-out candidates demonstrate 'impact-oriented' thinking: they connect solutions to real Meta products (e.g., 'This caching approach could improve Instagram feed latency'). They also proactively ask clarifying questions about scale and constraints, and in the Bar Raiser, share stories where they influenced others or drove cross-team projects. Meta looks for engineers who embody 'Move Fast' but with high-quality execution, so highlight instances where you balanced speed and robustness.

The standard timeline is 1-2 weeks after the final interview, but the Bar Raiser review can extend this to 3-4 weeks. If you haven't heard back within 10 business days, send a polite follow-up to your recruiter. Delays often occur because the hiring committee meets weekly to debate offers; use this time to prepare for potential team-matching calls, which may happen even before a formal offer is extended.

SDE-1 (new grad) focuses almost entirely on DSA (2-3 coding rounds) with basic OOD. SDE-2 expects 1-2 coding rounds plus a dedicated system design round focusing on APIs, data modeling, and trade-offs. SDE-3 includes advanced system design (e.g., design a distributed system), architecture discussions, and leadership principle deep dives. All levels have a Bar Raiser, but senior roles are judged more on technical leadership and mentorship examples.

Use Meta's official engineering blog to understand their tech stack (e.g., React, GraphQL, TaL, Scuba) and incorporate these into system design answers. Practice on Pramp or Interviewing.io for mock interviews with ex-Meta engineers. Study the 'Meta-16' leadership principles and prepare 10-15 stories that align with them. Finally, review recent candidate experiences on Blind/LeetCode discuss to identify recurring question patterns (e.g., 'Shortest Path in a Grid with Obstacles Elimination').

Meta operates on a 'move fast and break things' ethos but with high ownership—you'll ship code to production within your first month. Expect a 6-month ramp-up period where you're expected to independently deliver small features and actively seek feedback via 'peer reviews' and 'propelled' meetings. Success hinges on demonstrating impact (quantify your contributions) and embracing the 'hackathon' mindset of prototyping solutions quickly. New SDEs are matched to teams based on interview feedback and stated preferences, but you can switch teams after 1 year if needed.

Meta Questions

Topic Frequency Analysis

All Topics

Frequently Asked Questions