#greedy

Most distinct values after shifting each element by at most k

CodingMedium

▲ 00 solutions

Build a target string from the fewest substrings of a source

CodingHard

▲ 00 solutions

Least-loaded task assignment with worker specialties

CodingMedium

▲ 01 solution

Minimum daily reading pace to finish a textbook

CodingMedium

▲ 01 solution

Rearrange a string so no neighbours match

CodingEasy

▲ 01 solution

Fewest lines to wrap a sentence

CodingEasy

▲ 01 solution

Smallest palindrome from a symmetric string's letters

CodingMedium

▲ 01 solution

Shift security units left to protect the most population

CodingMedium

▲ 01 solution

Remove items so any k prices stay under a threshold

CodingEasy

▲ 01 solution

Rearrange house numbers into sorted, duplicate-free neighborhoods

CodingMedium

▲ 01 solution

Max purchases from a sorted price row

CodingMedium

▲ 01 solution

Refund allocation across prioritized payment methods

CodingMedium

▲ 01 solution

Minimum cost to clear a binary array with k-wide windows

CodingMedium

▲ 01 solution

Minimum swaps to put evens before odds

CodingEasy

▲ 01 solution

Minimum adjacent swaps to group red balls

CodingMedium

▲ 01 solution

Minimum starting battery for a task queue

CodingEasy

▲ 01 solution

Single-direction stock rebalancing on a ring

CodingMedium

▲ 01 solution

Minimum flips to make every row and column a palindrome

CodingMedium

▲ 01 solution

Fewest coins that cover every amount up to a limit

CodingMedium

▲ 01 solution

Shortest equal length for two boards covering every hole

CodingMedium

▲ 01 solution

Fewest global replacements to group equal values

CodingHard

▲ 01 solution

Maximize pipeline throughput within a scaling budget

CodingMedium

▲ 01 solution

Maximum profit from unit-time tasks with deadlines

CodingMedium

▲ 01 solution

Maximum stability of a server group

CodingMedium

▲ 01 solution

Best k-day run in a cyclic sprint schedule

CodingMedium

▲ 01 solution

Pick the most profitable repeated query

CodingEasy

▲ 01 solution

Split parcels into the most balanced shipments

CodingMedium

▲ 01 solution

Maximum combination health of AI modules

CodingMedium

▲ 01 solution

Fit the most tasks into an hour across machine slots

CodingMedium

▲ 01 solution

Maximize total cluster throughput from median-of-three servers

CodingEasy

▲ 01 solution

Maximize the minimum asset value within an upgrade budget

CodingMedium

▲ 01 solution

Largest number by changing up to k digits to 5

CodingEasy

▲ 01 solution

Maximize minus signs with positive prefix sums

CodingMedium

▲ 01 solution

Assign node labels to maximize the total edge sum

CodingMedium

▲ 01 solution

Max flight distance with limited energy

CodingHard

▲ 01 solution

Longest ON run with k range flips

CodingHard

▲ 01 solution

Minimum range boosts to make server power non-decreasing

CodingEasy

▲ 01 solution

Fewest decrements to make an array a 1-to-k-to-1 pyramid

CodingMedium

▲ 01 solution

Crack a 4-digit code from exact-match counts

CodingHard

▲ 01 solution

Gift delivery scheduler with limited agents

CodingHard

▲ 01 solution

Best starting layer for a falling ball with an energy budget

CodingHard

▲ 01 solution

Fuel station queue with three dispensers

CodingMedium

▲ 01 solution

Justify articles to a fixed line width

CodingMedium

▲ 01 solution

Fewest range increments to build a target array

CodingEasy

▲ 01 solution

Fewest append-to-end moves to reverse a binary image

CodingMedium

▲ 01 solution

Greatest three-digit subsequence

CodingEasy

▲ 01 solution

Password similarity under cyclic character bumps

CodingMedium

▲ 01 solution

Build the longest spike from an array

CodingMedium

▲ 01 solution

Smallest number from a set of digits, with a lower bound

CodingHard

▲ 01 solution

Longest palindrome from equal-length words

CodingMedium

▲ 01 solution

Build a weighted binary tree from character counts

CodingMedium

▲ 01 solution

Take down servers in a reliability drill with minimum total requests

CodingMedium

▲ 01 solution

Lexicographically largest output from a spreading availability mask

CodingEasy

▲ 01 solution

Greedy longest-match tokenizer

CodingMedium

▲ 01 solution

Shard rebalancing with a per-key replica limit

CodingMedium

▲ 01 solution

Merge known bigrams in a sentence, leftmost first

CodingEasy

▲ 01 solution

Cross the most walls on a number line with limited energy

CodingMedium

▲ 01 solution

Data labeling scheduler with prefix-balanced models

CodingMedium

▲ 01 solution