Problems

3,947+ problems · 946 Easy · 2062 Medium · 939 Hard

Active:Medium· 2062 results

Status	Title	Solution	Practice	Difficulty	Companies	Topics
	3952. Maximum Total Value of Covered Indices	Solution	Solve	Medium	-	Array Dynamic Programming+2
	3958. Minimum Cost to Split into Ones II	Solution	Solve	Medium	-
	3960. Frequency Balance Subarray	Solution	Solve	Medium	-
	3961. Maximize Sum of Device Ratings	Solution	Solve	Medium	-
	3968. Maximum Manhattan Distance After All Moves	Solution	Solve	Medium	-	Counting Math+1
	3964. Minimum Lights to Illuminate a Road	Solution	Solve	Medium	-
	3969. Valid Subarrays With Matching Sum Digits I	Solution	Solve	Medium	-	Array Enumeration+3
	3970. Shortest Path With At Most K Consecutive Identical Characters	Solution	Solve	Medium	-	Graph Heap (Priority Queue)+2
	3965. Finish Time of Tasks I	Solution	Solve	Medium	-
	3974. Maximum Total Sum of K Selected Elements	Solution	Solve	Medium	-	Array Greedy+1
	3976. Maximum Subarray Sum After Multiplier	Solution	Solve	Medium	-	Array Dynamic Programming
	3975. Filter Occupied Intervals	Solution	Solve	Medium	-	Array Sorting

Maximum Total Value of Covered Indices

Medium

Array Dynamic Programming Greedy+1

Minimum Cost to Split into Ones II

Medium

Frequency Balance Subarray

Medium

Maximize Sum of Device Ratings

Medium

Maximum Manhattan Distance After All Moves

Medium

Counting Math String

Minimum Lights to Illuminate a Road

Medium

Valid Subarrays With Matching Sum Digits I

Medium

Array Enumeration Hash Table+2

Shortest Path With At Most K Consecutive Identical Characters

Medium

Graph Heap (Priority Queue)Shortest Path+1

Finish Time of Tasks I

Medium

Maximum Total Sum of K Selected Elements

Medium

Array Greedy Sorting

Maximum Subarray Sum After Multiplier

Medium

Array Dynamic Programming

Filter Occupied Intervals

Medium