Problems

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

Active:Premium· 770 results

Status	Title	Solution	Practice	Difficulty	Companies	Topics
	3400. Maximum Number of Matching Indices After Right Shifts	Solution	Solve	Medium	-	Array Simulation+1
	3391. Design a 3D Binary Matrix with Efficient Layer Tracking	Solution	Solve	Medium	Amdocs	Array Design+4
	3383. Minimum Runes to Add to Cast Spell	Solution	Solve	Hard	De Shaw	Array Breadth-First Search+4
	3422. Minimum Operations to Make Subarray Elements Equal	Solution	Solve	Medium	-	Array Hash Table+3
	3385. Minimum Time to Break Locks II	Solution	Solve	Hard	Ivp	Array Depth-First Search+1
	3879. Maximum Distinct Path Sum in a Binary Tree	Solution	Solve	Medium	-
	3888. Minimum Operations to Make All Grid Elements Equal	Solution	Solve	Hard	-
	3893. Maximum Team Size with Overlapping Intervals	Solution	Solve	Medium	-
	3902. Zigzag Level Sum of Binary Tree	Solution	Solve	Medium	-
	3907. Count Smaller Elements With Opposite Parity	Solution	Solve	Medium	-
	3916. Number of ZigZag Arrays III	Solution	Solve	Hard	-
	3929. Minimum Partition Score II	Solution	Solve	Hard	-
	3930. Power Update After K-th Largest Insertion II	Solution	Solve	Hard	-
	3935. Power Update After K-th Largest Insertion I	Solution	Solve	Medium	-
	3944. Minimum Operations to Make Array Modulo Alternating II	Solution	Solve	Hard	-
	3949. Subtree Inversion Sum II	Solution	Solve	Hard	-
	3958. Minimum Cost to Split into Ones II	Solution	Solve	Medium	-
	3972. Valid Subarrays With Matching Sum Digits II	Solution	Solve	Hard	-
	3967. Finish Time of Tasks II	Solution	Solve	Hard	-
	3973. Distinct Gate Paths to LCA	Solution	Solve	Hard	-

Maximum Number of Matching Indices After Right Shifts

Medium✓ Solution📹 Video

Array Simulation Two Pointers

Design a 3D Binary Matrix with Efficient Layer Tracking

Medium✓ Solution

Amdocs

Array Design Hash Table+3

Minimum Runes to Add to Cast Spell

Hard✓ Solution

De Shaw

Array Breadth-First Search Depth-First Search+3

Minimum Operations to Make Subarray Elements Equal

Medium✓ Solution

Array Hash Table Heap (Priority Queue)+2

Minimum Time to Break Locks II

Hard✓ Solution

Ivp

Array Depth-First Search Graph

Maximum Distinct Path Sum in a Binary Tree

Medium✓ Solution

Minimum Operations to Make All Grid Elements Equal

Hard✓ Solution

Maximum Team Size with Overlapping Intervals

Medium

Zigzag Level Sum of Binary Tree

Medium

Count Smaller Elements With Opposite Parity

Medium

Number of ZigZag Arrays III

Hard

Minimum Partition Score II

Hard

Power Update After K-th Largest Insertion II

Hard

Power Update After K-th Largest Insertion I

Medium

Minimum Operations to Make Array Modulo Alternating II

Hard

Subtree Inversion Sum II

Hard

Minimum Cost to Split into Ones II

Medium

Valid Subarrays With Matching Sum Digits II

Hard

Finish Time of Tasks II

Hard

Distinct Gate Paths to LCA

Hard