Start Learning

Greedy

Practice Greedy problems for coding interviews.

0/10

completed

Easy O(N log N + M log M)

Maximum Units on a Truck

Easy O(N log N)

Split a String in Balanced Strings

Easy O(N)

Medium O(N)

Hand of Straights

Medium O(N log N)

Medium O(N)

Medium O(N)

Merge Triplets to Form Target Triplet

Medium O(N)

Two City Scheduling

Medium O(N log N)

Valid Parenthesis String

Medium O(N)