First round:
In October, I had an interview that started with a brief introduction. We quickly transitioned to a shared document where the interviewer pasted a question and asked if I could understand it. After reading through it, we moved into a discussion.

Question Summary: Although I don’t recall the exact wording, the question involved being given a list of pairs, where each pair indicated that the first character is greater than the second. The task was to find a proper increasing sequence of all the characters if possible, otherwise return 'None'. For example, the list might look like: [['a', 'b'], ['b', 'd'], ['d', 'c'], ['a', 'd'], ['a', 'c']] (where ‘a > b’, ‘b > d’, and so on).
Initially, I misunderstood the question, but after the interviewer clarified, I realized that the problem could be solved using graph concepts. After a while, it clicked for me that this problem could be approached using topological sorting. I told my approach to the interviewer, and after that he told me to code.
But the main twist is that i know only theoretical aspects of topological sort and havent written code a single time, so i am not able to code it (in short span of time i had practiced and focused more on binary search dp and graph basics dfs and bfs ).
This interview was my worst interview ever i am not not this much silent in any of my interview , I was feeling very bad that i should practice more and focused more on advanced ds , Really i wasted this opportunity by my own, Now waiting for rejection mail :(
I will prepare well again next time and appear again :)
That's it!!
Thanks!!!!