Home Problem Set Companies Projects Contribute Requests

Loading Question...

The Best Team With No Conflicts - THOUGHTSPOT Online Assessment IIT BHU - THOUGHTSPOT Interview Question | Codinzhub

CodinzHub

Home Problem Set Companies Projects Contribute Requests

The Best Team With No Conflicts - THOUGHTSPOT Online Assessment IIT BHU

Coder Coder is selecting players for an upcoming championship.

There are N players. Each player has:

An age
A score

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

solution.cpp

Run code to see test results

00:00 / 69:42

The Best Team With No Conflicts - THOUGHTSPOT Online Assessment IIT BHU

MediumMed•1,074 views

Coder Coder is selecting players for an upcoming championship.

There are N players. Each player has:

An age
A score

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

Ending preview

…

MediumMed•1,074 views

Asked at

THOUGHTSPOT

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub

Up Next

Eternal Online Assessment - IIT Bombay

Eternal • Pending

Swapped Neighbour Scans Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Peak Profit Window Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Cold Start Inmobi Online Assessment - IIT Kanpur 24th September

Inmobi • Pending

Bank Transactions Squarepoint Capital - IIT Kanpur 26th September

Squarepoint Capital • Pending

Last updated Sep 2026