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.

What difficulty level is this interview question?

This is a hard difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Google.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Google during technical interviews.

Find conflicting pair using black-box run()

Last updated: May 21, 2026

Quick Overview

This question evaluates algorithm design and query-complexity reasoning, focusing on efficient search strategies for identifying an interacting pair via a costly black-box oracle.

|Home/Coding & Algorithms/Google

Find conflicting pair using black-box run()

Google

Jan 15, 2026, 12:00 AM

hardSoftware EngineerOnsiteCoding & Algorithms

PracticeRead