โ† TCS questions
CodingReported in a candidate post, Jul 2024

Elements appearing more than n/3 times

Filed under TCS

Given an integer array of size n, find all elements that appear more than floor(n/3) times.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related TCS questions

Collected from public candidate posts and coding forums. Updated Nov 2026.