Skip to content

For employers Sign in

Make and follow sheets.Sign in

Problems

985 problems

Has video Premium only Reset

Array578 Dynamic Programming332 String191 Math187 Binary Search136 Hash Table134 Sorting106 Greedy104 Bit Manipulation103 Graph96 Depth-First Search91 Heap (Priority Queue)78 Prefix Sum77 Matrix75 Breadth-First Search71 All topics

Hard · 985 results

Sign in to see which of these you have solved.Sign in

TitleSolutionAcceptDifficultyTopics

3985. Palindromic Subarray SumVideo

–34.6%Hard

Array, Binary Search +2

3989. Maximum Consistent Columns in a GridVideo

–68.7%Hard

Array, Dynamic Programming +1

3990. Create Grid With Exactly K Paths IIPremium

–64.4%Hard

–

3995. Minimum Cost to Convert String IIIVideo

–55.6%Hard

Array, Dynamic Programming +1

3999. Minimum Number of String Groups Through TransformationsVideo

–47.9%Hard

Hash Table, String +1

4003. Minimum Cost Path with Alternating Directions IIIVideo

Solution61.4%Hard

Array, Graph +3

4004. Minimum Moves to Balance Circular Array IIPremium

Solution60.1%Hard

–

4005. Minimum Operations to Make Array Equal IIIPremium

–26.3%Hard

–

4007. Widest Possible FenceVideo

Solution16.9%Hard

Array, Counting +2

4009. Minimum Possible Maximum Waiting TimeVideo

–29.9%Hard

Array, Dynamic Programming +1

4013. Count Subarrays With Even Odd Ratio IIVideo

Solution40.9%Hard

Array, Binary Indexed Tree +4

4017. Peaks in Array IIVideo

–28.4%Hard

Array, Divide and Conquer +1

4018. Total Sum of Interaction Cost in Tree Groups IIPremium

–67.5%Hard

–

4023. Elevator Requests IIVideo

–27.6%Hard

Array, Dynamic Programming +1

4027. Elevator Requests IIIVideo

Solution45.7%Hard

Array, Bit Manipulation +3

4028. Minimum Operations to Make a Rotated Palindrome IIPremium

Solution65.8%Hard

–

4029. Elevator Requests IVVideoPremium

Solution58.3%Hard

–

4033. Valid K-Unique Subarrays IVideo

–34.8%Hard

Array, Binary Indexed Tree +4

4037. Maximum Valid Split Positions IIVideo

Solution32.2%Hard

Array, Enumeration +2

4041. Minimum Operations to Form Subset Sum IIVideo

Solution49.3%Hard

Array, Dynamic Programming

4042. Valid K-Unique Subarrays IIPremium

–68.5%Hard

–

4046. Minimum Cost Path With At Most K TurnsVideo

–53.9%Hard

Array, Graph +3

4047. Minimum Operations to Make XOR of All Elements ZeroPremium

–56.7%Hard

–

4051. Count Subarrays with Distant SumsVideo

Solution32.8%Hard

Array, Binary Indexed Tree +3

4055. Count Shadow Pairs II

–18.7%Hard

Array, Binary Indexed Tree +6

4059. Lexicographically Largest Power ArrayVideo

–24.9%Hard

Array, Bit Manipulation +1

4060. Count Evenly Good IntegersPremium

Solution78.8%Hard

–

4064. Longest Subarray Divisible by K with At Most One Negation IIVideo

Solution24.7%Hard

Array, Binary Search +2

4068. Maximize Meeting Earnings with Idle GapsVideo

Solution39.0%Hard

Array, Binary Search +2

4073. Count Good StringsVideo

–46.8%Hard

–

4077. Minimize Inversions in a Prefix TreeVideo

–38.4%Hard

–

4081. Prime Subset Selection IIVideo

–40.9%Hard

–

4082. Minimum Operations to Stabilize a Binary TreePremium

–62.9%Hard

–

4086. Minimum Interval Selection to Cover Target IntervalsVideo

Solution34.0%Hard

–

4091. Count Magical Substring Pairs IIVideo

–34.0%Hard

–

Showing 951–985 of 985