hims & hers | Software Engineer | Phone Screen
Timeline: 2025(Oct - Dec) • Fulltime • JobHopper • 
Waiting for result
This interview was mainly focused on technical questions, specifically data structures and algorithms. I was asked to solve a problem on tree traversal, which involved writing a function to return the preorder of a binary tree. After solving that, we discussed the time complexity and possible improvements to the solution.
The interviewer also went over my resume and asked about my previous experiences. I had to explain a project that involved building a recommendation system, focusing on user experience metrics and the algorithms used. Overall, it was a good interview that allowed me to showcase my skills and knowledge in software engineering.
Interview Questions
Binary Tree Preorder Traversal
Given the root of a binary tree, return the preorder traversal of its nodes’ values.
Difficulty: Medium | Reference: LC-144 | Tags: Tree, Depth-First Search