Skip to content
Related Articles

Related Articles

OneDirect Bangalore Interview Experience ( 6+ Years)
  • Difficulty Level : Hard
  • Last Updated : 05 Aug, 2019

Pen and Paper were given and 4 Questions were there. And no time limit.

1. Given a value N, if we want to make change for N cents, and we have infinite supply of each of S = { S1, S2, .., Sm} valued coins, how many ways can we make the change? The order of coins doesn’t matter.
For example, for N = 4 and S = {1, 2, 3}, there are four solutions: {1, 1, 1, 1}, {1, 1, 2}, {2, 2}, {1, 3}. So output should be 4. For N = 10 and S = {2, 5, 3, 6}, there are five solutions: {2, 2, 2, 2, 2}, {2, 2, 3, 3}, {2, 2, 6}, {2, 3, 5} and {5, 5}. So the output should be 5. Print all possible solution.

2. Some related to Matrix, I don’t remember, because i didn’t tried 🙂

3. Design your own cache, Write HLD and LLD for distributed system.

4. Design Notification System where you can Send Email, SMS, Notification. HLD and LLD.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.   In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :