M

Media.net

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

Showing 39 of 39 questions

1
HardMinimum Operations to Form Subsequence With Target Sumβœ“ Our Solution
100
ArrayGreedyBit Manipulation
2
MediumCount the Number of Square-Free Subsetsβœ“ Our Solution
93
ArrayMathDynamic ProgrammingBit Manipulation+1
3
HardScramble Stringβœ“ Our Solution
86
StringDynamic Programming
4
HardMaximum Genetic Difference Queryβœ“ Our Solution
86
ArrayHash TableBit ManipulationDepth-First Search+1
5
MediumFurthest Building You Can Reachβœ“ Our Solution
82
ArrayGreedyHeap (Priority Queue)
6
MediumMinimum Total Space Wasted With K Resizing Operationsβœ“ Our Solution
82
ArrayDynamic Programming
7
HardMake the XOR of All Segments Equal to Zeroβœ“ Our Solution
82
ArrayDynamic ProgrammingBit Manipulation
8
EasyMinimum Time Visiting All Pointsβœ“ Our Solution
82
ArrayMathGeometry
9
HardMinimum XOR Sum of Two Arraysβœ“ Our Solution
82
ArrayDynamic ProgrammingBit ManipulationBitmask
10
MediumMinimum Cost to Buy Apples
82
ArrayGraphHeap (Priority Queue)Shortest Path
11
MediumQueens That Can Attack the Kingβœ“ Our Solution
82
ArrayMatrixSimulation
12
HardMaximum XOR of Two Non-Overlapping Subtrees
82
TreeDepth-First SearchGraphTrie
13
HardDifference Between Maximum and Minimum Price Sumβœ“ Our Solution
82
ArrayDynamic ProgrammingTreeDepth-First Search
14
MediumSum of Remoteness of All Cells
82
ArrayHash TableDepth-First SearchBreadth-First Search+2
15
MediumMaximum Value of an Ordered Triplet IIβœ“ Our Solution
82
Array
16
EasyMaximum Value of an Ordered Triplet Iβœ“ Our Solution
82
Array
17
EasyBest Time to Buy and Sell Stockβœ“ Our Solution
77
ArrayDynamic Programming
18
MediumFlatten Binary Tree to Linked Listβœ“ Our Solution
74
Linked ListStackTreeDepth-First Search+1
19
HardSubstring with Concatenation of All Wordsβœ“ Our Solution
74
Hash TableStringSliding Window
20
EasyMerge Two Sorted Listsβœ“ Our Solution
71
Linked ListRecursion
21
HardPainting the Wallsβœ“ Our Solution
67
ArrayDynamic Programming
22
EasyFizz Buzzβœ“ Our Solution
62
MathStringSimulation
23
MediumJump Gameβœ“ Our Solution
62
ArrayDynamic ProgrammingGreedy
24
MediumLRU Cacheβœ“ Our Solution
56
Hash TableLinked ListDesignDoubly-Linked List
25
HardNumber of Submatrices That Sum to Targetβœ“ Our Solution
56
ArrayHash TableMatrixPrefix Sum
26
MediumBinary Search Tree Iteratorβœ“ Our Solution
56
StackTreeDesignBinary Search Tree+2
27
EasyValid Phone Numbersβœ“ Our Solution
56
Shell
28
HardThe Number of Good Subsetsβœ“ Our Solution
56
ArrayMathDynamic ProgrammingBit Manipulation+1
29
MediumValid Sudokuβœ“ Our Solution
56
ArrayHash TableMatrix
30
MediumBest Time to Buy and Sell Stock IIβœ“ Our Solution
56
ArrayDynamic ProgrammingGreedy
31
HardAll O`one Data Structureβœ“ Our Solution
47
Hash TableLinked ListDesignDoubly-Linked List
32
MediumMerge Intervalsβœ“ Our Solution
47
ArraySorting
33
HardSliding Window Maximumβœ“ Our Solution
47
ArrayQueueSliding WindowHeap (Priority Queue)+1
34
MediumLongest Palindromic Substringβœ“ Our Solution
47
Two PointersStringDynamic Programming
35
HardSum of Distances in Treeβœ“ Our Solution
47
Dynamic ProgrammingTreeDepth-First SearchGraph
36
EasyMajority Elementβœ“ Our Solution
47
ArrayHash TableDivide and ConquerSorting+1
37
HardTrapping Rain Waterβœ“ Our Solution
47
ArrayTwo PointersDynamic ProgrammingStack+1
38
MediumSearch in Rotated Sorted Arrayβœ“ Our Solution
47
ArrayBinary Search
39
MediumMinimize the Maximum Difference of Pairsβœ“ Our Solution
47
ArrayBinary SearchDynamic ProgrammingGreedy+1