Problems

3,898+ problems · 938 Easy · 2039 Medium · 921 Hard

Active:Hard· 921 results

Title	Solution	Practice	Difficulty	Companies	Topics
3725. Count Ways to Choose Coprime Integers from Rows	Solution	Solve	Hard	-	Array Combinatorics+4
3850. Count Sequences to K	Solution	Solve	Hard	-	Array Dynamic Programming+3
3777. Minimum Deletions to Make Alternating Substring	Solution	Solve	Hard	-	Segment Tree String
3729. Count Distinct Subarrays Divisible by K in Sorted Array	Solution	Solve	Hard	-	Array Hash Table+1
3785. Minimum Swaps to Avoid Forbidden Values	Solution	Solve	Hard	Amazon	Array Counting+2
3704. Count No-Zero Pairs That Sum to N	Solution	Solve	Hard	-	Dynamic Programming Math
3721. Longest Balanced Subarray II	Solution	Solve	Hard	Amazon+1	Array Divide and Conquer+3
3734. Lexicographically Smallest Palindromic Permutation Greater Than Target	Solution	Solve	Hard	-	Enumeration String+1
3710. Maximum Partition Factor	Solution	Solve	Hard	Gameskraft	Array Binary Search+4
3743. Maximize Cyclic Partition Score	Solution	Solve	Hard	Amazon+1	Array Dynamic Programming
3686. Number of Stable Subsequences	Solution	Solve	Hard	Google	Array Dynamic Programming
3677. Count Binary Palindromic Numbers	Solution	Solve	Hard	-	Bit Manipulation Math
3762. Minimum Operations to Equalize Subarrays	Solution	Solve	Hard	-	Array Binary Search+2
3695. Maximize Alternating Sum Using Swaps	Solution	Solve	Hard	Google	Array Greedy+2
3691. Maximum Total Subarray Value II	Solution	Solve	Hard	-	Array Greedy+2
3859. Count Subarrays With K Distinct Integers	Solution	Solve	Hard	-	Array Counting+2
3681. Maximum XOR of Subsequences	Solution	Solve	Hard	-	Array Bit Manipulation+2
3671. Sum of Beautiful Subsequences	Solution	Solve	Hard	Google+1	Array Binary Indexed Tree+2
3666. Minimum Operations to Equalize Binary String	Solution	Solve	Hard	Amazon	Breadth-First Search Math+3
3661. Maximum Walls Destroyed by Robots	Solution	Solve	Hard	Infosys	Array Binary Search+2
3655. XOR After Range Multiplication Queries II	Solution	Solve	Hard	Infosys	Array Divide and Conquer
3700. Number of ZigZag Arrays II	Solution	Solve	Hard	-	Dynamic Programming Math
3699. Number of ZigZag Arrays I	Solution	Solve	Hard	-	Dynamic Programming Prefix Sum
3715. Sum of Perfect Square Ancestors	Solution	Solve	Hard	Amazon+2	Array Counting+5
3640. Trionic Array II	Solution	Solve	Hard	Amazon+5	Array Dynamic Programming
3636. Threshold Majority Queries	Solution	Solve	Hard	Adobe+3	Array Binary Search+4
3646. Next Special Palindrome Number	Solution	Solve	Hard	Google	Backtracking Bit Manipulation
3624. Number of Integers With Popcount-Depth Equal to K II	Solution	Solve	Hard	-	Array Binary Indexed Tree+2
3614. Process String with Special Operations II	Solution	Solve	Hard	Google	Simulation String
3621. Number of Integers With Popcount-Depth Equal to K I	Solution	Solve	Hard	-	Bit Manipulation Combinatorics+2
3615. Longest Palindromic Path in Graph	Solution	Solve	Hard	-	Bit Manipulation Bitmask+3
3632. Subarrays with XOR at Least K	Solution	Solve	Hard	-	Array Bit Manipulation+2
3609. Minimum Moves to Reach Target in Grid	Solution	Solve	Hard	Bloomberg	Math
3605. Minimum Stability Factor of Array	Solution	Solve	Hard	Amazon	Array Binary Search+4
3620. Network Recovery Pathways	Solution	Solve	Hard	-	Array Binary Search+5
3590. Kth Smallest Path XOR Sum	Solution	Solve	Hard	-	Array Depth-First Search+2
3600. Maximize Spanning Tree Stability with Upgrades	Solution	Solve	Hard	-	Binary Search Graph+3
3585. Find Weighted Median Node in Tree	Solution	Solve	Hard	Google	Array Binary Search+4
3625. Count Number of Trapezoids II	Solution	Solve	Hard	Google+1	Array Geometry+2
3594. Minimum Time to Transport All Individuals	Solution	Solve	Hard	-	Array Bit Manipulation+4
3651. Minimum Cost Path with Teleportations	Solution	Solve	Hard	Amazon+3	Array Dynamic Programming+1
3574. Maximize Subarray GCD Score	Solution	Solve	Hard	Google	Array Enumeration+2
3549. Multiply Two Polynomials	Solution	Solve	Hard	-	Array Math
3630. Partition Array for Maximum XOR and AND	Solution	Solve	Hard	Google	Array Bit Manipulation+3
3569. Maximize Count of Distinct Primes After Split	Solution	Solve	Hard	-	Array Math+2
3575. Maximum Good Subtree Score	Solution	Solve	Hard	Infosys	Array Bit Manipulation+4
3563. Lexicographically Smallest String After Adjacent Removals	Solution	Solve	Hard	-	Dynamic Programming String
3579. Minimum Steps to Convert String with Operations	Solution	Solve	Hard	-	Dynamic Programming String
3526. Range XOR Queries with Subarray Reversals	Solution	Solve	Hard	-	Array Binary Tree+1
3544. Subtree Inversion Sum	Solution	Solve	Hard	-	Array Depth-First Search+2