LeetCode Question · Sep 2023

Weird error on IBM intern OA

465 views 1 reply

Question Details

Heres the question: Profitable Triplets Given the arrays prices and profits of length n, find the max profit you can make. Profit = profit[i] + profit[j] + profit[k] given prices[i] < prices[j]...

Full Details

🔒

Unlock all IBM questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a ibm interview for a swe role (intern level) during the oa round reported in 2023.

It covers the following topics: Arrays, Binary Search, Dynamic Programming, Recursion .