Skip to content

For employers Sign in

Make and follow sheets.Sign in

Problems

666 problems

Has video Premium only Reset

Array2,209 String870 Hash Table786 Math682 Dynamic Programming666 Sorting504 Greedy480 Binary Search352 Depth-First Search335 Database303 Bit Manipulation283 Matrix278 Tree261 Breadth-First Search255 Two Pointers249 All topics

With video · 666 results

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

TitleSolutionAcceptDifficultyTopics

2867. Count Valid Paths in a TreeVideo

Solution36.2%Hard

Depth-First Search, Dynamic Programming +3· 1 company

2876. Count Visited Nodes in a Directed GraphVideo

Solution31.6%Hard

Dynamic Programming, Graph +1· 1 company

2892. Minimizing Array After Replacing Pairs With Their ProductVideoPremium

Solution40.6%Medium

Array, Dynamic Programming +1· 1 company

2896. Apply Operations to Make Two Strings EqualVideo

Solution27.7%Medium

Dynamic Programming, String· 1 company

2900. Longest Unequal Adjacent Groups Subsequence IVideo

Solution67.0%Easy

Array, Dynamic Programming +2· 1 company

2901. Longest Unequal Adjacent Groups Subsequence IIVideo

Solution51.4%Medium

Array, Dynamic Programming +1· 2 companies

2902. Count of Sub-Multisets With Bounded SumVideo

Solution22.3%Hard

Array, Dynamic Programming +2

2911. Minimum Changes to Make K Semi-palindromesVideo

Solution35.3%Hard

Dynamic Programming, String +1

2915. Length of the Longest Subsequence That Sums to TargetVideo

Solution40.0%Medium

Array, Dynamic Programming· 3 companies

2916. Subarrays Distinct Element Sum of Squares IIVideo

Solution54.8%Hard

Array, Binary Indexed Tree +2· 1 company

2919. Minimum Increment Operations to Make Array BeautifulVideo

Solution34.7%Medium

Array, Dynamic Programming· 1 company

2920. Maximum Points After Collecting Coins From All NodesVideo

Solution36.6%Hard

Array, Bit Manipulation +3· 1 company

2925. Maximum Score After Applying Operations on a TreeVideo

Solution47.2%Medium

Depth-First Search, Dynamic Programming +1· 1 company

2926. Maximum Balanced Subsequence SumVideo

Solution25.8%Hard

Array, Binary Indexed Tree +3· 1 company

2930. Number of Strings Which Can Be Rearranged to Contain SubstringVideo

Solution57.0%Medium

Combinatorics, Dynamic Programming +1· 1 company

2944. Minimum Number of Coins for FruitsVideo

Solution49.6%Medium

Array, Dynamic Programming +3

2945. Find Maximum Non-decreasing Array LengthVideo

Solution19.2%Hard

Array, Binary Search +5· 4 companies

2957. Remove Adjacent Almost-Equal CharactersVideo

Solution53.6%Medium

Dynamic Programming, Greedy +1· 1 company

2969. Minimum Number of Coins for Fruits IIVideoPremium

Solution49.2%Hard

Array, Dynamic Programming +3

2973. Find Number of Coins to Place in Tree NodesVideo

Solution37.4%Hard

Depth-First Search, Dynamic Programming +3· 1 company

2977. Minimum Cost to Convert String IIVideo

Solution59.1%Hard

Array, Dynamic Programming +4· 4 companies

2979. Most Expensive Item That Can Not Be BoughtVideoPremium

Solution80.2%Medium

Dynamic Programming, Math +1· 1 company

2992. Number of Self-Divisible PermutationsVideoPremium

Solution72.0%Medium

Array, Backtracking +3· 1 company

2998. Minimum Number of Operations to Make X and Y EqualVideo

Solution48.4%Medium

Breadth-First Search, Dynamic Programming +1· 2 companies

2999. Count the Number of Powerful IntegersVideo

Solution46.3%Hard

Dynamic Programming, Math +1· 5 companies

3003. Maximize the Number of Partitions After OperationsVideo

Solution53.5%Hard

Bit Manipulation, Bitmask +2· 1 company

3004. Maximum Subtree of the Same ColorVideoPremium

Solution59.2%Medium

Array, Depth-First Search +2· 2 companies

3007. Maximum Number That Sum of the Prices Is Less Than or Equal to KVideo

Solution38.4%Medium

Binary Search, Bit Manipulation +1· 2 companies

3018. Maximum Number of Removal Queries That Can Be Processed IVideoPremium

Solution44.8%Hard

Array, Dynamic Programming

3032. Count Numbers With Unique Digits IIVideoPremium

Solution87.4%Easy

Dynamic Programming, Hash Table +1· 1 company

3040. Maximum Number of Operations With the Same Score IIVideo

Solution34.1%Medium

Array, Dynamic Programming +1· 1 company

3041. Maximize Consecutive Elements in an Array After ModificationVideo

Solution33.7%Hard

Array, Dynamic Programming +1· 1 company

3068. Find the Maximum Sum of Node ValuesVideo

Solution69.5%Hard

Array, Bit Manipulation +4· 4 companies

3077. Maximum Strength of K Disjoint SubarraysVideo

Solution28.2%Hard

Array, Dynamic Programming +1· 2 companies

3082. Find the Sum of the Power of All SubsequencesVideo

Solution38.7%Hard

Array, Dynamic Programming· 2 companies

3098. Find the Sum of Subsequence PowersVideo

Solution25.1%Hard

Array, Dynamic Programming +1· 1 company

3117. Minimum Sum of Values by Dividing ArrayVideo

Solution28.5%Hard

Array, Binary Search +4· 1 company

3122. Minimum Number of Operations to Satisfy ConditionsVideo

Solution42.4%Medium

Array, Dynamic Programming +1· 1 company

3129. Find All Possible Stable Binary Arrays IVideo

Solution53.8%Medium

Dynamic Programming, Prefix Sum· 3 companies

3130. Find All Possible Stable Binary Arrays IIVideo

Solution58.4%Hard

Dynamic Programming, Prefix Sum· 2 companies

3135. Equalize Strings by Adding or Removing Characters at EndsVideoPremium

Solution56.8%Medium

Binary Search, Dynamic Programming +3· 1 company

3144. Minimum Substring Partition of Equal Character FrequencyVideo

Solution40.5%Medium

Counting, Dynamic Programming +2· 4 companies

3148. Maximum Difference Score in a GridVideo

Solution48.4%Medium

Array, Dynamic Programming +1· 1 company

3149. Find the Minimum Cost Array PermutationVideo

Solution26.1%Hard

Array, Bit Manipulation +2· 1 company

3154. Find Number of Ways to Reach the K-th StairVideo

Solution38.2%Hard

Bit Manipulation, Combinatorics +3· 1 company

3165. Maximum Sum of Subsequence With Non-adjacent ElementsVideo

Solution15.7%Hard

Array, Divide and Conquer +2· 2 companies

3176. Find the Maximum Length of a Good Subsequence IVideo

Solution32.6%Medium

Array, Dynamic Programming +1· 1 company

3177. Find the Maximum Length of a Good Subsequence IIVideo

Solution25.2%Hard

Array, Dynamic Programming +1· 1 company

3180. Maximum Total Reward Using Operations IVideo

Solution30.8%Medium

Array, Dynamic Programming· 1 company

3181. Maximum Total Reward Using Operations IIVideo

Solution21.9%Hard

Array, Bit Manipulation +1· 1 company

Showing 451–500 of 666