← Back to Directory

GE HealthCare

Large Enterprises

Screna has 3 GE HealthCare interview write-ups. The most reported round is the technical phone screen (3).

3 interview notes · updated Jul 2026

GE HealthCare·Software Engineer·Technical Phone Screen

May 2026
Had a coding round with GE HealthCare that was basically one algorithmic problem the whole time. Pretty focused session, nothing behavioral, just grind through the logic.
  • You're given a string of 'Y' and 'N' characters representing customer arrivals per hour. You pick a closing time j, and the penalty is the count of empty hours before j plus the count of customers who show up after j. Find the earliest closing time that minimizes this penalty.

“Took me a minute to even parse what the penalty function was doing.”

View Post

GE HealthCare·Software Engineer·Technical Phone Screen

Apr 2026
Interviewed for a Software Engineer role at GE HealthCare and got a monotonic stack problem that I'd seen before but still fumbled the edge cases under pressure.
  • Given an array of heights representing people standing in a line, for each person determine how many people to their right they can see. A person can see another if everyone standing between them is shorter than both of them.

“I knew a stack was involved but spent too long trying to build it left-to-right before realizing scanning from the right makes way more sense.”

View Post

GE HealthCare·Software Engineer·Technical Phone Screen

Apr 2026
Got a grid-based algorithm question at GE HealthCare, which felt more like a competitive programming problem than anything I'd expect from a healthtech company. The question had layers to it and they wanted you to walk through both the naive and optimized approaches, which caught me a bit flat-footed.
  • Given an M x N grid of 0s and 1s where 1 represents a CVS store location, compute the distance from every cell to its nearest store, then find the placement of stores that minimizes the total sum of all those distances. Walk through a brute-force approach and an optimized solution and explain the trade-offs.

“I started with brute force, BFS from every cell independently to find its nearest 1.”

View Post