Find >n/3 elements in sorted array

Q: Find >n/3 elements in sorted array

This is a Coding & Algorithms interview question from TikTok for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a sorted array of integers nums of length n, return all values that occur more than floor(n/ 3) times. Design an algorithm that runs in O(log n) time and O(

extra space. Justify correctness, cover edge cases (e.g., n < 3, runs near boundaries), and provide time/space analysis.

Find >n/3 elements in sorted array

Comments (0)