hims & hers | Software Engineer | Phone Screen
Timeline: 2025(Oct - Dec) • Fulltime • JobHopper • 
Waiting for result
I had a phone screen interview with hims & hers for a Software Engineer full-time role. The interviewer asked me about my background and experiences, then moved onto technical questions related to algorithms and data structures. I was asked to explain the time complexity of various sorting algorithms and to implement a binary search tree traversal algorithm.
After that, I was given a coding problem to solve live. The problem involved finding the shortest path in a graph. I implemented a breadth-first search (BFS) algorithm and discussed the edge cases to ensure my solution was robust.
The interviewer also asked behavioral questions such as how I handle conflicts in a team and my strategies for balancing multiple projects. Overall, the interview lasted about an hour, and I felt it went quite well. I’m now waiting for feedback to see if I progress to the next round.
Interview Questions
Binary Search Tree Traversal
Implement an algorithm to traverse a binary search tree in-order, pre-order, and post-order.
Difficulty: Medium | Reference: LC-94 | Tags: Tree, DFS
Shortest Path in a Graph
Given a graph, find the shortest path from a starting node to a target node using BFS.
Difficulty: Medium | Reference: LC-1091 | Tags: Graph, BFS