Higher salary and future opportunities
No job security and not any paper.
Round 1 (Coding Test): The first round was a coding round lasting 30 minutes, featuring only one question. The code was simple. The question was: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
Easy, asked intro. Why ECE to IT? Why Accenture? Favorite actor. About my hobby. About my project details. Cross-questioning in my project. Yeah, that's what happened. The interview is just 13 minutes long.
The questions asked were about: * Data Structures and Algorithms (DSA) * Binary Search Trees (BST), including inserting and deleting elements * Differences between arrays and linked lists * Time complexity in a hash table * Writing simple programs,
Round 1 (Coding Test): The first round was a coding round lasting 30 minutes, featuring only one question. The code was simple. The question was: Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST.
Easy, asked intro. Why ECE to IT? Why Accenture? Favorite actor. About my hobby. About my project details. Cross-questioning in my project. Yeah, that's what happened. The interview is just 13 minutes long.
The questions asked were about: * Data Structures and Algorithms (DSA) * Binary Search Trees (BST), including inserting and deleting elements * Differences between arrays and linked lists * Time complexity in a hash table * Writing simple programs,