IBM - Interview Experience - SDE2 - Online assignment

Hack2hire Community · 2026-09-29T00:23:02.004Z

Result: Pending Number of Rounds: 1 Interview Questions & Experience Online Coding Assessment [problem 1 of 2] Count how many ways you can reach a total weight using items whose weights are integers from 1 to k, with unlimited copies of each weight allowed. Order doesn't matter, so [1, 2] and [2, 1] count as the same way. public int ways(int total, int k) {} Tips & Takeaways Similar with Leetcode 518 Coin change II

Interview Experiences

223308

Replies (3)

User-2pbew1d ago

only one round feels suspiciously fast

User-30kyw1d ago

was this for a senior role?

User-42xnt1d ago

coin change variant is classic dp stuff