Courses
📚 PYQ
💼 Interview
Sign in
Interview Prep
/
Companies
/
Navi
N
Navi
4 questions tracked
4 with solutions
📊
All Time
4
📅
Last 6 Months
0
🔥
Last 3 Months
0
⚡
Last 30 Days
0
🔍
All
Easy
Medium
Hard
Frequency score
Sorted highest → lowest frequency
✓ Our Solution = we have a detailed walkthrough
Showing 4 of 4 questions
1
Medium
Minimize the Maximum Difference of Pairs
✓ Our Solution
100
Array
Binary Search
Dynamic Programming
Greedy
+1
LeetCode ↗
51% acc.
2
Medium
Minimum Number of Days to Make m Bouquets
✓ Our Solution
81
Array
Binary Search
LeetCode ↗
55% acc.
3
Medium
Search in Rotated Sorted Array
✓ Our Solution
66
Array
Binary Search
LeetCode ↗
43% acc.
4
Hard
Trapping Rain Water
✓ Our Solution
66
Array
Two Pointers
Dynamic Programming
Stack
+1
LeetCode ↗
65% acc.
