QUESTIONS BY COMPANY

Company Wise LeetCode Questions 2026

Browse LeetCode problems by company. Find the most frequently asked coding interview questions from Amazon, Google, Meta, Microsoft, Apple & 50+ other companies.

Last updated: 20 Feb 2026

ProblemDifficultyFrequencyTopics
Separate Black and White BallsMEDIUM
100%
Minimum Operations to Reduce an Integer to 0MEDIUM
100%
Dynamic ProgrammingGreedyBit Manipulation
Count Univalue SubtreesMEDIUM
100%
TreeDepth-First SearchBinary Tree
Find the PeaksEASY
100%
Two SumEASY
100%
ArrayHash Table
Replace the Substring for Balanced StringMEDIUM
100%
StringSliding Window
Fill Missing DataEASY
100%
Count All Valid Pickup and Delivery OptionsHARD
100%
MathDynamic ProgrammingCombinatorics
Game of LifeMEDIUM
100%
ArrayMatrixSimulation
Reformat Phone NumberEASY
100%
String
Check If Digits Are Equal in String After Operations IIHARD
100%
Arithmetic SlicesMEDIUM
100%
ArrayDynamic ProgrammingSliding Window
Parsing A Boolean ExpressionHARD
100%
StringStackRecursion
Insert Delete GetRandom O(1)MEDIUM
100%
ArrayHash TableMathDesignRandomized
Minimum Absolute DifferenceEASY
100%
ArraySorting
Eliminate Maximum Number of MonstersMEDIUM
100%
ArrayGreedySorting
Text JustificationHARD
100%
ArrayStringSimulation
Find the Number of Good Pairs IIMEDIUM
100%
ArrayHash Table
Find the Number of Good Pairs IEASY
100%
ArrayHash Table
Minimum Array Changes to Make Differences EqualMEDIUM
100%
ArrayHash TablePrefix Sum
XOR Queries of a SubarrayMEDIUM
100%
ArrayBit ManipulationPrefix Sum
Find Polygon With the Largest PerimeterMEDIUM
100%
ArrayGreedySortingPrefix Sum
N-Repeated Element in Size 2N ArrayEASY
100%
ArrayHash Table
Map Sum PairsMEDIUM
100%
Hash TableStringDesignTrie
Cherry PickupHARD
100%
ArrayDynamic ProgrammingMatrix
Network Delay TimeMEDIUM
100%
Depth-First SearchBreadth-First SearchGraphHeap (Priority Queue)Shortest Path
Create Sorted Array through InstructionsHARD
100%
ArrayBinary SearchDivide and ConquerBinary Indexed TreeSegment TreeMerge SortOrdered Set
Minimum Initial Energy to Finish TasksHARD
100%
ArrayGreedySorting
Can Make Palindrome from SubstringMEDIUM
100%
ArrayHash TableStringBit ManipulationPrefix Sum
Constrained Subsequence SumHARD
100%
ArrayDynamic ProgrammingQueueSliding WindowHeap (Priority Queue)Monotonic Queue
Dice Roll SimulationHARD
100%
ArrayDynamic Programming
Number of Different Subsequences GCDsHARD
100%
ArrayMathCountingNumber Theory
Number of Operations to Make Network ConnectedMEDIUM
100%
Depth-First SearchBreadth-First SearchUnion FindGraph
Minimum Number of Taps to Open to Water a GardenHARD
100%
ArrayDynamic ProgrammingGreedy
Reduce Array Size to The HalfMEDIUM
100%
ArrayHash TableGreedySortingHeap (Priority Queue)
Increasing Decreasing StringEASY
100%
Hash TableStringCounting
Split Array with Equal SumHARD
100%
ArrayHash TablePrefix Sum
Split Concatenated StringsMEDIUM
100%
ArrayStringGreedy
Path Sum IVMEDIUM
100%
ArrayHash TableTreeDepth-First SearchBinary Tree
Valid Parenthesis StringMEDIUM
100%
StringDynamic ProgrammingStackGreedy
Number Of Rectangles That Can Form The Largest SquareEASY
100%
Maximum Number of Removable CharactersMEDIUM
100%
ArrayTwo PointersStringBinary Search
Maximum Number of Pairs in ArrayEASY
100%
ArrayHash TableCounting
Watering PlantsMEDIUM
100%
ArraySimulation
Number of Divisible SubstringsMEDIUM
100%
Hash TableStringCountingPrefix Sum
Design a 3D Binary Matrix with Efficient Layer TrackingMEDIUM
100%
ArrayHash TableDesignHeap (Priority Queue)MatrixOrdered Set
Find a Value of a Mysterious Function Closest to TargetHARD
100%
ArrayBinary SearchBit ManipulationSegment Tree
Percentage of Letter in StringEASY
100%
String
Maximum Equal FrequencyHARD
100%
ArrayHash Table
Maximize the Topmost Element After K MovesMEDIUM
100%
ArrayGreedy

PREPARE FASTER

Need Help Solving These Problems?

CodingInterviewAI can instantly identify algorithms and generate optimal solutions for any LeetCode problem. Get step-by-step explanations and ace your next technical interview.

CodingInterviewAI logo

© 2026 CodingInterviewAI. All rights reserved

CodingInterviewAI

HomeBlogGive Feedback