All DSA
Interview Guide
Greedy
Export PDF (0)
Flagged
Completed
Export PDF (0)
0%
Minimum Changes To Make Alternating Binary String
Junior
Split a String in Balanced Strings
Junior
Two City Scheduling
Junior
Apply Operations to Make Sum of Array Greater Than or Equal to k
Mid
ATM Machine
Mid
Bandwidth Contribution
Mid
Break a Palindrome
Mid
Budget Spending (Travel Itinerary)
Mid
Can Convert String in K Moves
Mid
Character Reprogramming
Mid
Construct String With Repeat Limit
Mid
DI String Match
Mid
Find the Celebrity
Mid
Gas Station
Mid
Gem Card Purchases with Color Discounts
Mid
Gems Removal Optimization
Mid
Integer to Roman Numeral Conversion
Mid
Jump Game
Mid
Max Difference by Changing an Integer
Mid
Maximize the MEX of an Array
Mid
Maximum Elements with Sum Less Than K
Mid
Maximum Subarray
Mid
Maximum Swap
Mid
Minimum Appends for Subsequence
Mid
Minimum Domino Rotations For Equal Row
Mid
Minimum Number of Food Buckets to Feed Hamsters
Mid
Minimum Partitions Required
Mid
Minimum Penalty for a Shop
Mid
Partition Labels - Divide String into Maximum Parts with Unique Letters
Mid
Queue Reconstruction by Height
Mid
Reconstruct a 2-Row Binary Matrix
Mid
Remove Colored Pieces if Both Neighbors are the Same Color
Mid
Sequence Construction (Permutation Sum)
Mid
Smallest Number That Cannot Be Represented as Sum of Subsets
Mid
Split Concatenated Strings
Mid
Stock Profit Maximization
Mid
String Without AAA or BBB
Mid
Task Scheduler with Cooldown Period
Mid
Valid Parenthesis String
Mid
Wiggle Subsequence
Mid
Word Wrap
Mid
Assign Dashers
Senior
Candy
Senior
Make The Array Positive
Senior
Maximize Sum by Choosing from Two Arrays
Senior
Min Subsequence for Uniqueness
Senior
Minimum Number of Refueling Stops
Senior
N Queues Maximum Sum
Senior
Sequence Construction
Senior
Set Intersection Size At Least Two
Senior
Task Scheduler II
Senior
Top 51 Greedy Interview Questions And Answers 2025 | TechPrep