Data Structures & AlgorithmsProblems Catalog Data Structures & AlgorithmsFilterSortProblemSectionDiff3483.Unique 3-Digit Even NumbersLEETCODEmathEASYTrailing zeroes in factorialGEEKSFORGEEKSmathEASY1837.Sum of Digits in Base KLEETCODEmathEASY13.Roman to IntegerLEETCODEmathEASYRoman Number to IntegerGEEKSFORGEEKSmathEASY7.Reverse IntegerLEETCODEmathMED598.Range Addition IILEETCODEmathEASY326.Power of ThreeLEETCODEmathEASY9.Palindrome NumberLEETCODEmathEASY12.Integer to RomanLEETCODEmathMED273.Integer to English WordsLEETCODEmathHARD3602.Hexadecimal and Hexatrigesimal ConversionLEETCODEmathEASY168.Excel Sheet Column TitleLEETCODEmathEASY171.Excel Sheet Column NumberLEETCODEmathEASYDecimal to binaryGEEKSFORGEEKSmathEASYConvert Decimal Number to Binary NumberEDUCATIVE.IOmathBASICCount Digits in a NumberGEEKSFORGEEKSmathEASYCount the Number of Digits in an IntegerEDUCATIVE.IOmathBASICCount Commas in RangeLEETCODEmathEASY405.Convert a Number to HexadecimalLEETCODEmathEASY1780.Check if Number is a Sum of Powers of ThreeLEETCODEmathMED504.Base 7LEETCODEmathEASY258.Add DigitsLEETCODEmathEASY448.Find All Numbers Disappeared in an ArrayLEETCODEbit-manipulation / bitmask-setsEASY442.Find All Duplicates in an ArrayLEETCODEbit-manipulation / bitmask-setsMED41.First Missing PositiveLEETCODEbit-manipulation / bitmask-setsHARD3173.Bitwise OR of Adjacent ElementsLEETCODEbit-manipulation / bitmask-setsEASY2917.Find the K-or of an ArrayLEETCODEbit-manipulation / bitmask-setsEASY2869.Minimum Operations to Collect ElementsLEETCODEbit-manipulation / bitmask-setsEASY2657.Find the Prefix Common Array of Two ArraysLEETCODEbit-manipulation / bitmask-setsMED2351.First Letter to Appear TwiceLEETCODEbit-manipulation / bitmask-setsEASY2032.Two Out of ThreeLEETCODEbit-manipulation / bitmask-setsEASY1684.Count the Number of Consistent StringsLEETCODEbit-manipulation / bitmask-setsEASY1371.Find the Longest Substring Containing Vowels in Even CountsLEETCODEbit-manipulation / bitmask-setsMED260.Single Number IIILEETCODEbit-manipulation / xorMEDTwo Single NumbersEDUCATIVE.IObit-manipulation / xorMEDSwap The NumbersGEEKSFORGEEKSbit-manipulation / xorBASICOne odd OccuringGEEKSFORGEEKSbit-manipulation / xorBASICDetect If Two Integers Have Opposite SignsEDUCATIVE.IObit-manipulation / xorBASIC540.Single Element in a Sorted ArrayLEETCODEbit-manipulation / xorMED389.Find the DifferenceLEETCODEbit-manipulation / xorEASY2932.Maximum Strong Pair XOR ILEETCODEbit-manipulation / xorEASY2683.Neighboring Bitwise XORLEETCODEbit-manipulation / xorMED268.Missing NumberLEETCODEbit-manipulation / xorEASY266.Palindrome PermutationLEETCODEbit-manipulation / xorEASY2433.Find The Original Array of Prefix XorLEETCODEbit-manipulation / xorMED2206.Divide Array Into Equal PairsLEETCODEbit-manipulation / xorEASY1829.Maximum XOR for Each QueryLEETCODEbit-manipulation / xorMED1720.Decode XORed ArrayLEETCODEbit-manipulation / xorEASY1486.XOR Operation in an ArrayLEETCODEbit-manipulation / xorEASY137.Single Number IILEETCODEbit-manipulation / xorMED136.Single NumberLEETCODEbit-manipulation / xorEASYSingle NumberEDUCATIVE.IObit-manipulation / xorBASIC67.Add BinaryLEETCODEbit-manipulation / rebuilding-a-numberEASY476.Number ComplementLEETCODEbit-manipulation / rebuilding-a-numberEASY3750.Minimum Number of Flips to Reverse Binary StringLEETCODEbit-manipulation / rebuilding-a-numberEASY371.Sum of Two IntegersLEETCODEbit-manipulation / rebuilding-a-numberMED2749.Minimum Operations to Make the Integer ZeroLEETCODEbit-manipulation / rebuilding-a-numberMED190.Reverse BitsLEETCODEbit-manipulation / rebuilding-a-numberEASY1256.Encode NumberLEETCODEbit-manipulation / rebuilding-a-numberMED1009.Complement of Base 10 IntegerLEETCODEbit-manipulation / rebuilding-a-numberEASYOdd or EvenGEEKSFORGEEKSbit-manipulation / bit-patternsBASICCheck if Number is Even/OddEDUCATIVE.IObit-manipulation / bit-patternsBASIC868.Binary GapLEETCODEbit-manipulation / bit-patternsEASY693.Binary Number with Alternating BitsLEETCODEbit-manipulation / bit-patternsEASY3950.Exactly One Consecutive Set Bits PairLEETCODEbit-manipulation / bit-patternsEASY342.Power of FourLEETCODEbit-manipulation / bit-patternsEASY2980.Check if Bitwise OR Has Trailing ZerosLEETCODEbit-manipulation / bit-patternsEASY2568.Minimum Impossible ORLEETCODEbit-manipulation / bit-patternsMED231.Power of TwoLEETCODEbit-manipulation / bit-patternsEASYPower of 2GEEKSFORGEEKSbit-manipulation / bit-patternsEASYPower of 2EDUCATIVE.IObit-manipulation / bit-patternsBASIC201.Bitwise AND of Numbers RangeLEETCODEbit-manipulation / bit-patternsMED1342.Number of Steps to Reduce a Number to ZeroLEETCODEbit-manipulation / bit-patternsEASY1016.Binary String With Substrings Representing 1 To NLEETCODEbit-manipulation / bit-patternsMEDFind Bit Length of a NumberEDUCATIVE.IObit-manipulation / counting-bitsBASIC461.Hamming DistanceLEETCODEbit-manipulation / counting-bitsEASY401.Binary WatchLEETCODEbit-manipulation / counting-bitsEASY338.Counting BitsLEETCODEbit-manipulation / counting-bitsEASY3304.Find the K-th Character in String Game ILEETCODEbit-manipulation / counting-bitsEASY2997.Minimum Number of Operations to Make Array XOR Equal to KLEETCODEbit-manipulation / counting-bitsMED2859.Sum of Values at Indices With K Set BitsLEETCODEbit-manipulation / counting-bitsEASY2595.Number of Even and Odd BitsLEETCODEbit-manipulation / counting-bitsEASY2220.Minimum Bit Flips to Convert NumberLEETCODEbit-manipulation / counting-bitsEASY191.Number of 1 BitsLEETCODEbit-manipulation / counting-bitsEASYNumber of 1 BitsGEEKSFORGEEKSbit-manipulation / counting-bitsEASYCount Set BitsEDUCATIVE.IObit-manipulation / counting-bitsBASIC1356.Sort Integers by The Number of 1 BitsLEETCODEbit-manipulation / counting-bitsEASY1318.Minimum Flips to Make a OR b Equal to cLEETCODEbit-manipulation / counting-bitsMEDNumber of Flips Required to Make a|b Equal to cEDUCATIVE.IObit-manipulation / counting-bitsBASIC300.Longest Increasing SubsequenceLEETCODEdynamic-programming / longest-subsequenceMEDStaircaseEDUCATIVE.IOdynamic-programming / fibonacci-seriesEASYNumber FactorsEDUCATIVE.IOdynamic-programming / fibonacci-seriesEASYMinimum Jumps with FeeEDUCATIVE.IOdynamic-programming / fibonacci-seriesEASYMinimum Jumps to Reach the EndEDUCATIVE.IOdynamic-programming / fibonacci-seriesEASY746.Min Cost Climbing StairsLEETCODEdynamic-programming / fibonacci-seriesEASY70.Climbing StairsLEETCODEdynamic-programming / fibonacci-seriesEASY509.Fibonacci NumberLEETCODEdynamic-programming / fibonacci-seriesEASY213.House Robber IILEETCODEdynamic-programming / fibonacci-seriesMED198.House RobberLEETCODEdynamic-programming / fibonacci-seriesMED1–100 of 544 entries100 / PAGE‹ PREV1 / 6NEXT ›Pattern forestPattern Forest0/142array-and-string0/30intervals0/30problems0/25two-pointers0/5two-heads-for-two-arrays0/14left-right-heads0/6read-write-heads0/2prefix-sum0/5one-pass0/80sliding-window0/15return-count-indices0/5variable-window-shortest0/26variable-window-longest0/34fixed-window0/82trees0/6binary-search-tree0/2manipulate0/4traverse0/5n-ary-tree0/2dfs-bfs0/3traversals0/71binary-tree0/27simply-traverse0/11post-order-processing0/4two-trees0/6tree-modification0/14path-height-views0/9tree-traversal0/59bit-manipulation0/11bitmask-sets0/17xor0/8rebuilding-a-number0/11bit-patterns0/12counting-bits0/49search-and-sort0/49binary-search0/10secondary-loop0/5monotone-function0/34logn-and-sort0/42linked-list0/2misc0/4three-pointers0/19two-pointers0/14one-pass0/3basics0/20math0/17matrix0/3bfs0/14dfs0/17disjoint-sets0/2matrices0/15problems0/16graph0/1Uncategorized0/3Traversal0/4topological-sorting0/6degree0/2cycle-detection0/11dynamic-programming0/1longest-subsequence0/10fibonacci-series0/5design-and-simulation0/5array-hash Full screen