DSA SheetLearn patterns,not the problem

Master these high-frequency interview questions

• 3Sum
• Container With Most Water
• Sort Colors
• Trapping Rain Water
• Subarray Sum Equals K
• Fruit Into Baskets
• Minimum Size Subarray Sum

Master these high-frequency interview questions

• Valid Palindrome
• Longest Palindromic Substring
• Longest Substring Without Repeating Characters
• Longest Substring with At Most K Distinct
• Permutation in String

Master these high-frequency interview questions

• Search in Rotated Sorted Array
• Find Peak Element
• Find First and Last Position of Element
• Koko Eating Bananas
• Min Speed to Arrive on Time
• Search a 2D Matrix

Combine stack properties with greedy choices to optimize strings or numbers.

• Remove K Digits
• Remove Duplicate Letters
• Smallest Subsequence of Distinct Characters
• Create Maximum Number
• Minimum Remove to Make Valid Parentheses

Master these high-frequency interview questions

• Daily Temperatures
• Largest Rectangle in Histogram
• Asteroid Collision
• Basic Calculator I
• Remove Adjacent Duplicates II
• Longest Valid Parentheses
• Min Stack
• Implement Queue using Stacks

Master these high-frequency interview questions

• Linked List Cycle II
• Reverse Linked List II (Between m & n)
• Reverse Nodes in k-Group
• Merge k Sorted Lists
• Add Two Numbers II
• LRU Cache

Master these high-frequency interview questions

• Reverse Doubly Linked List
• Merge Two Sorted DLLs
• Flatten Multilevel DLL

Master these high-frequency interview questions

• Task Scheduler
• Subarray Sum Equals K
• Subarray Sum Divisible by K
• Count Subarrays with Sum K
• Longest Substring with At Most K Distinct Characters

Master these high-frequency interview questions

• Kth Largest Element in an Array
• Top K Frequent Elements
• Merge K Sorted Lists
• Find K Pairs with Smallest Sums
• Task Scheduler
• Power of X
• Merge Sort
• Palindrome Check
• Decode String
• Reverse a Stack (Recursive)
• Insert at Bottom of Stack

Master these high-frequency interview questions

• Subsets II
• Generate Parentheses
• Permutations II
• Palindrome Partitioning
• N-Queens
• Word Search II

Master these high-frequency interview questions

• Binary Tree Zigzag Level Order Traversal
• Binary Tree Right Side View
• Maximum Depth of Binary Tree
• Maximum Path Sum
• Lowest Common Ancestor of Binary Tree
• Serialize and Deserialize Binary Tree
• Construct Binary Tree from Preorder & Inorder
• Validate Binary Search Tree
• Convert Sorted Array to BST
• Delete Node in a BST
• Lowest Common Ancestor of BST

Master these high-frequency interview questions

• Course Schedule
• Course Schedule II
• Word Ladder
• Network Delay Time
• Minimum Cost to Connect All Cities
• Cheapest Flights Within K Stops
• Accounts Merge
• Evaluate Division (Union-Find)
• Pacific Atlantic Water Flow

Master these high-frequency interview questions

• 1. Jump Game II
• 2. Non-overlapping Intervals
• 3. Minimum Number of Arrows to Burst Balloons
• 4. Meeting Rooms II
• 6. Gas Station / Minimum Refueling Stops

Master these high-frequency interview questions

• Maximum Product Subarray
• Unique Paths II
• Maximum Path Sum in Grid
• Longest Common Subsequence
• Longest Palindromic Subsequence
• Edit Distance
• Burst Balloons
• Palindrome Partitioning II
• House Robber III
• Maximum Sum BST in Binary Tree
• Binary Tree Cameras
• Partition Equal Subset Sum
• Coin Change

Master these high-frequency interview questions

• Implement Trie (Prefix Tree)
• Add and Search Word
• Word Break

Master these high-frequency interview questions

• Missing Number
• Maximum XOR of Two Numbers in an Array
• Maximum XOR With an Element From Array