Coding (DSA) – Meta Specific

Meta E4/E5 DSA Interview Questions - Complete Practice Checklist

📊 Overview

This is a comprehensive checklist of 100+ DSA questions recently asked in Meta interviews (2024-2025) for E4 and E5 levels. Data compiled from LeetCode discussions, verified interview experiences, and Meta's official question tags.

Last Updated: February 2025


🎯 TOP 15 MUST-DO QUESTIONS (Highest Frequency 2024-2025)

These questions appear in 80%+ of recent Meta interviews. If you're short on time, master these first.

Status
#
Problem Name
LC #
Difficulty
Topic
Link

1

Valid Palindrome II

680

Easy

String, Two Pointers

2

Clone Graph

133

Medium

Graph, DFS/BFS

3

Simplify Path

71

Medium

Stack, String

4

Merge K Sorted Lists

23

Hard

Linked List, Heap

5

Shortest Path in Binary Matrix

1091

Medium

Graph, BFS

6

Basic Calculator II

227

Medium

Stack, String

7

Nested List Weight Sum

339

Medium

DFS, Recursion

8

Dot Product of Two Sparse Vectors

1570

Medium

Array, Hash Map

9

Vertical Order Traversal of Binary Tree

987

Hard

Tree, BFS/DFS

10

Buildings With an Ocean View

1762

Medium

Array, Stack

11

Sum Root to Leaf Numbers

129

Medium

Tree, DFS

12

Exclusive Time of Functions

636

Medium

Stack

13

LRU Cache

146

Medium

Design, Hash Map, DLL

14

Insert into Sorted Circular Linked List

708

Medium

Linked List

15

Valid Palindrome III

1216

Hard

String, DP

⭐ = Premium question (requires LeetCode Premium)

Notes:

  • Valid Palindrome II - Almost guaranteed, expect k-deletions variant

  • Clone Graph - Discuss stack overflow → BFS/DFS with stack

  • Dot Product - Optimization discussion for sparse arrays is critical

  • LRU Cache - Often followed by LFU Cache (LC 460)


📚 COMPLETE QUESTION LIST BY TOPIC

1️⃣ ARRAYS & STRINGS

Easy Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Merge Sorted Array

88

Easy

In-place merge

Move Zeroes

283

Easy

Two pointer approach

Valid Palindrome

125

Easy

Foundation for harder variants

Add Strings

415

Easy

Sometimes with decimals

Can Place Flowers

605

Easy

Greedy problem

Monotonic Array

896

Easy

Simple traversal

Kth Missing Positive Number

1539

Easy

Binary search

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Valid Palindrome II

680

Easy-Med

⭐⭐⭐⭐⭐ HIGHEST PRIORITY

Valid Word Abbreviation

408

Medium

Two pointers

Next Permutation

31

Medium

Common in 2024

Merge Intervals

56

Medium

Classic sorting

Product of Array Except Self

238

Medium

No division variant

Subarray Sum Equals K

560

Medium

Prefix sum + hash

Missing Ranges

163

Medium

Edge case heavy

Buildings With Ocean View

1762

Medium

⭐⭐⭐⭐ NEW FREQUENT

Group Shifted Strings

249

Medium

Hash map problem

Custom Sort String

791

Medium

Counting sort

Find First and Last Position

34

Medium

Binary search

Positions of Large Groups

830

Medium

Two pointers

3Sum

15

Medium

Two pointers

Find Peak Element

162

Medium

Binary search

Continuous Subarray Sum

523

Medium

Prefix sum modulo

Hard Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Valid Number

65

Hard

State machine

Valid Palindrome III

1216

Hard

Follow-up to II


2️⃣ STACKS & QUEUES

Easy Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Remove All Adjacent Duplicates

1047

Easy

Stack basics

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Simplify Path

71

Medium

⭐⭐⭐⭐⭐ TOP PRIORITY

Basic Calculator II

227

Medium

⭐⭐⭐⭐ Often simplified

Minimum Remove to Make Valid Parentheses

1249

Medium

⭐⭐⭐⭐ Stack + string

Exclusive Time of Functions

636

Medium

⭐⭐⭐⭐ Log processing

Min Add to Make Parentheses Valid

921

Medium

Stack/counter

Decode String

394

Medium

Nested stack


3️⃣ LINKED LISTS

Easy Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Merge Two Sorted Lists

21

Easy

Warm-up question

Reverse Linked List

206

Easy

Iterative + recursive

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Remove Nth Node From End

19

Medium

Two pointers

Copy List with Random Pointer

138

Medium

Hash map solution

Insert into Sorted Circular List

708

Medium

⭐⭐⭐⭐ FREQUENT

Add Two Numbers

2

Medium

Classic problem

Reorder List

143

Medium

Multiple operations

Hard Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Merge K Sorted Lists

23

Hard

⭐⭐⭐⭐⭐ TOP PRIORITY

Reverse Nodes in k-Group

25

Hard

Follow-up to reverse


4️⃣ TREES & BINARY TREES

Easy Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Maximum Depth of Binary Tree

104

Easy

Warm-up

Closest Binary Search Tree Value

270

Easy

BST property

Diameter of Binary Tree

543

Easy

Recursion

Range Sum of BST

938

Easy

⭐⭐⭐ BST traversal

Invert Binary Tree

226

Easy

Classic recursion

Same Tree

100

Easy

Tree comparison

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Binary Tree Right Side View

199

Medium

⭐⭐⭐⭐ BFS or DFS

Sum Root to Leaf Numbers

129

Medium

⭐⭐⭐⭐ DFS with state

Lowest Common Ancestor of Binary Tree

236

Medium

Classic recursion

LCA of Binary Tree III

1650

Medium

⭐⭐⭐⭐ Parent pointer

BST Iterator

173

Medium

In-order traversal

Count Nodes Equal to Average of Subtree

2265

Medium

⭐⭐⭐⭐ NEW FREQUENT

Vertical Order Traversal

987

Hard

⭐⭐⭐⭐⭐ FREQUENT

Diameter of N-Ary Tree

1522

Medium

Extension of binary

Binary Tree Level Order Traversal

102

Medium

BFS classic

Path Sum II

113

Medium

Backtracking

Validate Binary Search Tree

98

Medium

BST properties

Construct Binary Tree from Preorder and Inorder

105

Medium

Tree construction

Kth Smallest Element in BST

230

Medium

In-order traversal

All Nodes Distance K in Binary Tree

863

Medium

Graph-like traversal


5️⃣ GRAPHS & BFS/DFS

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Clone Graph

133

Medium

⭐⭐⭐⭐⭐ TOP PRIORITY

Shortest Path in Binary Matrix

1091

Medium

⭐⭐⭐⭐⭐ VERY FREQUENT

Number of Islands

200

Medium

Classic DFS/BFS

Accounts Merge

721

Medium

Union-Find or DFS

Word Ladder

127

Hard

BFS shortest path

Course Schedule

207

Medium

Topological sort

Course Schedule II

210

Medium

Topological sort

Walls and Gates

286

Medium

Multi-source BFS

Pacific Atlantic Water Flow

417

Medium

DFS from borders

Hard Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Robot Room Cleaner

489

Hard

⭐⭐⭐⭐ FREQUENT

Making a Large Island

827

Hard

Union-Find

Word Ladder II

126

Hard

BFS + backtracking


6️⃣ BINARY SEARCH & SORTING

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Find First and Last Position

34

Medium

⭐⭐⭐⭐ Binary search

Find Peak Element

162

Medium

Binary search

Kth Largest Element

215

Medium

⭐⭐⭐⭐ Heap/QuickSelect

Random Pick with Weight

528

Medium

⭐⭐⭐⭐ Prefix sum + BS

Cutting Ribbons

1891

Medium

⭐⭐⭐⭐ BS on answer

Search in Rotated Sorted Array

33

Medium

Binary search variant

Minimum Size Subarray Sum

209

Medium

Sliding window

Top K Frequent Elements

347

Medium

Heap/Bucket sort

Longest Subsequence With Limited Sum

2389

Medium

Prefix sum + BS


7️⃣ DESIGN PROBLEMS

Easy Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Moving Average from Data Stream

346

Easy

Queue/sliding window

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

LRU Cache

146

Medium

⭐⭐⭐⭐⭐ TOP PRIORITY

Dot Product of Two Sparse Vectors

1570

Medium

⭐⭐⭐⭐⭐ VERY FREQUENT

Design Tic-Tac-Toe

348

Medium

Array optimization

Random Pick Index

398

Medium

Reservoir sampling

Design Add and Search Words Data Structure

211

Medium

Trie

Implement Trie (Prefix Tree)

208

Medium

Trie basics

Insert Delete GetRandom O(1)

380

Medium

HashMap + ArrayList

Design Hit Counter

362

Medium

Sliding window

Time Based Key-Value Store

981

Medium

TreeMap/Binary search

Hard Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

LFU Cache

460

Hard

Follow-up to LRU

Design Skiplist

1206

Hard

Advanced data structure

Design In-Memory File System

588

Hard

Trie variant


8️⃣ RECURSION & BACKTRACKING

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Nested List Weight Sum

339

Medium

⭐⭐⭐⭐⭐ VERY FREQUENT

Expression Add Operators

282

Hard

⭐⭐⭐⭐ Backtracking

Letter Combinations of a Phone Number

17

Medium

Backtracking

Generate Parentheses

22

Medium

Backtracking

Permutations

46

Medium

Backtracking

Combinations

77

Medium

Backtracking

Count and Say

38

Medium

String recursion

Subsets

78

Medium

Backtracking

Word Search

79

Medium

Backtracking

Nested List Weight Sum II

364

Medium

Follow-up to 339


9️⃣ GREEDY & MATH

Easy Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Best Time to Buy and Sell Stock

121

Easy

One-pass greedy

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Maximum Swap

670

Medium

⭐⭐⭐⭐ Greedy digit swap

Pow(x, n)

50

Medium

Fast exponentiation

Multiply Strings

43

Medium

Math simulation

Integer to English Words

273

Hard

String construction

Task Scheduler

621

Medium

Greedy/Math

Max Consecutive Ones III

1004

Medium

Sliding window


🔟 HASH MAP & TWO POINTERS

Medium Problems

Done
Problem Name
LC #
Difficulty
Link
Notes

Two Sum

1

Easy

Hash map classic

3Sum

15

Medium

Two pointers

Longest Substring Without Repeating Characters

3

Medium

Sliding window

Container With Most Water

11

Medium

Two pointers

Minimum Window Substring

76

Hard

Sliding window

Longest Palindromic Substring

5

Medium

Expand around center

Group Anagrams

49

Medium

Hash map grouping


📝 INTERVIEW QUESTION SETS

These are questions that were asked together in the same interview round based on recent candidate reports:

Set 1: Stack + Graph ⭐⭐⭐⭐⭐

Done
Problem
LC #
Link

Simplify Path

71

Clone Graph

133

Set 2: Linked Lists + Cache ⭐⭐⭐⭐⭐

Done
Problem
LC #
Link

Merge K Sorted Lists

23

LRU Cache

146

Set 3: Heap + Arrays ⭐⭐⭐⭐

Done
Problem
LC #
Link

Kth Largest Element

215

Dot Product of Sparse Vectors

1570

Set 4: Binary Search + Greedy ⭐⭐⭐⭐

Done
Problem
LC #
Link

Continuous Subarray Sum

523

Cutting Ribbons

1891

Set 5: Greedy + Recursion ⭐⭐⭐⭐

Done
Problem
LC #
Link

Maximum Swap

670

Expression Add Operators

282

Set 6: Trees + Lists ⭐⭐⭐⭐

Done
Problem
LC #
Link

Insert into Sorted Circular List

708

Diameter of N-Ary Tree

1522

Set 7: Stack + Recursion ⭐⭐⭐⭐

Done
Problem
LC #
Link

Nested List Weight Sum

339

Basic Calculator II

227

Set 8: Stack + Trees ⭐⭐⭐

Done
Problem
LC #
Link

Minimum Remove to Make Valid Parentheses

1249

Range Sum of BST

938

Done
Problem
LC #
Link

Positions of Large Groups

830

Find First and Last Position

34

Set 10: Binary Search + Trees ⭐⭐⭐⭐

Done
Problem
LC #
Link

Random Pick with Weight

528

Vertical Order Traversal

987

Set 11: Trees (BFS vs DFS) ⭐⭐⭐⭐

Done
Problem
LC #
Link

Binary Tree Right Side View

199

Lowest Common Ancestor III

1650

Set 12: Trees + Recursion ⭐⭐⭐

Done
Problem
LC #
Link

Count Nodes Equal to Average

2265

BST Iterator

173


🎯 PHONE SCREEN SPECIFIC (2024-2025)

Most commonly asked in 45-minute phone screens:

Done
Problem
LC #
Frequency
Link

Valid Palindrome II

680

⭐⭐⭐⭐⭐

Dot Product Sparse Vectors

1570

⭐⭐⭐⭐⭐

Nested List Weight Sum

339

⭐⭐⭐⭐

Clone Graph

133

⭐⭐⭐⭐

Valid Number

65

⭐⭐⭐

Simplify Path

71

⭐⭐⭐⭐

3Sum

15

⭐⭐⭐

Count and Say

38

⭐⭐⭐

Move Zeroes

283

⭐⭐⭐


🏢 ONSITE SPECIFIC (2024-2025)

Coding Round 1 (Medium + Medium/Hard)

Done
Problem
LC #
Frequency
Link

Valid Palindrome II + III combo

680, 1216

⭐⭐⭐⭐⭐

Shortest Path in Binary Matrix

1091

⭐⭐⭐⭐⭐

Insert Circular List (modified)

708

⭐⭐⭐⭐

Basic Calculator variants

227

⭐⭐⭐⭐

Buildings With Ocean View

1762

⭐⭐⭐⭐

Coding Round 2 (Array/Tree Focus)

Done
Problem
LC #
Frequency
Link

Merge K Sorted Lists

23

⭐⭐⭐⭐⭐

Vertical Order Traversal

987

⭐⭐⭐⭐

LRU Cache + LFU follow-up

146, 460

⭐⭐⭐⭐

Cutting Ribbons

1891

⭐⭐⭐

Robot Room Cleaner

489

⭐⭐⭐


💡 COMMON QUESTION VARIATIONS

Understanding common twists helps you adapt during interviews:

Original
Common Variations

Valid Palindrome II

• Allow k deletions • Return indices to remove • Return minimum deletions needed

Shortest Path Binary Matrix

• Return actual path (not just length) • 8 directions vs 4 directions • Multiple start/end points

Basic Calculator

• Only +/- operators • Only +/* operators • Add parentheses support

Clone Graph

• Very large graphs (discuss stack overflow) • Directed vs undirected • Weighted edges

Dot Product Sparse Vectors

• Streaming input • Extremely large arrays • Multiple queries optimization

Insert Circular List

• Given arbitrary pointer (not head) • Multiple insertions • Delete operations

Robot Room Cleaner

• Find specific target • Can move diagonally • Return to start

Merge K Lists

• Return kth element only • Merge first k elements only • Infinite streams

Valid Number

• No exponents (simplified) • Different valid formats • Additional constraints

Simplify Path

• Windows-style paths • Symbolic links • Permission checks


📖 PREPARATION STRATEGY

⏱️ Time-Based Plan

3 Weeks Preparation

  • Week 1-2: Top 30 most frequent questions (marked ⭐⭐⭐⭐⭐ and ⭐⭐⭐⭐)

  • Week 3: Interview sets + mock interviews

  • Daily: 5-7 problems + review mistakes

6 Weeks Preparation

  • Week 1-2: Top 50 most frequent

  • Week 3-4: Arrays, Strings, Trees, Graphs deep dive

  • Week 5-6: Design problems, Binary Search, Mock interviews

  • Daily: 5-7 problems + system design

2 Months Preparation (Recommended)

  • Month 1: All medium questions by topic

  • Month 2: Hard questions + design + system design prep

  • Daily: 5-7 DSA + 30 min system design

🎯 Priority Tiers

Tier 1 (Must Do) - 30 questions

  • All questions marked ⭐⭐⭐⭐⭐

  • Complete these even if you have only 1 week

Tier 2 (High Priority) - 50 questions

  • All questions marked ⭐⭐⭐⭐

  • Do these if you have 3+ weeks

Tier 3 (Good to Have) - 70+ questions

  • Questions marked ⭐⭐⭐ and below

  • Do these if you have 6+ weeks

📝 Daily Practice Routine

🔑 Key Success Factors

  1. Practice in Plain Text - Use Google Docs, not IDE

  2. Explain Out Loud - Practice talking through solutions

  3. Test Edge Cases - Always test explicitly

  4. 1-Pass Solutions - Meta values efficiency

  5. Time Yourself - First problem in <20 minutes

  6. Learn Patterns - Not just memorize solutions

  7. Mock Interviews - Do at least 5 before real interview

⚠️ Common Mistakes to Avoid

  • ❌ Jumping to code without clarifying requirements

  • ❌ Not discussing time/space complexity

  • ❌ Ignoring edge cases

  • ❌ Silent coding (not communicating)

  • ❌ Giving up when stuck

  • ❌ Not testing the solution

  • ❌ Memorizing without understanding

✅ Meta-Specific Behaviors

  • ✅ Ask clarifying questions upfront

  • ✅ Discuss multiple approaches

  • ✅ Optimize proactively (don't wait to be asked)

  • ✅ Write clean, readable code

  • ✅ Test with multiple examples

  • ✅ Explain trade-offs clearly

  • ✅ Handle ambiguity independently (E5+)


📊 E4 vs E5 Expectations

E4 (Mid-Level)

  • Solve both problems correctly

  • Handle edge cases when prompted

  • Optimize when asked

  • Clear communication

  • 20-25 min for first problem

E5 (Senior)

  • Solve first problem in <20 minutes

  • Proactively optimize

  • Discuss multiple approaches unprompted

  • Lead the technical discussion

  • Handle ambiguity independently

  • Teach/mentor during problem-solving


🎓 Additional Resources

LeetCode Lists

Practice Platforms

  • LeetCode - Primary source

  • MockGym - Meta-specific mock interviews

  • Pramp - Peer mock interviews

  • Interviewing.io - Anonymous mock interviews

Study Materials

  • Meta Engineering Blog - Real system design insights

  • NeetCode - Video solutions for top questions

  • AlgoExpert - Structured curriculum


📈 Progress Tracking

My Stats:

  • Total Questions: _____ / 150+

  • Tier 1 Complete: _____ / 30

  • Tier 2 Complete: _____ / 50

  • Tier 3 Complete: _____ / 70

  • Mock Interviews: _____ / 5

  • Weak Topics: _____________

Target Date: __________ Interview Date: __________


🔔 Important Notes

  1. ⚠️ NO Dynamic Programming - Meta explicitly doesn't ask DP

  2. 🚀 Speed Matters - Faster than other FAANG

  3. 📝 Clean Code - More emphasis than complexity

  4. Edge Cases - Explicitly test them

  5. 💬 Communication - Think aloud constantly

  6. 🔄 Variations - Known problems often have twists

  7. 📱 Plain Text - Practice without IDE features

  8. 🎯 Top 100 Rule - Very high hit rate from top 100



Last Updated: February 2025 Version: 2.0 Questions Count: 150+ Premium Questions: ~25 (marked with ⭐)


Good luck with your Meta interview preparation! Remember: consistency > intensity. Practice daily, review mistakes, and stay confident! 🚀

Last updated