Greedy

Maximum Units on a Truck

Minimum Changes To Make Alternating Binary String

Split a String in Balanced Strings

Two City Scheduling

Apply Operations to Make Sum of Array Greater Than or Equal to k

ATM Machine

Bandwidth Contribution

Binge Watching

Break a Palindrome

Budget Spending (Travel Itinerary)

Can Convert String in K Moves

Character Reprogramming

Cinema Seat Allocation

Construct String With Repeat Limit

DI String Match

Divide Array in Sets of K Consecutive Numbers

Find Polygon With the Largest Perimeter

Find the Celebrity

Gas Station

Gem Card Purchases with Color Discounts

Gems Removal Optimization

Hand of Straights

Integer to Roman Numeral Conversion

Interesting Array

Jump Game

Least Number of Unique Integers after K Removals

Lexicographically Smallest Happy String

Max Difference by Changing an Integer

Maximize the MEX of an Array

Maximum Beauty of a String

Maximum Elements with Sum Less Than K

Maximum Subarray

Maximum Swap

Minimum Appends for Subsequence

Minimum Cost to Delete Characters to Make String Without 3 Identical Consecutive Letters

Minimum Deletions to Make Character Frequencies Unique

Minimum Domino Rotations For Equal Row

Minimum Health to Beat Game

Minimum Moves to Reach Target

Minimum Moves to Reach Target Score

Minimum Number of Food Buckets to Feed Hamsters

Minimum Number of Frogs Croaking

Minimum Partitions Required

Minimum Penalty for a Shop

Mr. Myers and the Exam

Partition Labels - Divide String into Maximum Parts with Unique Letters

Queue Reconstruction by Height

Reconstruct a 2-Row Binary Matrix

Remove Colored Pieces if Both Neighbors are the Same Color

Sequence Construction (Permutation Sum)

Smallest Number That Cannot Be Represented as Sum of Subsets

Split Concatenated Strings

Stock Profit Maximization

String Without AAA or BBB

Task Scheduler with Cooldown Period

Valid Parenthesis String

Wiggle Subsequence

Word Wrap

Assign Dashers

Candy

Make The Array Positive

Maximize Sum by Choosing from Two Arrays

Min Subsequence for Uniqueness

Minimum Number of Refueling Stops

N Queues Maximum Sum

Sequence Construction

Set Intersection Size At Least Two