Netflix Interview Questions — 38 DSA Problems

36 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Netflix LeetCode questions for software engineering interviews.

• Merge Intervals (MEDIUM) — Array, Sorting
• Logger Rate Limiter (EASY) — Hash Table, Design, Data Stream
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• First Missing Positive (HARD) — Array, Hash Table
• Reconstruct Itinerary (HARD) — Depth-First Search, Graph, Eulerian Circuit
• Random Pick with Weight (MEDIUM) — Array, Math, Binary Search, Prefix Sum, Randomized
• Time Based Key-Value Store (MEDIUM) — Hash Table, String, Binary Search, Design
• Flatten Nested List Iterator (MEDIUM) — Stack, Tree, Depth-First Search, Design, Queue, Iterator
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Top K Frequent Elements (MEDIUM) — Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect
• Summary Ranges (EASY) — Array
• Cache With Time Limit (MEDIUM) —
• Contains Duplicate II (EASY) — Array, Hash Table, Sliding Window
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Contains Duplicate III (HARD) — Array, Sliding Window, Sorting, Bucket Sort, Ordered Set
• Top K Frequent Words (MEDIUM) — Array, Hash Table, String, Trie, Sorting, Heap (Priority Queue), Bucket Sort, Counting
• Contains Duplicate (EASY) — Array, Hash Table, Sorting
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Word Search (MEDIUM) — Array, String, Backtracking, Depth-First Search, Matrix
• Daily Temperatures (MEDIUM) — Array, Stack, Monotonic Stack
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Valid Parentheses (EASY) — String, Stack
• Insert Delete GetRandom O(1) (MEDIUM) — Array, Hash Table, Math, Design, Randomized
• Search in Rotated Sorted Array (MEDIUM) — Array, Binary Search
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Text Justification (HARD) — Array, String, Simulation
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
• Number of Flowers in Full Bloom (HARD) — Array, Hash Table, Binary Search, Sorting, Prefix Sum, Ordered Set
• Rotate Image (MEDIUM) — Array, Math, Matrix
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Rotate Array (MEDIUM) — Array, Math, Two Pointers
• Network Delay Time (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Heap (Priority Queue), Shortest Path
• Minimum Remove to Make Valid Parentheses (MEDIUM) — String, Stack
• To Be Or Not To Be (EASY) —
• Implement Queue using Stacks (EASY) — Stack, Design, Queue