Meta Coding Interview Questions

Product-focused coding rounds with arrays, graphs, and design hybrids.

#	Title	Difficulty	Topics
1	Two Sum	Easy	hash table
15	3 Sum	Medium	two pointers
17	Letter Combinations of a Phone Number	Medium	backtracking
19	Remove Nth Node From End of List	Medium	two pointers
20	Valid Parentheses	Easy	stack
23	Merge k Sorted Lists	Hard	linked list
33	Search in Rotated Sorted Array	Medium	binary search
34	Find First and Last Position of Element in Sorted Array	Medium	binary search
46	Permutations	Medium	backtracking
49	Group Anagrams	Medium	hash table
50	Pow(x, n)	Medium	math
56	Merge Intervals	Hard	sort
67	Add Binary	Easy	string
71	Simplify Path	Medium	stack
75	Sort Colors	Medium	sort
76	Minimum Window Substring	Hard	hash table
78	Subsets	Medium	backtracking
80	Remove Duplicates from Sorted Array II	Medium	array
81	Search in Rotated Sorted Array II	Medium	binary search
90	Subsets II	Medium	backtracking
91	Decode Ways	Medium	dynamic programming
92	Reverse Linked List II	Medium	linked list
98	Validate Binary Search Tree	Medium	recursion
102	Binary Tree Level Order Traversal	Easy	breadth first search
103	Binary Tree Zigzag Level Order Traversal	Medium	breadth first search
105	Construct Binary Tree from Preorder and Inorder Traversal	Medium	recursion
116	Populating Next Right Pointers in Each Node	Medium	recursion
121	Best Time to Buy and Sell Stock	Easy	array
124	Binary Tree Maximum Path Sum	Hard	recursion
125	Valid Palindrome	Easy	string
126	Word Ladder II	Hard	backtracking
127	Word Ladder	Medium	breadth first search
128	Longest Consecutive Sequence	Hard	array
133	Clone Graph	Medium	breadth first search
139	Word Break	Medium	dynamic programming
143	Reorder List	Medium	two pointers
146	LRU Cache	Hard	design
148	Sort List	Medium	sort
153	Find Minimum in Rotated Sorted Array	Medium	binary search
154	Find Minimum in Rotated Sorted Array II	Hard	binary search
168	Excel Sheet Column Title	Easy	math
171	Excel Sheet Column Number	Easy	math
173	Binary Search Tree Iterator	Medium	design
199	Binary Tree Right Side View	Medium	depth first search
200	Number of Islands	Medium	depth first search
206	Reverse Linked List	Easy	linked list
207	Course Schedule	Medium	breadth first search
209	Minimum Size Subarray Sum	Medium	two pointers
210	Course Schedule II	Medium	breadth first search
215	Kth Largest Element in an Array	Medium	array
218	The Skyline Problem	Hard	sort
224	Basic Calculator	Hard	stack
227	Basic Calculator II	Medium	stack
235	Lowest Common Ancestor of a Binary Search Tree	Easy	binary search tree
236	Lowest Common Ancestor of a Binary Tree	Medium	depth first search
238	Product of Array Except Self	Medium	array
257	Binary Tree Paths	Easy	depth first search
278	First Bad Version	Easy	binary search
283	Move Zeroes	Easy	two pointers
332	Reconstruct Itinerary	Medium	graph
334	Increasing Triplet Subsequence	Medium	array
341	Flatten Nested List Iterator	Medium	stack
347	Top K Frequent Elements	Medium	sort
371	Sum of Two Integers	Easy	bit manipulation
380	Insert Delete GetRandom O(1)	Hard	design
435	Non-overlapping Intervals	Medium	greedy
437	Path Sum III	Easy	recursion
438	Find All Anagrams in a String	Easy	hash table
449	Serialize and Deserialize BST	Medium	binary search tree
461	Hamming Distance	Easy	bit manipulation
463	Island Perimeter	Easy	array
477	Total Hamming Distance	Medium	bit manipulation
478	Generate Random Point in a Circle	Medium	math
480	Sliding Window Median	Hard	binary heap
525	Contiguous Array	Medium	hash table
535	Encode and Decode TinyURL	Medium	design
543	Diameter of Binary Tree	Easy	tree
560	Subarray Sum Equals K	Medium	hash table
621	Task Scheduler	Medium	greedy
647	Palindromic Substrings	Medium	string
653	Two Sum IV - Input is a BST	Easy	tree
670	Maximum Swap	Medium	array
689	Maximum Sum of 3 Non-Overlapping Subarrays	Hard	dynamic programming
787	Cheapest Flights Within K Stops	Medium	breadth first search
863	All Nodes Distance K in Binary Tree	Medium	tree
953	Verifying an Alien Dictionary	Easy	string
958	Check Completeness of a Binary Tree	Medium	tree