Not so great work-life balance.
A random person comes with a certain attitude, copies a hard question from LeetCode or GeeksforGeeks, pastes it in the chat, and then enjoys. No matter how you solve it or how many ways you explain it to that person, if it doesn't match the most opt
Several Data Structures and Algorithms (DSA) rounds involved graph problems and binary search. I was asked to write code for burning a tree, a binary tree problem. Additionally, I was asked the question around Koko eating bananas.
It was smooth, and everyone was nice. It was not too deep, and the technical round was a little bit hard, but if we prepare, it will not be an issue. Please make sure all the things that we say are noted, and questions can come according to them.
A random person comes with a certain attitude, copies a hard question from LeetCode or GeeksforGeeks, pastes it in the chat, and then enjoys. No matter how you solve it or how many ways you explain it to that person, if it doesn't match the most opt
Several Data Structures and Algorithms (DSA) rounds involved graph problems and binary search. I was asked to write code for burning a tree, a binary tree problem. Additionally, I was asked the question around Koko eating bananas.
It was smooth, and everyone was nice. It was not too deep, and the technical round was a little bit hard, but if we prepare, it will not be an issue. Please make sure all the things that we say are noted, and questions can come according to them.