I got a call from the recruiter stating my availability, and they scheduled the first round.

The first round was a DSA round that consisted of two DSA questions:

1. A DP problem. I was able to solve it with an optimized approach.
2. An NP-hard problem on graphs. I tried and came to a brute-force solution but wasn't able to cover all the use cases.

I was rejected in the first round.

String problem based on greedy approach. DP problem.