Jio

7 LeetCode interview questions

Difficulty Distribution

Easy

2

29%

Medium

3

43%

Hard

2

29%

Top Topics

Array(4)Hash Table(3)Tree(2)Depth-First Search(2)Breadth-First Search(2)Sliding Window(1)Heap (Priority Queue)(1)Matrix(1)Linked List(1)Recursion(1)

All Questions

Title	Difficulty	Acceptance	Frequency	Topics
Divide an Array Into Subarrays With Minimum Cost II	Hard	54.8%	100.0%	ArrayHash TableSliding Window+1
Find the Grid of Region Average	Medium	43.2%	100.0%	ArrayMatrix
Maximize the Number of Target Nodes After Connecting Trees I	Medium	69.5%	100.0%	TreeDepth-First SearchBreadth-First Search
Maximize the Number of Target Nodes After Connecting Trees II	Hard	73.2%	100.0%	TreeDepth-First SearchBreadth-First Search
Two Sum	Easy	57.1%	62.5%	ArrayHash Table
Reverse Linked List	Easy	80.3%	62.5%	Linked ListRecursion
Group Anagrams	Medium	72.2%	62.5%	ArrayHash TableString+1

Showing 7 of 7 questions