GE Healthcare coding interview
questions, leaked.
7 problems reported across recent GE Healthcare interviews. Top patterns: array, stack, string. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
GE Healthcare's assessment hits you with 7 problems across medium and hard difficulty. Arrays dominate the distribution, appearing in five problems, but don't sleep on stacks, which show up in three. You'll see at least one graph problem, one tree traversal, and string work mixed in. The real pressure: two hard problems in a short window. If you haven't drilled monotonic stacks or know the Valid Parentheses / Evaluate Division patterns cold, StealthCoder runs invisible during the assessment and surfaces working solutions when you hit a wall.
Top problems at GE Healthcare
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Concatenation of Array | EASY | 100.0 | 90% | Array · Simulation |
| 02 | Evaluate Division | MEDIUM | 95.1 | 63% | Array · String · Depth-First Search |
| 03 | Valid Parentheses | EASY | 84.9 | 42% | String · Stack |
| 04 | Lowest Common Ancestor of a Binary Tree | MEDIUM | 73.8 | 67% | Tree · Depth-First Search · Binary Tree |
| 05 | Number of Visible People in a Queue | HARD | 64.9 | 71% | Array · Stack · Monotonic Stack |
| 06 | Employee Free Time | HARD | 64.9 | 73% | Array · Line Sweep · Sorting |
| 07 | Car Fleet | MEDIUM | 64.9 | 53% | Array · Stack · Sorting |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual GE Healthcare OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage.
Get StealthCoder- array5 · 71%
- stack3 · 43%
- string2 · 29%
- depth first search2 · 29%
- monotonic stack2 · 29%
- sorting2 · 29%
- breadth first search1 · 14%
- union find1 · 14%
- graph1 · 14%
- shortest path1 · 14%
The topic breakdown tells you what to prioritize. Arrays are the foundation of GE Healthcare's filter, so you need speed there. Stacks come second, and monotonic stacks appear twice, which means at least one problem requires you to know that pattern. Depth-first search and sorting both appear twice, so you're looking at a hybrid where tree/graph traversal mixes with array-based optimization. The hard problems (Number of Visible People in a Queue and Employee Free Time) lean heavy on stacks and sorting, so those are your last-minute drills. When you're live, if you blank on a monotonic-stack or shortest-path problem, StealthCoder sits invisible and hands you the code. Study the easy problems first to build confidence, then own Car Fleet and Valid Parentheses before test day.
Companies with similar patterns
If you prepped for GE Healthcare, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass GE Healthcare.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an engineer who got tired of watching his cohort grind for six months and still get filtered at the OA stage. Works on HackerRank, CodeSignal, CoderPad, and Karat.
GE Healthcare interview FAQ
Should I drill array problems first for GE Healthcare?+
Yes. Five of seven problems involve arrays, so array fundamentals and array-specific patterns (simulation, sorting, monotonic stacks on arrays) are your foundation. Start there, then layer in stacks and strings. You'll hit diminishing returns on other topics.
How many monotonic-stack problems should I solve before the OA?+
At least two. Monotonic stacks appear twice in GE Healthcare's reported list and are notably hard to invent under pressure. Car Fleet and Number of Visible People in a Queue are your templates. Drill those patterns until you can code them in under 3 minutes.
Is Valid Parentheses enough stack practice?+
It's a start, not enough. Valid Parentheses teaches the basic stack pattern, but GE Healthcare's assessment also tests monotonic stacks and more complex stack uses. Use Valid Parentheses as a warmup, then move to Car Fleet and Number of Visible People to see how stacks handle real constraints.
What order should I tackle the hard problems?+
Hit Car Fleet first. It combines arrays, sorting, and monotonic stacks, so it teaches you three topics at once. Then tackle Number of Visible People in a Queue, which deepens your monotonic-stack intuition. Employee Free Time is a line-sweep variant, so save that for last.
Do I need to study graph and tree problems deeply?+
Not equally. Graph appears once (Evaluate Division, which is really about union-find and shortest path), and tree appears once (Lowest Common Ancestor). Study both, but don't spend days on them. Array, stack, and string patterns will account for most of your assessment.