Good in terms of career
Nothing as such, as of now.
One phone interview followed by five on-site interviews. Data Structures and Algorithms questions were asked, focusing on probability, heaps, dynamic programming, and greedy algorithms. No questions were repeated. Overall, a huge amount of brainsto
Tough! The process involved one screening round followed by three coding rounds: * Two DSA-focused rounds * One ML-focused round I performed well in the ML round, but surprisingly, the feedback was negative, and I did not receive an offer.
You are given pi in the form of a string, e.g., `pi = "314159265359"`. You have to return a list of indices where `i = pi[i]`. Consider 1-based indices. For multi-digit indices, this is the matching criteria: If `i = 456`, then `pi[454] = '4'`, `p
One phone interview followed by five on-site interviews. Data Structures and Algorithms questions were asked, focusing on probability, heaps, dynamic programming, and greedy algorithms. No questions were repeated. Overall, a huge amount of brainsto
Tough! The process involved one screening round followed by three coding rounds: * Two DSA-focused rounds * One ML-focused round I performed well in the ML round, but surprisingly, the feedback was negative, and I did not receive an offer.
You are given pi in the form of a string, e.g., `pi = "314159265359"`. You have to return a list of indices where `i = pi[i]`. Consider 1-based indices. For multi-digit indices, this is the matching criteria: If `i = 456`, then `pi[454] = '4'`, `p