| | Longest Substring Without Repeating Characters | Sliding Window | Medium | AmazonGoogle +2 | High | |
| | Minimum Window Substring | Sliding Window | Hard | FacebookAmazon +2 | High | |
| | Sliding Window Maximum | Sliding Window | Hard | AmazonGoogle +1 | Medium | |
| | Longest Repeating Character Replacement | Sliding Window | Medium | GoogleAmazon | Medium | |
| | Permutation in String | Sliding Window | Medium | MicrosoftAmazon | Medium | |
| | Find All Anagrams in a String | Sliding Window | Medium | FacebookUber | Medium | |
| | Max Consecutive Ones III | Sliding Window | Medium | GoogleAmazon | Medium | |
| | Subarray Product Less Than K | Sliding Window | Medium | Amazon | Low | |
| | Minimum Size Subarray Sum | Sliding Window | Medium | AmazonFacebook | Medium | |
| | Fruit Into Baskets | Sliding Window | Medium | Google | Low | |
| | Two Sum II - Input Array Is Sorted | Two Pointers | Medium | AmazonApple | High | |
| | 3Sum | Two Pointers | Medium | FacebookAmazon +2 | High | |
| | Container With Most Water | Two Pointers | Medium | AmazonFacebook +2 | High | |
| | Trapping Rain Water | Two Pointers | Hard | AmazonGoogle +2 | High | |
| | Valid Palindrome | Two Pointers | Easy | FacebookMicrosoft +1 | High | |
| | Move Zeroes | Two Pointers | Easy | FacebookBloomberg | Medium | |
| | Remove Duplicates from Sorted Array | Two Pointers | Easy | AppleMicrosoft | High | |
| | Binary Search | Binary Search | Easy | AmazonGoogle +1 | High | |
| | Search in Rotated Sorted Array | Binary Search | Medium | AmazonFacebook +2 | High | |
| | Find Minimum in Rotated Sorted Array | Binary Search | Medium | AmazonMicrosoft | High | |
| | Koko Eating Bananas | Binary Search | Medium | FacebookAmazon | Medium | |
| | Find Peak Element | Binary Search | Medium | GoogleFacebook | Medium | |
| | Time Based Key-Value Store | Binary Search | Medium | GoogleAirbnb | Medium | |
| | Subarray Sum Equals K | Prefix Sum | Medium | FacebookGoogle +2 | High | |
| | Product of Array Except Self | Prefix Sum | Medium | AmazonFacebook +2 | High | |
| | Range Sum Query - Immutable | Prefix Sum | Easy | Amazon | Medium | |
| | Contiguous Array | Prefix Sum | Medium | Facebook | Medium | |
| | Two Sum | Hash Map / Set | Easy | AmazonGoogle +3 | High | |
| | Group Anagrams | Hash Map / Set | Medium | AmazonFacebook +2 | High | |
| | Top K Frequent Elements | Hash Map / Set | Medium | FacebookAmazon +1 | High | |
| | Valid Anagram | Hash Map / Set | Easy | AmazonApple +1 | High | |
| | Longest Consecutive Sequence | Hash Map / Set | Medium | GoogleFacebook +1 | High | |
| | Valid Parentheses | Stack | Easy | GoogleAmazon +2 | High | |
| | Min Stack | Stack | Medium | AmazonBloomberg +1 | High | |
| | Evaluate Reverse Polish Notation | Stack | Medium | AmazonLinkedIn | Medium | |
| | Daily Temperatures | Stack | Medium | AmazonGoogle +1 | High | |
| | Decode String | Stack | Medium | GoogleAmazon +1 | Medium | |
| | Number of Islands | Queue / BFS | Medium | AmazonGoogle +2 | High | |
| | Rotting Oranges | Queue / BFS | Medium | AmazonGoogle | High | |
| | Binary Tree Level Order Traversal | Queue / BFS | Medium | AmazonFacebook +1 | High | |
| | Word Ladder | Queue / BFS | Hard | AmazonFacebook +2 | Medium | |
| | Kth Largest Element in an Array | Heap / Priority Queue | Medium | FacebookAmazon +2 | High | |
| | Find Median from Data Stream | Heap / Priority Queue | Hard | AmazonMicrosoft +1 | High | |
| | Task Scheduler | Heap / Priority Queue | Medium | FacebookAmazon | Medium | |
| | Merge K Sorted Lists | Heap / Priority Queue | Hard | AmazonFacebook +2 | High | |
| | Reverse Linked List | Linked List | Easy | AmazonFacebook +2 | High | |
| | Linked List Cycle | Linked List | Easy | AmazonMicrosoft +1 | High | |
| | Merge Two Sorted Lists | Linked List | Easy | AmazonMicrosoft +1 | High | |
| | Reorder List | Linked List | Medium | AmazonFacebook | Medium | |
| | Invert Binary Tree | Trees / DFS | Easy | AmazonApple +1 | High | |
| | Maximum Depth of Binary Tree | Trees / DFS | Easy | AmazonLinkedIn | High | |
| | Validate Binary Search Tree | Trees / DFS | Medium | AmazonBloomberg +2 | High | |
| | Lowest Common Ancestor of a BST | Trees / DFS | Medium | AmazonFacebook +1 | High | |
| | Binary Tree Maximum Path Sum | Trees / DFS | Hard | AmazonFacebook +2 | High | |
| | Serialize and Deserialize Binary Tree | Trees / DFS | Hard | GoogleAmazon +2 | Medium | |
| | Clone Graph | Graphs | Medium | FacebookAmazon +1 | High | |
| | Pacific Atlantic Water Flow | Graphs | Medium | GoogleFacebook +1 | Medium | |
| | Number of Connected Components in Undirected Graph ★ | Graphs | Medium | LinkedInGoogle +1 | Medium | |
| | Climbing Stairs | Dynamic Programming | Easy | AmazonAdobe +1 | High | |
| | House Robber | Dynamic Programming | Medium | AmazonGoogle +1 | High | |
| | Coin Change | Dynamic Programming | Medium | AmazonGoogle +2 | High | |
| | Longest Increasing Subsequence | Dynamic Programming | Medium | GoogleAmazon +1 | High | |
| | Longest Common Subsequence | Dynamic Programming | Medium | GoogleAmazon +1 | High | |
| | Word Break | Dynamic Programming | Medium | AmazonGoogle +2 | High | |
| | Edit Distance | Dynamic Programming | Hard | GoogleAmazon +2 | Medium | |
| | Unique Paths | Dynamic Programming | Medium | AmazonGoogle +1 | High | |
| | Maximum Subarray | Dynamic Programming | Medium | AmazonLinkedIn +2 | High | |
| | Decode Ways | Dynamic Programming | Medium | AmazonFacebook +1 | High | |
| | Jump Game | Greedy | Medium | AmazonMicrosoft +1 | High | |
| | Jump Game II | Greedy | Medium | AmazonGoogle +1 | High | |
| | Gas Station | Greedy | Medium | AmazonUber +1 | Medium | |
| | Permutations | Backtracking | Medium | LinkedInMicrosoft +1 | High | |
| | Subsets | Backtracking | Medium | FacebookAmazon +1 | High | |
| | Combination Sum | Backtracking | Medium | AmazonFacebook +1 | High | |
| | Word Search | Backtracking | Medium | AmazonFacebook +2 | High | |
| | Implement Trie (Prefix Tree) | Trie | Medium | AmazonGoogle +2 | High | |
| | Design Add and Search Words Data Structure | Trie | Medium | FacebookBloomberg | Medium | |
| | Redundant Connection | Union Find | Medium | GoogleAmazon | Medium | |
| | Accounts Merge | Union Find | Medium | FacebookAmazon +1 | Medium | |
| | Largest Rectangle in Histogram | Monotonic Stack | Hard | AmazonGoogle +1 | High | |
| | Next Greater Element I | Monotonic Stack | Easy | Apple | Medium | |
| | Course Schedule | Topological Sort | Medium | AmazonFacebook +2 | High | |
| | Course Schedule II | Topological Sort | Medium | FacebookAmazon +1 | High | |
| | Single Number | Bit Manipulation | Easy | AmazonApple +1 | High | |
| | Missing Number | Bit Manipulation | Easy | MicrosoftAmazon | High | |
| | Counting Bits | Bit Manipulation | Easy | GoogleFacebook | High | |
| | Merge Intervals | Intervals | Medium | FacebookAmazon +2 | High | |
| | Insert Interval | Intervals | Medium | LinkedInGoogle +1 | High | |
| | Rotate Image | Matrix | Medium | AmazonMicrosoft +1 | High | |
| | Spiral Matrix | Matrix | Medium | AmazonMicrosoft +2 | High | |
| | Set Matrix Zeroes | Matrix | Medium | AmazonMicrosoft +1 | High | |
| | 4Sum | Two Pointers | Medium | AmazonAdobe | Medium | |
| | Sort Colors | Two Pointers | Medium | FacebookMicrosoft +1 | High | |
| | Squares of a Sorted Array | Two Pointers | Easy | GoogleAmazon +1 | High | |
| | Boats to Save People | Two Pointers | Medium | AmazonGoogle | Medium | |
| | Search a 2D Matrix | Binary Search | Medium | AmazonMicrosoft +1 | High | |
| | Capacity to Ship Packages Within D Days | Binary Search | Medium | AmazonFacebook +1 | High | |
| | Split Array Largest Sum | Binary Search | Hard | GoogleFacebook +1 | Medium | |
| | Median of Two Sorted Arrays | Binary Search | Hard | GoogleAmazon +3 | High | |
| | Contains Duplicate | Hash Map / Set | Easy | AmazonGoogle +1 | High | |
| | Word Pattern | Hash Map / Set | Easy | LinkedInDropbox | Medium | |
| | Isomorphic Strings | Hash Map / Set | Easy | LinkedInAmazon | Medium | |
| | LRU Cache | Hash Map / Set | Medium | AmazonMicrosoft +4 | High | |
| | Asteroid Collision | Stack | Medium | AmazonGoogle +1 | Medium | |
| | Remove K Digits | Stack | Medium | GoogleFacebook | Medium | |
| | Car Fleet | Stack | Medium | AmazonGoogle | Medium | |
| | 01 Matrix | Queue / BFS | Medium | FacebookAmazon +1 | High | |
| | Walls and Gates ★ | Queue / BFS | Medium | FacebookAmazon | Medium | |
| | Shortest Path in Binary Matrix | Queue / BFS | Medium | AmazonGoogle +1 | Medium | |
| | Open the Lock | Queue / BFS | Medium | GoogleAmazon | Medium | |
| | K Closest Points to Origin | Heap / Priority Queue | Medium | FacebookAmazon +2 | High | |
| | Reorganize String | Heap / Priority Queue | Medium | AmazonGoogle +1 | Medium | |
| | Top K Frequent Words | Heap / Priority Queue | Medium | AmazonBloomberg +1 | Medium | |
| | Add Two Numbers | Linked List | Medium | AmazonMicrosoft +3 | High | |
| | Remove Nth Node From End of List | Linked List | Medium | AmazonMicrosoft +2 | High | |
| | Copy List with Random Pointer | Linked List | Medium | AmazonMicrosoft +2 | High | |
| | Palindrome Linked List | Linked List | Easy | AmazonFacebook +2 | High | |
| | Diameter of Binary Tree | Trees / DFS | Easy | FacebookAmazon +1 | High | |
| | Symmetric Tree | Trees / DFS | Easy | AmazonMicrosoft +1 | High | |
| | Binary Tree Right Side View | Trees / DFS | Medium | FacebookAmazon +1 | High | |
| | Kth Smallest Element in a BST | Trees / DFS | Medium | AmazonFacebook +1 | High | |
| | Construct Binary Tree from Preorder and Inorder Traversal | Trees / DFS | Medium | AmazonMicrosoft +1 | Medium | |
| | Path Sum II | Trees / DFS | Medium | AmazonMicrosoft +1 | Medium | |
| | Surrounded Regions | Graphs | Medium | GoogleFacebook +1 | Medium | |
| | Minimum Height Trees | Graphs | Medium | GoogleAmazon | Medium | |
| | Network Delay Time | Graphs | Medium | AmazonGoogle +1 | Medium | |
| | Min Cost Climbing Stairs | Dynamic Programming | Easy | AmazonGoogle +1 | High | |
| | House Robber II | Dynamic Programming | Medium | AmazonGoogle +1 | High | |
| | Partition Equal Subset Sum | Dynamic Programming | Medium | AmazonFacebook +1 | High | |
| | Target Sum | Dynamic Programming | Medium | FacebookAmazon +1 | High | |
| | Best Time to Buy and Sell Stock | Dynamic Programming | Easy | AmazonFacebook +3 | High | |
| | Palindromic Substrings | Dynamic Programming | Medium | FacebookAmazon +1 | High | |
| | Longest Palindromic Substring | Dynamic Programming | Medium | AmazonMicrosoft +2 | High | |
| | Best Time to Buy and Sell Stock with Cooldown | Dynamic Programming | Medium | AmazonGoogle | Medium | |
| | Non-overlapping Intervals | Greedy | Medium | GoogleFacebook | High | |
| | Meeting Rooms II ★ | Greedy | Medium | FacebookAmazon +4 | High | |
| | Queue Reconstruction by Height | Greedy | Medium | GoogleFacebook | Medium | |
| | Letter Combinations of a Phone Number | Backtracking | Medium | AmazonFacebook +3 | High | |
| | Generate Parentheses | Backtracking | Medium | AmazonGoogle +2 | High | |
| | N-Queens | Backtracking | Hard | AmazonMicrosoft | Medium | |
| | Palindrome Partitioning | Backtracking | Medium | AmazonFacebook +1 | Medium | |
| | Word Search II | Trie | Hard | AmazonMicrosoft +1 | Medium | |
| | Longest Word in Dictionary | Trie | Medium | Google | Low | |
| | Number of Provinces | Union Find | Medium | AmazonFacebook +1 | High | |
| | Satisfiability of Equality Equations | Union Find | Medium | GoogleAmazon | Medium | |
| | Sum of Subarray Minimums | Monotonic Stack | Medium | GoogleAmazon | Medium | |
| | Online Stock Span | Monotonic Stack | Medium | AmazonMicrosoft | Medium | |
| | Number of 1 Bits | Bit Manipulation | Easy | AppleMicrosoft +1 | High | |
| | Reverse Bits | Bit Manipulation | Easy | AppleAmazon | Medium | |
| | Sum of Two Integers | Bit Manipulation | Medium | FacebookAmazon +1 | Medium | |
| | Minimum Interval to Include Each Query | Intervals | Hard | GoogleAmazon | Low | |
| | Meeting Rooms ★ | Intervals | Easy | FacebookAmazon +2 | High | |
| | Maximal Square | Matrix | Medium | FacebookAmazon +2 | High | |
| | Game of Life | Matrix | Medium | GoogleAmazon +2 | Medium | |
| | Find Pivot Index | Prefix Sum | Easy | AmazonGoogle | High | |
| | Running Sum of 1D Array | Prefix Sum | Easy | AmazonApple | Medium | |
| | Minimum Operations to Reduce X to Zero | Sliding Window | Medium | AmazonGoogle | Medium | |
| | Longest Subarray of 1's After Deleting One Element | Sliding Window | Medium | AmazonGoogle +1 | Medium | |
| | Count Number of Nice Subarrays | Sliding Window | Medium | Amazon | Medium | |
| | Valid Palindrome II | Two Pointers | Easy | FacebookAmazon +1 | High | |
| | Minimum Length of String After Deleting Similar Ends | Two Pointers | Medium | Google | Low | |
| | 4Sum II | Hash Map / Set | Medium | AmazonGoogle | Medium | |
| | Number of Good Pairs | Hash Map / Set | Easy | Amazon | Medium | |
| | Subarray Sum Divisible by K | Hash Map / Set | Medium | FacebookAmazon +1 | Medium | |
| | Basic Calculator II | Stack | Medium | AmazonFacebook +2 | High | |
| | Simplify Path | Stack | Medium | FacebookAirbnb +1 | Medium | |
| | Minimum Genetic Mutation | Queue / BFS | Medium | GoogleAmazon | Medium | |
| | Jump Game III | Queue / BFS | Medium | AmazonGoogle | Medium | |
| | Find K Pairs with Smallest Sums | Heap / Priority Queue | Medium | AmazonGoogle +1 | Medium | |
| | Minimum Cost to Connect Sticks ★ | Heap / Priority Queue | Medium | AmazonFacebook | Medium | |
| | Swap Nodes in Pairs | Linked List | Medium | AmazonMicrosoft +1 | Medium | |
| | Rotate List | Linked List | Medium | AmazonMicrosoft | Medium | |
| | Reverse Nodes in k-Group | Linked List | Hard | AmazonMicrosoft +2 | High | |
| | Count Good Nodes in Binary Tree | Trees / DFS | Medium | FacebookAmazon | Medium | |
| | Flatten Binary Tree to Linked List | Trees / DFS | Medium | AmazonMicrosoft +1 | Medium | |
| | Sum Root to Leaf Numbers | Trees / DFS | Medium | AmazonGoogle +1 | Medium | |
| | Populating Next Right Pointers in Each Node | Trees / DFS | Medium | FacebookAmazon +1 | Medium | |
| | Find Eventual Safe States | Graphs | Medium | GoogleAmazon | Medium | |
| | All Paths From Source to Target | Graphs | Medium | AmazonFacebook +1 | Medium | |
| | Cheapest Flights Within K Stops | Graphs | Medium | AmazonGoogle +1 | High | |
| | Maximum Product Subarray | Dynamic Programming | Medium | AmazonGoogle +3 | High | |
| | Triangle | Dynamic Programming | Medium | AmazonApple | Medium | |
| | Minimum Path Sum | Dynamic Programming | Medium | AmazonGoogle +1 | High | |
| | Perfect Squares | Dynamic Programming | Medium | GoogleAmazon | Medium | |
| | Regular Expression Matching | Dynamic Programming | Hard | GoogleFacebook +2 | Medium | |
| | Interleaving String | Dynamic Programming | Medium | AmazonGoogle +1 | Medium | |
| | Best Time to Buy and Sell Stock with Transaction Fee | Dynamic Programming | Medium | AmazonGoogle | Medium | |
| | Integer Break | Dynamic Programming | Medium | Google | Low | |
| | Minimum Number of Arrows to Burst Balloons | Greedy | Medium | MicrosoftAmazon | Medium | |
| | Candy | Greedy | Hard | AmazonGoogle | Medium | |
| | Combination Sum II | Backtracking | Medium | AmazonAdobe | Medium | |
| | Subsets II | Backtracking | Medium | FacebookAmazon | Medium | |
| | Replace Words | Trie | Medium | FacebookAmazon | Medium | |
| | Swim in Rising Water | Union Find | Hard | GoogleAmazon | Medium | |
| | Most Stones Removed with Same Row or Column | Union Find | Medium | FacebookAmazon | Medium | |
| | 132 Pattern | Monotonic Stack | Medium | GoogleAmazon +1 | Medium | |
| | Remove Duplicate Letters | Monotonic Stack | Medium | GoogleLyft | Medium | |
| | Parallel Courses ★ | Topological Sort | Medium | AmazonGoogle | Medium | |
| | Sequence Reconstruction ★ | Topological Sort | Medium | GoogleSnapchat | Low | |
| | Single Number II | Bit Manipulation | Medium | AmazonFacebook | Medium | |
| | Power of Two | Bit Manipulation | Easy | GoogleApple | Medium | |
| | Search a 2D Matrix II | Matrix | Medium | AmazonApple +2 | High | |
| | Count Negative Numbers in a Sorted Matrix | Matrix | Easy | AmazonGoogle | Medium | |
| | Frequency of the Most Frequent Element | Sliding Window | Medium | AmazonGoogle | Medium | |
| | Maximum Number of Vowels in a Substring of Given Length | Sliding Window | Medium | AmazonBloomberg | Medium | |
| | Minimum Average Difference | Prefix Sum | Medium | Amazon | Low | |