LeetCode The Hard Way

Cognizant

51 problems

ProblemDifficultyFrequency Topics
3392. Count Subarrays of Length Three With a ConditionEasy100%
Array
1. Two SumEasy94.5%
ArrayHash Table
9. Palindrome NumberEasy89.3%
Math
3. Longest Substring Without Repeating CharactersMedium87.2%
Hash TableStringSliding Window
5. Longest Palindromic SubstringMedium85%
Two PointersStringDynamic ProgrammingManacher
2165. Smallest Value of the Rearranged NumberMedium79.8%
MathSorting
Sort Array By Absolute ValueEasy79.8%
ArrayMathTwo PointersSorting
Second Highest SalaryMedium76.7%
Database
283. Move ZeroesEasy73.1%
ArrayTwo Pointers
20. Valid ParenthesesEasy73.1%
StringStackBracket Sequences
121. Best Time to Buy and Sell StockEasy73.1%
ArrayDynamic Programming
Fibonacci NumberEasy68.8%
MathDynamic ProgrammingRecursionMemoization
242. Valid AnagramEasy68.8%
Hash TableStringSorting
4. Median of Two Sorted ArraysHard68.8%
ArrayBinary SearchDivide and Conquer
125. Valid PalindromeEasy63.7%
Two PointersString
560. Subarray Sum Equals KMedium63.7%
ArrayHash TablePrefix Sum
7. Reverse IntegerMedium57%
Math
Remove Duplicates from Sorted ArrayEasy57%
ArrayTwo Pointers
88. Merge Sorted ArrayEasy57%
ArrayTwo PointersSorting
First Missing PositiveHard57%
ArrayHash Table
Replace Employee ID With The Unique IdentifierEasy57%
Database
Article Views IEasy57%
Database
136. Single NumberEasy57%
ArrayBit Manipulation
Combine Two TablesEasy57%
Database
70. Climbing StairsEasy57%
MathDynamic ProgrammingMemoization
AlgoMonsterVisit ZapplyCertGarden
Your logo here
Become a sponsor
Buy Me A Coffee