Question 1

Count Pairs With XOR in a Range — Vimeo Interview Question

Accepted Answer

"Count Pairs With XOR in a Range" is a hard difficulty problem asked at Vimeo interviews. It covers the following topics: Array, Bit Manipulation, Trie. You can practice it on LeetCode: https://leetcode.com/problems/count-pairs-with-xor-in-a-range

Question 2

Flower Planting With No Adjacent — Vimeo Interview Question

Accepted Answer

"Flower Planting With No Adjacent" is a medium difficulty problem asked at Vimeo interviews. It covers the following topics: Depth-First Search, Breadth-First Search, Graph. You can practice it on LeetCode: https://leetcode.com/problems/flower-planting-with-no-adjacent

Question 3

Maximum Subarray — Vimeo Interview Question

Accepted Answer

"Maximum Subarray" is a medium difficulty problem asked at Vimeo interviews. It covers the following topics: Array, Divide and Conquer, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/maximum-subarray

Question 4

3Sum — Vimeo Interview Question

Accepted Answer

"3Sum" is a medium difficulty problem asked at Vimeo interviews. It covers the following topics: Array, Two Pointers, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/3sum

Question 5

LRU Cache — Vimeo Interview Question

Accepted Answer

"LRU Cache" is a medium difficulty problem asked at Vimeo interviews. It covers the following topics: Hash Table, Linked List, Design, Doubly-Linked List. You can practice it on LeetCode: https://leetcode.com/problems/lru-cache

Question 6

Min Stack — Vimeo Interview Question

Accepted Answer

"Min Stack" is a medium difficulty problem asked at Vimeo interviews. It covers the following topics: Stack, Design. You can practice it on LeetCode: https://leetcode.com/problems/min-stack

#	Question Title	Difficulty	Frequency	Topics
1	Count Pairs With XOR in a Range	HARD	100.0	ArrayBit ManipulationTrie
2	Flower Planting With No Adjacent	MEDIUM	66.4	Depth-First SearchBreadth-First SearchGraph
3	Maximum Subarray	MEDIUM	66.4	ArrayDivide and ConquerDynamic Programming
4	3Sum	MEDIUM	66.4	ArrayTwo PointersSorting
5	LRU Cache	MEDIUM	66.4	Hash TableLinked ListDesign+1
6	Min Stack	MEDIUM	66.4	StackDesign

Explore 450+ Companies

Companies

Vimeo

Vimeo Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Vimeo

Vimeo Interview Questions

Ai Assistant Kas