Meta Interview Questions — 100 DSA Problems
100 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Meta LeetCode questions for software engineering interviews.
- Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
- Pow(x, n) (MEDIUM) — Math, Recursion
- Simplify Path (MEDIUM) — String, Stack
- Merge Intervals (MEDIUM) — Array, Sorting
- Two Sum (EASY) — Array, Hash Table
- Next Permutation (MEDIUM) — Array, Two Pointers
- Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
- 3Sum (MEDIUM) — Array, Two Pointers, Sorting
- Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
- Valid Parentheses (EASY) — String, Stack
- Valid Number (HARD) — String
- Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
- Longest Common Prefix (EASY) — String, Trie
- Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
- Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
- Subsets (MEDIUM) — Array, Backtracking, Bit Manipulation
- Remove Nth Node From End of List (MEDIUM) — Linked List, Two Pointers
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
- String to Integer (atoi) (MEDIUM) — String
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- Remove Duplicates from Sorted Array (EASY) — Array, Two Pointers
- Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
- Palindrome Number (EASY) — Math
- Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
- Roman to Integer (EASY) — Hash Table, Math, String
- Merge Two Sorted Lists (EASY) — Linked List, Recursion
- Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
- Count and Say (MEDIUM) — String
- Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
- Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
- Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
- Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix
- Sort Colors (MEDIUM) — Array, Two Pointers, Sorting
- Add Binary (EASY) — Math, String, Bit Manipulation, Simulation
- Multiply Strings (MEDIUM) — Math, String, Simulation
- Reverse Integer (MEDIUM) — Math
- Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
- Plus One (EASY) — Array, Math
- Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
- Rotate Image (MEDIUM) — Array, Math, Matrix
- Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
- Regular Expression Matching (HARD) — String, Dynamic Programming, Recursion
- Insert Interval (MEDIUM) — Array
- Find the Index of the First Occurrence in a String (EASY) — Two Pointers, String, String Matching
- Sqrt(x) (EASY) — Math, Binary Search
- Search a 2D Matrix (MEDIUM) — Array, Binary Search, Matrix
- Binary Tree Zigzag Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
- Divide Two Integers (MEDIUM) — Math, Bit Manipulation
- Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
M
Meta
100 questions tracked100 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
7Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
9MediumFind First and Last Position of Element in Sorted Array✓ Our Solution ArrayBinary Search
12Hash TableStringSliding Window
15Hash TableStringBacktracking
16ArrayBacktrackingBit Manipulation
18Hash TableStringSliding Window
19ArrayTwo PointersDynamic ProgrammingStack+1
21Two PointersStringDynamic Programming
23ArrayBinary SearchDivide and Conquer
28ArrayHash TableStringSorting
30MathDynamic ProgrammingMemoization
31ArrayDivide and ConquerDynamic Programming
35MathStringBit ManipulationSimulation
38ArrayStringBacktrackingDepth-First Search+1
40StringDynamic ProgrammingBacktracking
43StringDynamic ProgrammingRecursion
45Two PointersStringString Matching
48TreeBreadth-First SearchBinary Tree
50ArrayStackMonotonic Stack
51TreeBreadth-First SearchBinary Tree
53MathDynamic ProgrammingCombinatorics
55ArrayDynamic ProgrammingGreedy
57TreeDepth-First SearchBinary Search TreeBinary Tree
59StringDynamic Programming
61ArrayBacktrackingBit Manipulation
63ArrayDynamic ProgrammingStackMatrix+1
69StringDynamic ProgrammingGreedyRecursion
70StackTreeDepth-First SearchBinary Tree
71TreeDepth-First SearchBreadth-First SearchBinary Tree
73ArrayDynamic ProgrammingMatrix
75MediumConstruct Binary Tree from Preorder and Inorder Traversal✓ Our Solution ArrayHash TableDivide and ConquerTree+1
77ArrayDynamic ProgrammingGreedy
80TreeDepth-First SearchBreadth-First SearchBinary Tree
82StringDynamic Programming
84ArrayHash TableBacktrackingMatrix
85TreeDepth-First SearchBreadth-First SearchBinary Tree
86Linked ListDivide and ConquerTreeBinary Search Tree+1
88StringDynamic ProgrammingStack
89TreeDepth-First SearchBreadth-First SearchBinary Tree
93ArrayDivide and ConquerTreeBinary Search Tree+1
94ArrayDynamic ProgrammingMatrix
95TreeDepth-First SearchBinary Tree
97Dynamic ProgrammingBacktrackingTreeBinary Search Tree+1
98Hash TableStringSliding Window
100TreeBreadth-First SearchBinary Tree