N

Navi

4 questions tracked4 with solutions
🔍
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 4 of 4 questions

1
MediumMinimize the Maximum Difference of Pairs✓ Our Solution
100
ArrayBinary SearchDynamic ProgrammingGreedy+1
LeetCode ↗51% acc.
2
MediumMinimum Number of Days to Make m Bouquets✓ Our Solution
81
ArrayBinary Search
LeetCode ↗55% acc.
3
MediumSearch in Rotated Sorted Array✓ Our Solution
66
ArrayBinary Search
LeetCode ↗43% acc.
4
HardTrapping Rain Water✓ Our Solution
66
ArrayTwo PointersDynamic ProgrammingStack+1
LeetCode ↗65% acc.