The Ultimate List of Coding Interview Questions

If you’re prepping for a software engineer interview at Google, Meta, Amazon, or any top tech company, coding interview questions are the #1 thing to master.

This guide covers:

• The 3 most recommended coding interview question sets: Blind 75, Leetcode Patterns, GreatFrontend 75
• Why these lists work, and how to use them for maximum results
• ALL problem names—no paywall, no signup

The “Big Three” Interview Question Lists

1. Blind 75 Coding Interview Questions

Blind 75 is the internet’s most famous must-solve coding interview set, curated by Yangshun Tay (ex-Facebook).
It covers core patterns every FAANG interviewer expects.

Blind 75 Problem List:

• Two Sum
• Best Time to Buy and Sell Stock
• Contains Duplicate
• Product of Array Except Self
• Maximum Subarray
• Maximum Product Subarray
• Find Minimum in Rotated Sorted Array
• Search in Rotated Sorted Array
• 3Sum
• Container With Most Water
• Climbing Stairs
• Coin Change
• Longest Increasing Subsequence
• Longest Common Subsequence
• Word Break
• Combination Sum
• House Robber
• House Robber II
• Decode Ways
• Unique Paths
• Jump Game
• Merge Intervals
• Insert Interval
• Non-overlapping Intervals
• Meeting Rooms
• Meeting Rooms II
• Reverse Linked List
• Detect Cycle in Linked List
• Merge Two Sorted Lists
• Reorder List
• Remove Nth Node From End of List
• Copy List with Random Pointer
• Add Two Numbers
• LRU Cache
• Binary Tree Inorder Traversal
• Binary Tree Preorder Traversal
• Binary Tree Postorder Traversal
• Maximum Depth of Binary Tree
• Diameter of Binary Tree
• Balanced Binary Tree
• Same Tree
• Subtree of Another Tree
• Lowest Common Ancestor of BST
• Level Order Traversal
• Validate Binary Search Tree
• Kth Smallest Element in a BST
• Construct Binary Tree from Preorder and Inorder Traversal
• Binary Tree Maximum Path Sum
• Serialize and Deserialize Binary Tree
• Insert, Delete, GetRandom O(1)
• Search Word (Trie)
• Word Search
• Longest Substring Without Repeating Characters
• Longest Repeating Character Replacement
• Minimum Window Substring
• Valid Anagram
• Group Anagrams
• Valid Parentheses
• Valid Palindrome
• Longest Palindromic Substring
• Palindromic Substrings
• Encode and Decode Strings
• Maximum Profit in Job Scheduling
• Min Stack
• Evaluate Reverse Polish Notation
• Generate Parentheses
• Daily Temperatures
• Car Fleet
• Largest Rectangle in Histogram
• Sliding Window Maximum
• Rotting Oranges
• Number of Islands
• Clone Graph
• Course Schedule
• Pacific Atlantic Water Flow
• Number of Connected Components in an Undirected Graph
• Graph Valid Tree
• Word Ladder
• Find Median from Data Stream

2. Leetcode Patterns: Master Coding Interview Problem Types

Leetcode Patterns is a powerful framework that groups questions by underlying technique—not just topic.
This helps you recognize what approach to use in new problems.

Leetcode Patterns Problem List:

• Two Sum
• Valid Parentheses
• Merge Two Sorted Lists
• Merge Intervals
• Best Time to Buy and Sell Stock
• Maximum Subarray
• Product of Array Except Self
• Valid Palindrome
• Group Anagrams
• Top K Frequent Elements
• Longest Consecutive Sequence
• Set Matrix Zeroes
• Rotate Image
• Word Search
• Longest Substring Without Repeating Characters
• Longest Palindromic Substring
• Palindromic Substrings
• Encode and Decode Strings
• Minimum Window Substring
• Subarray Sum Equals K
• Continuous Subarray Sum
• Insert Interval
• Non-overlapping Intervals
• Meeting Rooms
• Meeting Rooms II
• Binary Tree Inorder Traversal
• Binary Tree Preorder Traversal
• Binary Tree Postorder Traversal
• Maximum Depth of Binary Tree
• Balanced Binary Tree
• Diameter of Binary Tree
• Same Tree
• Subtree of Another Tree
• Lowest Common Ancestor of a BST
• Level Order Traversal
• Validate Binary Search Tree
• Kth Smallest Element in a BST
• Construct Binary Tree from Preorder and Inorder Traversal
• Binary Tree Maximum Path Sum
• Serialize and Deserialize Binary Tree
• Add Two Numbers
• Reverse Linked List
• Detect Cycle in Linked List
• Reorder List
• Remove Nth Node From End of List
• Copy List with Random Pointer
• LRU Cache
• Min Stack
• Evaluate Reverse Polish Notation
• Generate Parentheses
• Daily Temperatures
• Car Fleet
• Largest Rectangle in Histogram
• Sliding Window Maximum
• Find Minimum in Rotated Sorted Array
• Search in Rotated Sorted Array
• 3Sum
• Container With Most Water
• Course Schedule
• Pacific Atlantic Water Flow
• Number of Connected Components in an Undirected Graph
• Graph Valid Tree
• Word Ladder
• Find Median from Data Stream

3. GreatFrontend 75: The Frontend Coding Interview List

GreatFrontend 75 is the top modern set for front-end engineers and fullstack web roles, mixing algorithm, system, and UI logic.

GreatFrontend 75 Problem List:

• Two Sum
• Valid Parentheses
• Merge Two Sorted Lists
• Merge Intervals
• Maximum Subarray
• Product of Array Except Self
• Valid Palindrome
• Group Anagrams
• Top K Frequent Elements
• Longest Consecutive Sequence
• Rotate Image
• Word Search
• Longest Substring Without Repeating Characters
• Longest Palindromic Substring
• Palindromic Substrings
• Encode and Decode Strings
• Minimum Window Substring
• Subarray Sum Equals K
• Meeting Rooms
• Binary Tree Inorder Traversal
• Binary Tree Preorder Traversal
• Maximum Depth of Binary Tree
• Balanced Binary Tree
• Diameter of Binary Tree
• Same Tree
• Subtree of Another Tree
• Level Order Traversal
• Validate Binary Search Tree
• Add Two Numbers
• Reverse Linked List
• Detect Cycle in Linked List
• Remove Nth Node From End of List
• LRU Cache
• Min Stack
• Generate Parentheses
• Daily Temperatures
• Largest Rectangle in Histogram
• Sliding Window Maximum
• Find Minimum in Rotated Sorted Array
• Search in Rotated Sorted Array
• 3Sum
• Container With Most Water
• Course Schedule
• Pacific Atlantic Water Flow
• Number of Connected Components in an Undirected Graph
• Word Ladder
• Find Median from Data Stream
• Debounce
• Throttle
• Deep Clone
• Event Emitter
• LRU Cache (JS Implementation)
• Implement Promise
• Compose Functions
• Deep Equal
• Flatten Array/Object
• Curry Function
• Memoization
• Debounce (UI)
• Infinite Scroll
• Virtual Scroll
• Drag & Drop
• Image Lazy Loading
• Intersection Observer
• Event Delegation
• Build a Modal
• Build a Tooltip
• Accessible Tabs
• Responsive Navigation Bar
• Custom Checkbox/Radio
• Keyboard Navigation
• Portal in React
• Custom Hook (React)
• State Management (React/Redux)
• Context API
• Debounced Search Box

How to Use These Lists to Ace Your Interview

1. Pick a set (Blind 75, Leetcode Patterns, or GreatFrontend 75 for frontend roles).
2. Go problem by problem—don’t just read, solve!
3. Study patterns: After every problem, ask yourself:

   • What technique did this require?
   • Can I spot this pattern in new problems?
4. Do mock interviews (with peers or platforms).
5. Review failed attempts and common bugs.
6. Mix in system design, behavioral, and frontend system/UI for full-stack/web roles.

More Coding Interview Question Resources

• Blind 75 original GitHub
• Leetcode Patterns
• GreatFrontend 75
• LeetCode Problem List
• NeetCode 150 (Bonus!)

Final Tips

• Focus on mastery, not memorization.
• Mix up question types and simulate real interview environments.
• Reflect on your process—don’t just chase the solution.
• Review and explain your code out loud!
• Balance algorithm and practical/frontend/system design if your role needs it.