← All collections

Complete question library

All interview questions

3557 questions in one focused tracker. Company collections will use the same saved progress.

0 of 100 completed on this page0%

Questions 3557

DoneQuestionResource
Lowest Common Ancestor of a Binary TreeOpen
Lowest Common Ancestor of a Binary Tree IIOpen
Lowest Common Ancestor of a Binary Tree IIIOpen
Lowest Common Ancestor of a Binary Tree IVOpen
Lowest Common Ancestor of Deepest LeavesOpen
LRU CacheOpen
Lucky Numbers in a MatrixOpen
Magical StringOpen
Magic Squares In GridOpen
Magnetic Force Between Two BallsOpen
Majority ElementOpen
Majority Element IIOpen
Make a Positive ArrayOpen
Make Array Elements Equal to ZeroOpen
Make Array EmptyOpen
Make Array Non-decreasingOpen
Make Array Non-decreasing or Non-increasingOpen
Make Array Zero by Subtracting Equal AmountsOpen
Make Costs of Paths Equal in a Binary TreeOpen
Make K-Subarray Sums EqualOpen
Make Lexicographically Smallest Array by Swapping ElementsOpen
Make Number of Distinct Characters EqualOpen
Make String Anti-palindromeOpen
Make String a Subsequence Using Cyclic IncrementsOpen
Make Sum Divisible by POpen
Make the Prefix Sum Non-negativeOpen
Make The String GreatOpen
Make the XOR of All Segments Equal to ZeroOpen
Make Three Strings EqualOpen
Make Two Arrays Equal by Reversing SubarraysOpen
Making A Large IslandOpen
Making File Names UniqueOpen
Managers with at Least 5 Direct ReportsOpen
Manhattan Distances of All Arrangements of PiecesOpen
Map of Highest PeakOpen
Map Sum PairsOpen
Mark Elements on Array by Performing QueriesOpen
Market Analysis IOpen
Market Analysis IIOpen
Masking Personal InformationOpen
Match Alphanumerical Pattern in Matrix IOpen
Matchsticks to SquareOpen
Matrix Block SumOpen
Matrix Cells in Distance OrderOpen
Matrix Diagonal SumOpen
Matrix Similarity After Cyclic ShiftsOpen
Max Area of IslandOpen
Max Chunks To Make SortedOpen
Max Chunks To Make Sorted IIOpen
Max Consecutive OnesOpen
Max Consecutive Ones IIOpen
Max Consecutive Ones IIIOpen
Max Difference You Can Get From Changing an IntegerOpen
Max Dot Product of Two SubsequencesOpen
Maximal Network RankOpen
Maximal Range That Each Element Is Maximum in ItOpen
Maximal RectangleOpen
Maximal Score After Applying K OperationsOpen
Maximal SquareOpen
Maximize Active Section with Trade IOpen
Maximize Active Section with Trade IIOpen
Maximize Alternating Sum Using SwapsOpen
Maximize Amount After Two Days of ConversionsOpen
Maximize Area of Square Hole in GridOpen
Maximize Consecutive Elements in an Array After ModificationOpen
Maximize Count of Distinct Primes After SplitOpen
Maximize Cyclic Partition ScoreOpen
Maximize Distance to Closest PersonOpen
Maximize Fixed Points After DeletionsOpen
Maximize Greatness of an ArrayOpen
Maximize Grid HappinessOpen
Maximize Happiness of Selected ChildrenOpen
Maximize ItemsOpen
Maximize Number of Nice DivisorsOpen
Maximize Number of Subsequences in a StringOpen
Maximize Palindrome Length From SubsequencesOpen
Maximize Points After Choosing K TasksOpen
Maximize Score After N OperationsOpen
Maximize Score After Pair DeletionsOpen
Maximize Score of Numbers in RangesOpen
Maximize Spanning Tree Stability with UpgradesOpen
Maximize Subarray GCD ScoreOpen
Maximize Subarrays After Removing One Conflicting PairOpen
Maximize Subarray Sum After Removing All Occurrences of One ElementOpen
Maximize Sum Of Array After K NegationsOpen
Maximize Sum of Device RatingsOpen
Maximize Sum of Squares of DigitsOpen
Maximize Sum of Weights after Edge RemovalsOpen
Maximize the Beauty of the GardenOpen
Maximize the Confusion of an ExamOpen
Maximize the Distance Between Points on a SquareOpen
Maximize the Minimum Game ScoreOpen
Maximize the Minimum Powered CityOpen
Maximize the Number of Partitions After OperationsOpen
Maximize the Number of Target Nodes After Connecting Trees IOpen
Maximize the Number of Target Nodes After Connecting Trees IIOpen
Maximize the Profit as the SalesmanOpen
Maximize the Topmost Element After K MovesOpen
Maximize Total Cost of Alternating SubarraysOpen
Maximize Total Tastiness of Purchased FruitsOpen