Hi Community,

I want a feedback from all of you, I had my Round 2 for SDE-1 role at Amazon and I got asked 2 DSA questions followed by some LP's.

1. Word Ladder - [Hard]
2. Count Beautiful Splits in the Array - [Medium acc. to LC]

I have prepared alot for these, So I was able to code the most optimal solution for the first question + Was able to give some approach for the Second one, but my code is not 100% correct and I even said this in the interview that I need more time to solve this.

What are your views on the difficulty of the second question. It uses Rolling Hash + Z function + DP. I dont know what was expected out of me.
I gave a Brute + DP approach but not sure of that as well.

Any feedback to, If I will qualify for the Bar Raiser?