LeetCode The Hard Way

Infosys

254 problems

ProblemDifficultyFrequency Topics
2827. Number of Beautiful Integers in the RangeHard60.6%
MathDynamic Programming
2834. Find the Minimum Possible Sum of a Beautiful ArrayMedium60.6%
MathGreedy
22. Generate ParenthesesMedium60.6%
StringDynamic ProgrammingBacktrackingBracket Sequences
3637. Trionic Array IEasy60.6%
Array
994. Rotting OrangesMedium60.6%
ArrayBreadth-First SearchMatrix
3653. XOR After Range Multiplication Queries IMedium60.6%
ArrayDivide and ConquerSimulationPrefix Sum
3655. XOR After Range Multiplication Queries IIHard60.6%
ArrayDivide and ConquerPrefix Sum
3671. Sum of Beautiful SubsequencesHard60.6%
ArrayMathBinary Indexed TreeNumber Theory
1004. Max Consecutive Ones IIIMedium60.6%
ArrayBinary SearchSliding WindowPrefix Sum
875. Koko Eating BananasMedium60.6%
ArrayBinary Search
3939. Count Non Adjacent Subsets in a Rooted TreeHard60.6%
ArrayDynamic ProgrammingTreeDepth-First Search
3984. Divisible GameMedium60.6%
ArrayMathDynamic ProgrammingEnumerationNumber Theory
Fibonacci NumberEasy57.6%
MathDynamic ProgrammingRecursionMemoization
Best Time to Buy and Sell Stock IIMedium57.6%
ArrayDynamic ProgrammingGreedy
141. Linked List CycleEasy57.6%
Hash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithm
2259. Remove Digit From Number to Maximize ResultEasy57.6%
StringGreedyEnumeration
300. Longest Increasing SubsequenceMedium57.6%
ArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequence
55. Jump GameMedium57.6%
ArrayDynamic ProgrammingGreedy
Rotate ArrayMedium54.1%
ArrayMathTwo Pointers
322. Coin ChangeMedium54.1%
ArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack
48. Rotate ImageMedium54.1%
ArrayMathMatrix
Reverse Words in a StringMedium54.1%
Two PointersString
76. Minimum Window SubstringHard54.1%
Hash TableStringSliding Window
162. Find Peak ElementMedium54.1%
ArrayBinary Search
46. PermutationsMedium54.1%
ArrayBacktracking
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee