Tech Phone Screen at hims & hers: Software Engineer Fulltime Role

hims & hers | Software Engineer | Phone Screen

Timeline: 2025(Oct - Dec) • Fulltime • JobHopper • :hourglass_not_done: Waiting for result


I had a tech phone screen interview for a software engineering position at Hims & Hers. The interview lasted for about an hour. The interviewer was very friendly and made me feel comfortable right from the start. We went through a brief introduction, and then I was asked to share my screen to solve a coding problem. The main challenge was to implement a specific algorithm related to data processing.

I spent some time discussing my thought process, initiating a conversation about edge cases and optimization techniques as I coded. The interviewer asked questions to gauge my understanding of the problem and how I would approach similar problems in the future.

After the coding challenge, there was a short discussion about my past projects and experience. They seemed genuinely interested in my experience and fit for the team. Overall, it was a positive experience, and I felt that I performed well in both the coding and the discussion part of the interview.

Interview Questions

Data Log Transmission and Storage Design

Design a data log transmission and storage system that is robust and efficient.

Difficulty: Medium | Reference: LC-105 | Tags: System Design

Rate Limiting and Log Collection Design

Design a system for rate limiting APIs and collecting logs efficiently.

Difficulty: Hard | Reference: LC-106 | Tags: System Design

Arithmetic Expression Simplification

Given an arithmetic expression, simplify it to its simplest form.

Difficulty: Medium | Reference: LC-107 | Tags: Mathematics

Tree Distance Sum Problem

Calculate the sum of distances from a node to all other nodes in a tree.

Difficulty: Medium | Reference: LC-108 | Tags: Tree, DFS

Fibonacci Tree Path Calculation Using Preorder Numbering

Calculate the paths in a binary tree based on Fibonacci numbering.

Difficulty: Medium | Reference: LC-109 | Tags: Tree, Dynamic Programming