Great fun, amazing, great again.
None that I can find.
Asked algorithm questions about: * Linked lists * Graphs * Minimum spanning trees * Binary trees * Cyclic linked lists * Reversed linked lists * Preorder, inorder, and postorder traversal of trees Also asked about a lot of data structures and trees
The interview was very pleasant despite the stress. The jury was understanding and very cordial. I gained a good experience from it, even though I wasn't selected. It was a pleasure to be able to have such an experience!
Tell me about yourself. How would you describe yourself? What makes you unique? Why do you want to work here? What interests you about this role? What motivates you? What are you passionate about? Why are you leaving your current job? What ar
Asked algorithm questions about: * Linked lists * Graphs * Minimum spanning trees * Binary trees * Cyclic linked lists * Reversed linked lists * Preorder, inorder, and postorder traversal of trees Also asked about a lot of data structures and trees
The interview was very pleasant despite the stress. The jury was understanding and very cordial. I gained a good experience from it, even though I wasn't selected. It was a pleasure to be able to have such an experience!
Tell me about yourself. How would you describe yourself? What makes you unique? Why do you want to work here? What interests you about this role? What motivates you? What are you passionate about? Why are you leaving your current job? What ar