Start With OA
2 Question

** Topological Sorting with greedy

** Bitmask DP

Could able to only done 1.5 question (OA was offline)

Round 1

1. Hard Greedy - able to solve and give the approach but she said to code and run the following test cases but my compiler is not running not the online compiler for 15 minutes then able to run it and solved all test cases

2. trie bases problem -able to solve the question within few minutes as time was less she said to write the approach and pseudocode on paper able to write it

Verdict - Rejected (FeedBack - poor code quality)

First time i was thinking i could pass this and this time code quality

College - Tier 1 (DTU,NSUT,IITD)
Tips- Focus also on code quality to all of them who are preparing for the interviews nowadays they have so much expectations

Just hoping for the best
All the best to Me