Two of the questions focused on arrays, requiring candidates to perform various operations such as element manipulation, subarray analysis, or optimization tasks like maximizing or minimizing specific values. These problems tested the understanding of array traversal techniques, use of auxiliary data structures, and efficiency in solving under time constraints. The third question was graph-based, possibly involving traversal algorithms like Depth-First Search (DFS) or Breadth-First Search (BFS), or classic shortest path algorithms such as Dijkstra’s or Floyd-Warshall. This question aimed to evaluate the candidate’s ability to model relationships, navigate through nodes and edges, and apply algorithmic thinking to solve real-world graph problems. Overall, the questions assessed a candidate’s logical reasoning, familiarity with core data structures, and ability to devise efficient solutions.