MathWorks
29 LeetCode interview questions
Curated Lists
Categories
All Questions
Topics
- Count Subarrays With Fixed BoundsHard69.4%100.0%
- Maximum Number of AlloysMedium38.9%98.5%
- Sell Diminishing-Valued Colored BallsMedium30.0%91.2%
- Reshape the MatrixEasy63.9%91.2%
- Total Cost to Hire K WorkersMedium43.1%91.2%
- Earliest Second to Mark Indices IMedium34.7%88.9%
- Binary Tree CamerasHard47.2%88.9%
- Keyboard RowEasy72.5%88.9%
- Maximum Palindromes After OperationsMedium43.1%88.9%
- Shopping OffersMedium51.9%88.9%
- Earliest Second to Mark Indices IIHard20.3%88.9%
- Last Substring in Lexicographical OrderHard34.6%88.9%
- Count AnagramsHard35.2%88.9%
- Remove Colored Pieces if Both Neighbors are the Same ColorMedium62.8%88.9%
- Minimum Cost Tree From Leaf ValuesMedium67.7%88.9%
- Pass the PillowEasy56.6%80.5%
- String TransformationHard25.1%80.5%
- Minimum Edge Reversals So Every Node Is ReachableHard55.3%72.6%
- Longest String ChainMedium62.0%60.7%
- Sum of Distances in TreeHard65.3%60.7%
- Number of Divisible Triplet SumsMedium67.8%60.7%
- Split Array Largest SumHard58.1%60.7%
- Break a PalindromeMedium51.5%51.2%
- Reverse Nodes in k-GroupHard63.0%51.2%
- Maximum Difference Between Increasing ElementsEasy66.1%51.2%
- Convert Binary Number in a Linked List to IntegerEasy81.2%51.2%
- Longest Repeating Character ReplacementMedium57.2%51.2%
- Distinct SubsequencesHard50.1%51.2%
- Beautiful ArrangementMedium64.5%51.2%
Showing 29 of 29 questions.