Make your practice count.Sign in to track completed questions across devices. Everything is free to browse.

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

Done	Question	Resource
Mark Min Cost to Connect All Points completed	Min Cost to Connect All Points	Open
Mark Minesweeper completed	Minesweeper	Open
Mark Minimize Array Sum Using Divisible Replacements completed	Minimize Array Sum Using Divisible Replacements	Open
Mark Minimize Connected Groups by Inserting Interval completed	Minimize Connected Groups by Inserting Interval	Open
Mark Minimize Deviation in Array completed	Minimize Deviation in Array	Open
Mark Minimized Maximum of Products Distributed to Any Store completed	Minimized Maximum of Products Distributed to Any Store	Open
Mark Minimize Hamming Distance After Swap Operations completed	Minimize Hamming Distance After Swap Operations	Open
Mark Minimize Length of Array Using Operations completed	Minimize Length of Array Using Operations	Open
Mark Minimize Malware Spread completed	Minimize Malware Spread	Open
Mark Minimize Malware Spread II completed	Minimize Malware Spread II	Open
Mark Minimize Max Distance to Gas Station completed	Minimize Max Distance to Gas Station	Open
Mark Minimize Maximum Component Cost completed	Minimize Maximum Component Cost	Open
Mark Minimize Maximum of Array completed	Minimize Maximum of Array	Open
Mark Minimize Maximum Pair Sum in Array completed	Minimize Maximum Pair Sum in Array	Open
Mark Minimize Maximum Value in a Grid completed	Minimize Maximum Value in a Grid	Open
Mark Minimize OR of Remaining Elements Using Operations completed	Minimize OR of Remaining Elements Using Operations	Open
Mark Minimize Product Sum of Two Arrays completed	Minimize Product Sum of Two Arrays	Open
Mark Minimize Result by Adding Parentheses to Expression completed	Minimize Result by Adding Parentheses to Expression	Open
Mark Minimize Rounding Error to Meet Target completed	Minimize Rounding Error to Meet Target	Open
Mark Minimize String Length completed	Minimize String Length	Open
Mark Minimize the Difference Between Target and Chosen Elements completed	Minimize the Difference Between Target and Chosen Elements	Open
Mark Minimize the Maximum Adjacent Element Difference completed	Minimize the Maximum Adjacent Element Difference	Open
Mark Minimize the Maximum Difference of Pairs completed	Minimize the Maximum Difference of Pairs	Open
Mark Minimize the Maximum Edge Weight of Graph completed	Minimize the Maximum Edge Weight of Graph	Open
Mark Minimize the Maximum of Two Arrays completed	Minimize the Maximum of Two Arrays	Open
Mark Minimize XOR completed	Minimize XOR	Open
Mark Minimizing Array After Replacing Pairs With Their Product completed	Minimizing Array After Replacing Pairs With Their Product	Open
Mark Minimum Absolute Difference completed	Minimum Absolute Difference	Open
Mark Minimum Absolute Difference Between Elements With Constraint completed	Minimum Absolute Difference Between Elements With Constraint	Open
Mark Minimum Absolute Difference Between Two Values completed	Minimum Absolute Difference Between Two Values	Open
Mark Minimum Absolute Difference in BST completed	Minimum Absolute Difference in BST	Open
Mark Minimum Absolute Difference in Sliding Submatrix completed	Minimum Absolute Difference in Sliding Submatrix	Open
Mark Minimum Absolute Difference Queries completed	Minimum Absolute Difference Queries	Open
Mark Minimum Absolute Distance Between Mirror Pairs completed	Minimum Absolute Distance Between Mirror Pairs	Open
Mark Minimum Absolute Sum Difference completed	Minimum Absolute Sum Difference	Open
Mark Minimum Additions to Make Valid String completed	Minimum Additions to Make Valid String	Open
Mark Minimum Addition to Make Integer Beautiful completed	Minimum Addition to Make Integer Beautiful	Open
Mark Minimum Add to Make Parentheses Valid completed	Minimum Add to Make Parentheses Valid	Open
Mark Minimum Adjacent Swaps for K Consecutive Ones completed	Minimum Adjacent Swaps for K Consecutive Ones	Open
Mark Minimum Adjacent Swaps to Make a Valid Array completed	Minimum Adjacent Swaps to Make a Valid Array	Open
Mark Minimum Adjacent Swaps to Reach the Kth Smallest Number completed	Minimum Adjacent Swaps to Reach the Kth Smallest Number	Open
Mark Minimum Amount of Damage Dealt to Bob completed	Minimum Amount of Damage Dealt to Bob	Open
Mark Minimum Amount of Time to Collect Garbage completed	Minimum Amount of Time to Collect Garbage	Open
Mark Minimum Amount of Time to Fill Cups completed	Minimum Amount of Time to Fill Cups	Open
Mark Minimum Area Rectangle completed	Minimum Area Rectangle	Open
Mark Minimum Area Rectangle II completed	Minimum Area Rectangle II	Open
Mark Minimum Array Changes to Make Differences Equal completed	Minimum Array Changes to Make Differences Equal	Open
Mark Minimum Array End completed	Minimum Array End	Open
Mark Minimum Array Length After Pair Removals completed	Minimum Array Length After Pair Removals	Open
Mark Minimum Array Sum completed	Minimum Array Sum	Open
Mark Minimum ASCII Delete Sum for Two Strings completed	Minimum ASCII Delete Sum for Two Strings	Open
Mark Minimum Average Difference completed	Minimum Average Difference	Open
Mark Minimum Average of Smallest and Largest Elements completed	Minimum Average of Smallest and Largest Elements	Open
Mark Minimum Bit Flips to Convert Number completed	Minimum Bit Flips to Convert Number	Open
Mark Minimum Bitwise OR From Grid completed	Minimum Bitwise OR From Grid	Open
Mark Minimum Changes To Make Alternating Binary String completed	Minimum Changes To Make Alternating Binary String	Open
Mark Minimum Common Value completed	Minimum Common Value	Open
Mark Minimum Consecutive Cards to Pick Up completed	Minimum Consecutive Cards to Pick Up	Open
Mark Minimum Cost for Cutting Cake II completed	Minimum Cost for Cutting Cake II	Open
Mark Minimum Cost For Tickets completed	Minimum Cost For Tickets	Open
Mark Minimum Cost Good Caption completed	Minimum Cost Good Caption	Open
Mark Minimum Cost Homecoming of a Robot in a Grid completed	Minimum Cost Homecoming of a Robot in a Grid	Open
Mark Minimum Cost of a Path With Special Roads completed	Minimum Cost of a Path With Special Roads	Open
Mark Minimum Cost of Buying Candies With Discount completed	Minimum Cost of Buying Candies With Discount	Open
Mark Minimum Cost Path with Alternating Directions III completed	Minimum Cost Path with Alternating Directions III	Open
Mark Minimum Cost Path with Edge Reversals completed	Minimum Cost Path with Edge Reversals	Open
Mark Minimum Cost Path with Teleportations completed	Minimum Cost Path with Teleportations	Open
Mark Minimum Costs Using the Train Line completed	Minimum Costs Using the Train Line	Open
Mark Minimum Cost to Buy Apples completed	Minimum Cost to Buy Apples	Open
Mark Minimum Cost to Buy Apples II completed	Minimum Cost to Buy Apples II	Open
Mark Minimum Cost to Change the Final Value of Expression completed	Minimum Cost to Change the Final Value of Expression	Open
Mark Minimum Cost to Connect Sticks completed	Minimum Cost to Connect Sticks	Open
Mark Minimum Cost to Connect Two Groups of Points completed	Minimum Cost to Connect Two Groups of Points	Open
Mark Minimum Cost to Convert String I completed	Minimum Cost to Convert String I	Open
Mark Minimum Cost to Convert String II completed	Minimum Cost to Convert String II	Open
Mark Minimum Cost to Convert String III completed	Minimum Cost to Convert String III	Open
Mark Minimum Cost to Cut a Stick completed	Minimum Cost to Cut a Stick	Open
Mark Minimum Cost to Equalize Array completed	Minimum Cost to Equalize Array	Open
Mark Minimum Cost to Equalize Arrays Using Swaps completed	Minimum Cost to Equalize Arrays Using Swaps	Open
Mark Minimum Cost to Hire K Workers completed	Minimum Cost to Hire K Workers	Open
Mark Minimum Cost to Make All Characters Equal completed	Minimum Cost to Make All Characters Equal	Open
Mark Minimum Cost to Make Array Equal completed	Minimum Cost to Make Array Equal	Open
Mark Minimum Cost to Make Array Equalindromic completed	Minimum Cost to Make Array Equalindromic	Open
Mark Minimum Cost to Make Arrays Identical completed	Minimum Cost to Make Arrays Identical	Open
Mark Minimum Cost to Make at Least One Valid Path in a Grid completed	Minimum Cost to Make at Least One Valid Path in a Grid	Open
Mark Minimum Cost to Merge Stones completed	Minimum Cost to Merge Stones	Open
Mark Minimum Cost to Move Chips to The Same Position completed	Minimum Cost to Move Chips to The Same Position	Open
Mark Minimum Cost to Partition a Binary String completed	Minimum Cost to Partition a Binary String	Open
Mark Minimum Cost to Reach City With Discounts completed	Minimum Cost to Reach City With Discounts	Open
Mark Minimum Cost to Reach Destination in Time completed	Minimum Cost to Reach Destination in Time	Open
Mark Minimum Cost to Separate Sentence Into Rows completed	Minimum Cost to Separate Sentence Into Rows	Open
Mark Minimum Cost to Set Cooking Time completed	Minimum Cost to Set Cooking Time	Open
Mark Minimum Cost to Split an Array completed	Minimum Cost to Split an Array	Open
Mark Minimum Cost to Split into Ones completed	Minimum Cost to Split into Ones	Open
Mark Minimum Cost Tree From Leaf Values completed	Minimum Cost Tree From Leaf Values	Open
Mark Minimum Cost Walk in Weighted Graph completed	Minimum Cost Walk in Weighted Graph	Open
Mark Minimum Cuts to Divide a Circle completed	Minimum Cuts to Divide a Circle	Open
Mark Minimum Degree of a Connected Trio in a Graph completed	Minimum Degree of a Connected Trio in a Graph	Open
Mark Minimum Deletions for At Most K Distinct Characters completed	Minimum Deletions for At Most K Distinct Characters	Open
Mark Minimum Deletions to Make Array Beautiful completed	Minimum Deletions to Make Array Beautiful	Open