Tejav
Interview Prep/Companies/jio
J

jio

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

Showing 7 of 7 questions

1
HardDivide an Array Into Subarrays With Minimum Cost II✓ Our Solution
100
ArrayHash TableSliding WindowHeap (Priority Queue)
LeetCode ↗30% acc.
2
MediumFind the Grid of Region Average✓ Our Solution
100
ArrayMatrix
LeetCode ↗42% acc.
3
MediumMaximize the Number of Target Nodes After Connecting Trees I✓ Our Solution
100
TreeDepth-First SearchBreadth-First Search
LeetCode ↗70% acc.
4
HardMaximize the Number of Target Nodes After Connecting Trees II✓ Our Solution
100
TreeDepth-First SearchBreadth-First Search
LeetCode ↗73% acc.
5
EasyTwo Sum✓ Our Solution
63
ArrayHash Table
LeetCode ↗56% acc.
6
HardMaking A Large Island✓ Our Solution
63
ArrayDepth-First SearchBreadth-First SearchUnion Find+1
LeetCode ↗55% acc.
7
HardTrapping Rain Water✓ Our Solution
63
ArrayTwo PointersDynamic ProgrammingStack+1
LeetCode ↗65% acc.