Greedy Interview Questions
373 real interview questions test Greedy. Practice any of them in the code editor and get AI feedback on your solution.
- Junior12% (44)
- Mid/Senior67% (249)
- Staff21% (80)
Companies that ask Greedy the most
Questionspage 4 of 4
- Earliest Possible Day of Full Bloom1 companyStaff
- Removing Minimum Number of Magic Beans1 companyMid/Senior
- Maximum Split of Positive Even Integers1 companyMid/Senior
- Maximize the Topmost Element After K Moves1 companyMid/Senior
- Maximize Number of Subsequences in a String1 companyMid/Senior
- Minimum Deletions to Make Array Beautiful1 companyMid/Senior
- Minimum Number of Operations to Convert Time1 companyJunior
- Maximum Total Beauty of the Gardens1 companyStaff
- Maximum Bags With Full Capacity of Rocks1 companyMid/Senior
- Minimum Amount of Time to Fill Cups1 companyJunior
- Shortest Impossible Sequence of Rolls1 companyStaff
- Maximum Number of Groups Entering a Competition1 companyMid/Senior
- Minimum Hours of Training to Win a Competition1 companyJunior
- Minimum Money Required Before Transactions1 companyStaff
- Minimum Total Cost to Make Arrays Unequal1 companyStaff
- Minimum Operations to Make Array Equal II1 companyMid/Senior
- Find the String with LCP1 companyStaff
- Minimum Time to Complete All Tasks1 companyStaff
- Mice and Cheese1 companyMid/Senior
- Maximum Sum With Exactly K Elements1 companyJunior
- Make Costs of Paths Equal in a Binary Tree1 companyMid/Senior
- Buy Two Chocolates1 companyJunior
- Minimum Cost to Make All Characters Equal1 companyMid/Senior
- Maximum Number of Groups With Increasing Length1 companyStaff
- Check if it is Possible to Split Array1 companyMid/Senior
- Determine the Minimum Sum of a k-avoiding Array1 companyMid/Senior
- Find the Minimum Possible Sum of a Beautiful Array1 companyMid/Senior
- Minimum Operations to Form Subsequence With Target Sum1 companyStaff
- Count K-Subsequences of a String With Maximum Beauty1 companyStaff
- Minimum Array Length After Pair Removals1 companyMid/Senior
- Apply Operations on Array to Maximize Sum of Squares1 companyStaff
- Longest Unequal Adjacent Groups Subsequence I1 companyJunior
- Minimum Number of Groups to Create a Valid Assignment1 companyMid/Senior
- Remove Adjacent Almost-Equal Characters1 companyMid/Senior
- Minimum Cost to Make Array Equalindromic1 companyMid/Senior
- Find Polygon With the Largest Perimeter1 companyMid/Senior
- Minimize OR of Remaining Elements Using Operations1 companyStaff
- Replace Question Marks in String to Minimize Its Value1 companyMid/Senior
- Minimum Moves to Pick K Ones1 companyStaff
- Lexicographically Smallest String After Operations With Constraint1 companyMid/Senior
- Minimum Operations to Make Median of Array Equal to K1 companyMid/Senior
- Minimum Rectangles to Cover Points1 companyMid/Senior
- Minimum Operations to Make Binary Array Elements Equal to One II1 companyMid/Senior
- Maximum Points After Enemy Battles1 companyMid/Senior
- Lexicographically Smallest String After a Swap1 companyJunior
- Minimum Amount of Damage Dealt to Bob1 companyStaff
- Minimum Number of Valid Strings to Form Target I1 companyMid/Senior
- Minimize the Maximum Adjacent Element Difference1 companyStaff
- Minimum Operations to Make Columns Strictly Increasing1 companyJunior
- Eat Pizzas!1 companyMid/Senior
- Select K Disjoint Special Substrings1 companyMid/Senior
- Make Array Non-decreasing1 companyMid/Senior
- Path Existence Queries in a Graph II1 companyStaff
- Maximum Sum of Edge Values in a Graph1 companyStaff
- Find Maximum Number of Non Intersecting Substrings1 companyMid/Senior
- Maximize Y‑Sum by Picking a Triplet of Distinct X‑Values1 companyMid/Senior
- Minimum Stability Factor of Array1 companyStaff
- Maximum Number of Subsequences After One Inserting1 companyMid/Senior
- Partition Array for Maximum XOR and AND1 companyStaff
- Maximum Balanced Shipments1 companyMid/Senior
- Generate Schedule1 companyMid/Senior
- Maximize Alternating Sum Using Swaps1 companyStaff
- Maximize Sum of Squares of Digits1 companyMid/Senior
- Maximize Points After Choosing K Tasks1 companyMid/Senior
- Minimum Moves to Balance Circular Array1 companyMid/Senior
- Maximum Sum of Three Numbers Divisible by Three1 companyMid/Senior
- Maximum Score After Binary Swaps1 companyMid/Senior
- Minimum Swaps to Avoid Forbidden Values1 companyStaff
- Maximum Bitwise AND After Increment Operations1 companyStaff
- Minimum Bitwise OR From Grid1 companyMid/Senior
- Minimum Increase to Maximize Special Indices1 companyMid/Senior
- Minimum Operations to Make Array Non Decreasing1 companyMid/Senior
- Minimize Array Sum Using Divisible Replacements1 companyMid/Senior