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

3640. Trionic Array IIVideo

Solution47.3%Hard

Array, Dynamic Programming· 6 companies

3651. Minimum Cost Path with TeleportationsVideo

Solution45.1%Hard

Array, Dynamic Programming +1· 4 companies

3654. Minimum Sum After Divisible Sum DeletionsVideo

–45.9%Medium

Array, Dynamic Programming +2

3660. Jump Game IXVideo

Solution46.1%Medium

Array, Dynamic Programming· 4 companies

3661. Maximum Walls Destroyed by RobotsVideo

Solution48.0%Hard

Array, Binary Search +2· 3 companies

3665. Twisted Mirror Path CountVideo

–47.5%Medium

Array, Dynamic Programming +1· 2 companies

3670. Maximum Product of Two Integers With No Common BitsVideo

–15.1%Medium

Array, Bit Manipulation +1

3685. Subsequence Sum After Capping ElementsVideo

–25.2%Medium

Array, Dynamic Programming +2· 1 company

3686. Number of Stable SubsequencesVideo

–58.9%Hard

Array, Dynamic Programming· 1 company

3693. Climbing Stairs IIVideo

Solution63.9%Medium

Array, Dynamic Programming

3699. Number of ZigZag Arrays IVideo

Solution50.2%Hard

Dynamic Programming, Prefix Sum· 5 companies

3700. Number of ZigZag Arrays IIVideo

Solution67.7%Hard

Dynamic Programming, Math· 3 companies

3704. Count No-Zero Pairs That Sum to NVideo

Solution15.6%Hard

Dynamic Programming, Math

3725. Count Ways to Choose Coprime Integers from RowsVideo

–46.8%Hard

Array, Combinatorics +4

3738. Longest Non-Decreasing Subarray After Replacing at Most One ElementVideo

Solution23.5%Medium

Array, Dynamic Programming· 1 company

3742. Maximum Path Score in a GridVideo

Solution53.7%Medium

Array, Dynamic Programming +1· 2 companies

3743. Maximize Cyclic Partition ScoreVideo

–14.5%Hard

Array, Dynamic Programming· 2 companies

3747. Count Distinct Integers After Removing ZerosVideo

Solution23.1%Medium

Dynamic Programming, Math· 1 company

3751. Total Waviness of Numbers in Range IVideo

Solution86.9%Medium

Dynamic Programming, Enumeration +1· 2 companies

3753. Total Waviness of Numbers in Range IIVideo

Solution56.2%Hard

Dynamic Programming, Math· 4 companies

3757. Number of Effective SubsequencesVideo

–30.4%Hard

Array, Bit Manipulation +3

3772. Maximum Subgraph Score in a TreeVideo

–65.4%Hard

Array, Depth-First Search +2· 1 company

3791. Number of Balanced Integers in a RangeVideo

Solution35.0%Hard

Dynamic Programming

3797. Count Routes to Climb a Rectangular GridVideo

–23.1%Hard

Array, Dynamic Programming +2· 1 company

3801. Minimum Cost to Merge Sorted ListsVideo

Solution33.8%Hard

Array, Binary Search +3

3811. Number of Alternating XOR PartitionsVideo

Solution27.3%Medium

Array, Bit Manipulation +2

3826. Minimum Partition ScoreVideo

–32.6%Hard

Array, Divide and Conquer +4

3830. Longest Alternating Subarray After Removing At Most One ElementVideo

Solution30.9%Hard

Array, Dynamic Programming +1

3836. Maximum Score Using Exactly K PairsVideo

Solution41.4%Hard

Array, Dynamic Programming

3840. House Robber VVideo

Solution53.3%Medium

Array, Dynamic Programming

3844. Longest Almost-Palindromic SubstringVideo

Solution22.8%Medium

Dynamic Programming, String +1

3850. Count Sequences to KVideo

Solution35.6%Hard

Array, Dynamic Programming +3· 2 companies

3857. Minimum Cost to Split into OnesVideo

Solution82.6%Medium

Dynamic Programming, Math· 1 company

3869. Count Fancy Numbers in a RangeVideo

Solution26.6%Hard

Dynamic Programming, Math

3877. Minimum Removals to Achieve Target XORVideo

Solution41.2%Medium

Array, Bit Manipulation +1

3882. Minimum XOR Path in a GridVideo

–39.5%Medium

Array, Bit Manipulation +2· 1 company

3883. Count Non Decreasing Arrays With Given Digit SumsVideo

–40.3%Hard

Array, Dynamic Programming +1· 1 company

3891. Minimum Increase to Maximize Special IndicesVideo

Solution19.8%Medium

Array, Dynamic Programming +2· 1 company

3892. Minimum Operations to Achieve At Least K PeaksVideo

–29.8%Hard

Array, Dynamic Programming

3906. Count Good Integers on a Grid PathVideo

Solution45.8%Hard

Dynamic Programming

3915. Maximum Sum of Alternating Subsequence With Distance at Least KVideo

Solution30.7%Hard

Array, Dynamic Programming +1· 1 company

3938. Maximum Path Intersection Sum in a GridVideo

–25.6%Medium

Array, Dynamic Programming +2

3939. Count Non Adjacent Subsets in a Rooted TreeVideo

–51.7%Hard

Array, Depth-First Search +2· 1 company

3946. Maximum Number of Items From Sale IVideo

Solution37.3%Medium

Array, Dynamic Programming +1· 1 company

3952. Maximum Total Value of Covered IndicesVideo

–28.5%Medium

Array, Dynamic Programming +2· 1 company

3954. Sum of Compatible Numbers in Range IVideo

Solution58.4%Easy

Bit Manipulation, Dynamic Programming +1

3956. Maximum Sum of M Non-Overlapping Subarrays IVideo

–26.3%Hard

Array, Binary Search +5

3957. Maximum Sum of M Non-Overlapping Subarrays IIVideo

–16.6%Hard

Array, Binary Search +5

3965. Finish Time of Tasks IVideo

Solution60.3%Medium

Array, Depth-First Search +2

3966. Count Good Integers in a RangeVideo

–49.8%Hard

Dynamic Programming, Math

Showing 601–650 of 666