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

Software Engineering
, , , ,
1

hims & hers | Software Engineer | Phone Screen

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

The interview process began with a technical phone screen that focused on data structures and algorithms. I was asked a couple of problems related to arrays and strings. The interviewer was friendly and encouraged me to think out loud.

  1. The first question was about finding the longest substring without repeating characters, which required me to use a sliding window technique.
  2. The second problem involved merging two sorted arrays, and I had to discuss my approach thoroughly before moving to code it.

Overall, I felt the phone screen was fair and that I was given adequate time to solve the problems presented.

Interview Questions

Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters.

Difficulty: Medium | Reference: LC-3 | Tags: Sliding Window

Merge Sorted Array

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Difficulty: Easy | Reference: LC-88 | Tags: Array, Two Pointers