← Back to Directory

GE HealthCare

Large Enterprises

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

3 interview notes · updated Jun 2026

GE HealthCare·Software Engineer·Technical Phone Screen

May 2026
Got a coding question from GE HealthCare that looked deceptively simple at first glance. Sliding window / prefix sum type problem, the kind where you feel like you're almost there and then spend 20 minutes debugging an off-by-one.
  • Given a string of 'Y' and 'N' characters representing customer arrivals per hour, find the earliest closing hour that minimizes the total penalty, where penalty is the count of empty open hours before closing plus the count of customers who arrive after closing.

“My first instinct was brute force, just loop over every possible closing time and compute the penalty.”

View Post

GE HealthCare·Software Engineer·Online Assessment (OA)

Apr 2026
Interviewed for a Software Engineer role at GE HealthCare and got a stack-based problem that looked deceptively manageable until I started thinking about the edge cases. Not a lot to say about the process itself since this was pretty focused on the one coding problem.
  • Given an array of heights representing people standing in a line, determine how many people each person can see to their right. A person at position i can see person at position j (j > i) only if everyone standing between them is strictly shorter than both of them. Return an array where each entry is the count of visible people for that index.

“My first instinct was brute force, which obviously doesn't scale.”

View Post

GE HealthCare·Software Engineer·Technical Phone Screen

Apr 2026
Got a grid-based algorithm question at GE HealthCare, felt pretty standard at first but the follow-up about optimizing the total sum is where things got interesting. Came away thinking I probably undersold the BFS approach.
  • Given an M x N grid of 0s and 1s where 1s represent store locations, compute the distance from every cell to its nearest store, then find the arrangement or approach that minimizes the total sum of all those distances. Walk through a brute-force solution and an optimized one, and compare the trade-offs.

“I started with the brute-force: for each cell, BFS or just compute Manhattan distances to every 1 in the grid, take the min.”

View Post