Voxel Labs

The first question involved graph paths, requiring me to determine if a path constituted a Hamiltonian path. This helped me become more familiar with the logic of using a HashMap to build an adjacency list and traverse node relationships during implementation. The second question concerned determining the mirror symmetry of a binary tree. A short implementation could be written using level-order traversal and simple symmetry comparison. This question primarily tested logical clarity. The third question involved processing a string array, finding the third longest word, testing sorting and basic data manipulation skills. Overall, these questions weren't difficult, but they all emphasized code conciseness and logical thinking. For me, it was a good exercise in combining basic data structures, string processing, and coding style.