Parks and Benified of the Oracle
An online HackerRank test on AI, LLMs, aptitude, and coding was conducted initially. Later, the selection process continued with a face-to-face coding round, followed by a detailed managerial interview round.
Technical Rounds Round 1: * Determine if a given strict binary tree is balanced. * Criteria: Has equal nodes on both sides of the root node, and the depth from the root node is the same from both sides. * Swap two variables without using
Easy to medium interview. Typically three to four rounds: * Basic data structure questions. * Some on-spot coding questions on linked lists, trees, or strings. * Some math puzzles about time and measurements. One online test with four sections: *
An online HackerRank test on AI, LLMs, aptitude, and coding was conducted initially. Later, the selection process continued with a face-to-face coding round, followed by a detailed managerial interview round.
Technical Rounds Round 1: * Determine if a given strict binary tree is balanced. * Criteria: Has equal nodes on both sides of the root node, and the depth from the root node is the same from both sides. * Swap two variables without using
Easy to medium interview. Typically three to four rounds: * Basic data structure questions. * Some on-spot coding questions on linked lists, trees, or strings. * Some math puzzles about time and measurements. One online test with four sections: *