IBM (OA)

Posted
2 Jul 2025
411 reads

Summary

I participated in an IBM Online Assessment where I encountered two algorithm problems, 'Maximize Decryption Value' and 'Maximum Distinct Split Sum'. I was unable to solve them efficiently due to time complexity issues.

How it went

There are two questions:

1.LeetCode 239 helps with sliding-window strategies
Actual Question: Maximize Decryption Value (LC)

2.LeetCode 410 helps with partitioning logic if adapted for distinct counts
Actual Question: Maximum Distinct Split Sum

These are not exactly the same questions, but they seem similar in concept.

And I just solved 0 of them because I failed due to time complexity in one problem

Questions asked (2)

  1. 01

    Maximize Decryption Value

    Data Structures & Algorithms

    The actual question was 'Maximize Decryption Value'. The author noted that LeetCode 239 (Sliding Window Maximum) provides useful strategies for this type of problem, suggesting it involves sliding window techniques.

  2. 02

    Maximum Distinct Split Sum

    Data Structures & Algorithms

    The actual question was 'Maximum Distinct Split Sum'. The author noted that LeetCode 410 (Split Array Largest Sum) provides useful partitioning logic when adapted for distinct counts, suggesting it involves partitioning and possibly dynamic programming or binary search on the answer.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at IBM recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!