Problems Topics Tags Progress

Search

Home

|

Tag

|

Hard

Problems with tag Hard

783 found, showing 450 to 480

...

16

...

;

Minimum Cost to Hire K Workers ->

Hard, #857, 2 solutions

Minimum Cost to Make at Least One Valid Path in a Grid ->

Hard, #1368, 2 solutions

Minimum Cost to Make Array Equal ->

Hard, #2448, 2 solutions

Minimum Cost to Merge Stones ->

Hard, #1000, 3 solutions

Minimum Cost to Reach Destination in Time ->

Hard, #1928, 2 solutions

Minimum Cost to Split an Array ->

Hard, #2547, 2 solutions

Minimum Cost Walk in Weighted Graph ->

Hard, #3108, 2 solutions

Minimum Costs Using the Train Line ->

Hard, #2361, 2 solutions

Minimum Degree of a Connected Trio in a Graph ->

Hard, #1761, 3 solutions

Minimum Deletions to Make Array Divisible ->

Hard, #2344, 2 solutions

Minimum Difference in Sums After Removal of Elements ->

Hard, #2163, 2 solutions

Minimum Difficulty of a Job Schedule ->

Hard, #1335, 3 solutions

Minimum Distance to Type a Word Using Two Fingers ->

Hard, #1320, 3 solutions

Minimum Edge Reversals So Every Node Is Reachable ->

Hard, #2858, 2 solutions

Minimum Edge Weight Equilibrium Queries in a Tree ->

Hard, #2846, 2 solutions

Minimum Falling Path Sum II ->

Hard, #1289, 2 solutions

Minimum Flips in Binary Tree to Get Result ->

Hard, #2313, 2 solutions

Minimum Incompatibility ->

Hard, #1681, 2 solutions

Minimum Initial Energy to Finish Tasks ->

Hard, #1665, 2 solutions

Minimum Insertion Steps to Make a String Palindrome ->

Hard, #1312, 2 solutions

Minimum Interval to Include Each Query ->

Hard, #1851, 3 solutions

Minimum Money Required Before Transactions ->

Hard, #2412, 2 solutions

Minimum Moves to Move a Box to Their Target Location ->

Hard, #1263, 2 solutions

Minimum Number of Coins for Fruits II ->

Hard, #2969, 2 solutions

Minimum Number of Days to Disconnect Island ->

Hard, #1568, 2 solutions

Minimum Number of Days to Eat N Oranges ->

Hard, #1553, 2 solutions

Minimum Number of Flips to Convert Binary Matrix to Zero Matrix ->

Hard, #1284, 2 solutions

Minimum Number of Increments on Subarrays to Form a Target Array ->

Hard, #1526, 2 solutions

Minimum Moves to Reach Target with Rotations ->

Hard, #1210, 2 solutions

Minimum Moves to Pick K Ones ->

Hard, #3086, 2 solutions