Avito LeetCode interview questions

Explore Avito questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 8

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Group Anagrams Array Hash Table String +1 MEDIUM	Medium	100.0%	0.7%
Kth Largest Element in an Array Array Divide and Conquer Sorting +2 MEDIUM	Medium	95.6%	0.7%
Merge Sorted Array Array Two Pointers Sorting EASY	Easy	83.3%	0.6%
Sum of Subarray Minimums Array Dynamic Programming Stack +1 MEDIUM	Medium	83.3%	0.4%
Generate Parentheses String Dynamic Programming Backtracking +1 MEDIUM	Medium	73.6%	0.8%
Top K Frequent Elements Array Hash Table Divide and Conquer +5 MEDIUM	Medium	73.6%	0.7%
Maximum Depth of Binary Tree Tree Depth-First Search Breadth-First Search +1 EASY	Easy	73.6%	0.8%
Product of Array Except Self Array Prefix Sum MEDIUM	Medium	73.6%	0.7%

Showing 1–8 of 8 matching problems · All Problems