M

MathWorks

29 questions tracked28 with solutions
πŸ”
Frequency scoreSorted highest β†’ lowest frequencyβœ“ Our Solution = we have a detailed walkthrough

Showing 29 of 29 questions

1
HardCount Subarrays With Fixed Boundsβœ“ Our Solution
100
ArrayQueueSliding WindowMonotonic Queue
2
MediumMaximum Number of Alloysβœ“ Our Solution
99
ArrayBinary Search
3
MediumSell Diminishing-Valued Colored Ballsβœ“ Our Solution
91
ArrayMathBinary SearchGreedy+2
4
EasyReshape the Matrixβœ“ Our Solution
91
ArrayMatrixSimulation
5
MediumTotal Cost to Hire K Workersβœ“ Our Solution
91
ArrayTwo PointersHeap (Priority Queue)Simulation
6
MediumEarliest Second to Mark Indices Iβœ“ Our Solution
89
ArrayBinary Search
7
HardBinary Tree Camerasβœ“ Our Solution
89
Dynamic ProgrammingTreeDepth-First SearchBinary Tree
8
EasyKeyboard Rowβœ“ Our Solution
89
ArrayHash TableString
9
MediumMaximum Palindromes After Operationsβœ“ Our Solution
89
ArrayHash TableStringGreedy+2
10
MediumShopping Offersβœ“ Our Solution
89
ArrayDynamic ProgrammingBacktrackingBit Manipulation+2
11
HardEarliest Second to Mark Indices IIβœ“ Our Solution
89
ArrayBinary SearchGreedyHeap (Priority Queue)
12
HardLast Substring in Lexicographical Orderβœ“ Our Solution
89
Two PointersString
13
HardCount Anagramsβœ“ Our Solution
89
Hash TableMathStringCombinatorics+1
14
MediumRemove Colored Pieces if Both Neighbors are the Same Colorβœ“ Our Solution
89
MathStringGreedyGame Theory
15
MediumMinimum Cost Tree From Leaf Valuesβœ“ Our Solution
89
ArrayDynamic ProgrammingStackGreedy+1
16
EasyPass the Pillowβœ“ Our Solution
81
MathSimulation
17
HardString Transformationβœ“ Our Solution
81
MathStringDynamic ProgrammingString Matching
18
HardMinimum Edge Reversals So Every Node Is Reachableβœ“ Our Solution
73
Dynamic ProgrammingDepth-First SearchBreadth-First SearchGraph
19
MediumLongest String Chainβœ“ Our Solution
61
ArrayHash TableTwo PointersString+2
20
HardSum of Distances in Treeβœ“ Our Solution
61
Dynamic ProgrammingTreeDepth-First SearchGraph
21
MediumNumber of Divisible Triplet Sums
61
ArrayHash Table
22
HardSplit Array Largest Sumβœ“ Our Solution
61
ArrayBinary SearchDynamic ProgrammingGreedy+1
23
MediumBreak a Palindromeβœ“ Our Solution
51
StringGreedy
24
HardReverse Nodes in k-Groupβœ“ Our Solution
51
Linked ListRecursion
25
EasyMaximum Difference Between Increasing Elementsβœ“ Our Solution
51
Array
26
EasyConvert Binary Number in a Linked List to Integerβœ“ Our Solution
51
Linked ListMath
27
MediumLongest Repeating Character Replacementβœ“ Our Solution
51
Hash TableStringSliding Window
28
HardDistinct Subsequencesβœ“ Our Solution
51
StringDynamic Programming
29
MediumBeautiful Arrangementβœ“ Our Solution
51
ArrayDynamic ProgrammingBacktrackingBit Manipulation+1