LeetCode Question · Oct 2024

Ibm oa - How would you even solve this? Looks like a DP problem, can't find it on leetcode though

SWE OA

1 upvote 240 views 2 replies

Question Details

Give an array of integers of length n, arr, and two integers l and r, find another array brr, such that: - l <= brr[i] <= r - brr[i] - arr[i] <...

🔒

Unlock all IBM questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

This is a reported interview question from a ibm interview for a swe role during the oa round reported in 2024.

It covers the following topics: Arrays, Dynamic Programming .