Problems

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

Active:MediumPremium· 460 results

Status	Title	Solution	Practice	Difficulty	Companies	Topics
	3535. Unit Conversion II	Solution	Solve	Medium	-	Array Breadth-First Search+3
	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
	3422. Minimum Operations to Make Subarray Elements Equal	Solution	Solve	Medium	-	Array Hash Table+3
	3879. Maximum Distinct Path Sum in a Binary Tree	Solution	Solve	Medium	-
	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	-
	3935. Power Update After K-th Largest Insertion I	Solution	Solve	Medium	-
	3958. Minimum Cost to Split into Ones II	Solution	Solve	Medium	-

Unit Conversion II

Medium

Array Breadth-First Search Depth-First Search+2

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 Operations to Make Subarray Elements Equal

Medium✓ Solution

Array Hash Table Heap (Priority Queue)+2

Maximum Distinct Path Sum in a Binary Tree

Medium✓ Solution

Maximum Team Size with Overlapping Intervals

Medium

Zigzag Level Sum of Binary Tree

Medium

Count Smaller Elements With Opposite Parity

Medium

Power Update After K-th Largest Insertion I

Medium

Minimum Cost to Split into Ones II

Medium