Talentd
For employersSign in
JobsInternshipsPracticeResume toolsCompaniesArticles
For employers
FleetCode
Make and follow sheets.Sign in

Problems

286 problems

Has videoPremium onlyReset
Array2,237String877Hash Table797Math691Dynamic Programming673Sorting508Greedy485Binary Search357Depth-First Search338Database308Bit Manipulation286Matrix279Tree264Breadth-First Search257Prefix Sum252All topics

286 results

Sign in to see which of these you have solved.Sign in
TitleSolutionAcceptDifficultyTopics
3621. Number of Integers With Popcount-Depth Equal to K IVideo
–23.0%Hard
Bit Manipulation, Combinatorics +2
3630. Partition Array for Maximum XOR and ANDVideo
–17.6%Hard
Array, Bit Manipulation +3· 1 company
3632. Subarrays with XOR at Least KPremium
–46.3%Hard
Array, Bit Manipulation +2
3644. Maximum K to Sort a PermutationVideo
Solution57.5%Medium
Array, Bit Manipulation· 1 company
3646. Next Special Palindrome NumberVideo
–28.0%Hard
Backtracking, Bit Manipulation· 1 company
3670. Maximum Product of Two Integers With No Common BitsVideo
–15.1%Medium
Array, Bit Manipulation +1
3674. Minimum Operations to Equalize ArrayVideo
Solution60.8%Easy
Array, Bit Manipulation +1
3677. Count Binary Palindromic NumbersVideo
–33.2%Hard
Bit Manipulation, Math
3681. Maximum XOR of SubsequencesVideo
–49.5%Hard
Array, Bit Manipulation +2
3688. Bitwise OR of Even Numbers in an ArrayVideo
Solution84.9%Easy
Array, Bit Manipulation +1· 2 companies
3702. Longest Subsequence With Non-Zero Bitwise XORVideo
Solution55.1%Medium
Array, Bit Manipulation
3750. Minimum Number of Flips to Reverse Binary StringVideo
Solution75.5%Easy
Bit Manipulation, Math +2
3755. Find Maximum Balanced XOR Subarray LengthVideo
Solution50.8%Medium
Array, Bit Manipulation +2
3757. Number of Effective SubsequencesVideo
–30.4%Hard
Array, Bit Manipulation +3
3766. Minimum Operations to Make Binary PalindromeVideo
Solution51.2%Medium
Array, Binary Search +2· 1 company
3801. Minimum Cost to Merge Sorted ListsVideo
Solution33.8%Hard
Array, Binary Search +3
3806. Maximum Bitwise AND After Increment OperationsVideo
Solution31.8%Hard
Array, Bit Manipulation +2· 1 company
3811. Number of Alternating XOR PartitionsVideo
Solution27.3%Medium
Array, Bit Manipulation +2
3821. Find Nth Smallest Integer With K One BitsVideo
Solution34.7%Hard
Bit Manipulation, Combinatorics +1· 1 company
3825. Longest Strictly Increasing Subsequence With Non-Zero Bitwise ANDVideo
Solution49.5%Medium
Array, Binary Search +2
3827. Count Monobit IntegersVideo
Solution66.0%Easy
Bit Manipulation, Enumeration· 1 company
3845. Maximum Subarray XOR with Bounded RangeVideo
Solution32.3%Hard
Array, Bit Manipulation +5
3849. Maximum Bitwise XOR After RearrangementVideo
Solution70.4%Medium
Bit Manipulation, Greedy +1
3858. Minimum Bitwise OR From GridVideo
Solution27.5%Medium
Array, Bit Manipulation +2· 1 company
3877. Minimum Removals to Achieve Target XORVideo
Solution41.2%Medium
Array, Bit Manipulation +1
3878. Count Good SubarraysVideo
Solution26.2%Hard
Array, Bit Manipulation +2· 3 companies
3882. Minimum XOR Path in a GridVideo
–39.5%Medium
Array, Bit Manipulation +2· 1 company
3910. Count Connected Subgraphs with Even Node SumVideo
Solution59.0%Hard
Array, Bit Manipulation +5
3950. Exactly One Consecutive Set Bits PairVideo
Solution50.4%Easy
Bit Manipulation
3954. Sum of Compatible Numbers in Range IVideo
Solution58.4%Easy
Bit Manipulation, Dynamic Programming +1
3955. Valid Binary Strings With Cost LimitVideo
Solution78.5%Medium
Backtracking, Bit Manipulation +2
4027. Elevator Requests IIIVideo
Solution45.7%Hard
Array, Bit Manipulation +3
4030. Check ASCII PalindromicVideo
Solution60.2%Easy
Bit Manipulation, String +1
4033. Valid K-Unique Subarrays IVideo
–34.8%Hard
Array, Binary Indexed Tree +4
4036. Lexicographically Largest String After Pair TransformationsVideo
Solution42.8%Medium
Array, Bit Manipulation +2
4059. Lexicographically Largest Power ArrayVideo
–24.9%Hard
Array, Bit Manipulation +1
Showing 251–286 of 286