Problems
Topics
Tags
Progress
Search
Open user menu
Open main menu
Home
|
Tag
|
Greedy
Problems with tag
Greedy
457 found, showing 30 to 60
1
2
3
...
15
16
;
Check If a String Can Break Another String
->
Medium,
#1433,
2 solutions
Check if a Parentheses String Can Be Valid
->
Medium,
#2116,
2 solutions
Check if All the Integers in a Range Are Covered
->
Easy,
#1893,
2 solutions
Check If String Is Transformable With Substring Sort Operations
->
Hard,
#1585,
2 solutions
Closest Fair Integer
->
Medium,
#2417,
2 solutions
Check if it is Possible to Split Array
->
Medium,
#2811,
2 solutions
Change Minimum Characters to Satisfy One of Three Conditions
->
Medium,
#1737,
2 solutions
Construct K Palindrome Strings
->
Medium,
#1400,
2 solutions
Construct Smallest Number From DI String
->
Medium,
#2375,
2 solutions
Construct String With Repeat Limit
->
Medium,
#2182,
2 solutions
Construct Target Array With Multiple Sums
->
Hard,
#1354,
2 solutions
Construct the Longest New String
->
Medium,
#2745,
2 solutions
Cinema Seat Allocation
->
Medium,
#1386,
2 solutions
Container With Most Water
->
Medium,
#11,
5 solutions
Continuous Subarray Sum
->
Medium,
#523,
4 solutions
Count Number of Homogenous Substrings
->
Medium,
#1759,
3 solutions
Couples Holding Hands
->
Hard,
#765,
3 solutions
Course Schedule III
->
Hard,
#630,
3 solutions
Count K-Subsequences of a String With Maximum Beauty
->
Hard,
#2842,
2 solutions
Count Pairs of Equal Substrings With Minimum Difference
->
Medium,
#1794,
2 solutions
Cracking the Safe
->
Hard,
#753,
3 solutions
Decrease Elements To Make Array Zigzag
->
Medium,
#1144,
2 solutions
Binary Represention
->
Hard,
#180,
2 solutions
Create Components With Same Value
->
Hard,
#2440,
2 solutions
Destroying Asteroids
->
Medium,
#2126,
2 solutions
Create Maximum Number
->
Hard,
#321,
4 solutions
Delete Columns to Make Sorted II
->
Medium,
#955,
2 solutions
Determine the Minimum Sum of a k-avoiding Array
->
Medium,
#2829,
2 solutions
DI String Match
->
Easy,
#942,
2 solutions
Design an ATM Machine
->
Medium,
#2241,
2 solutions