GE Digital coding interview
questions, leaked.
3 problems reported across recent GE Digital interviews. Top patterns: math, enumeration, array. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
GE Digital's assessment is lean, just three problems across easy and medium difficulty. You're looking at array and hash-table work paired with string and stack logic, plus a math enumeration problem that catches people off guard. The small sample size means every problem counts, and gaps in fundamentals show immediately. If you hit a wall on the live assessment, StealthCoder sits invisibly on your screen and surfaces a working solution in seconds, invisible to the proctor. You're not here to grind 200 problems. You're here to own these three patterns before you sit down.
Top problems at GE Digital
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Degree of an Array | EASY | 100.0 | 57% | Array · Hash Table |
| 02 | Minimum Cost to Set Cooking Time | MEDIUM | 75.5 | 41% | Math · Enumeration |
| 03 | Minimum Remove to Make Valid Parentheses | MEDIUM | 67.3 | 71% | String · Stack |
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 Digital OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share.
Get StealthCoder- math1 · 33%
- enumeration1 · 33%
- array1 · 33%
- hash table1 · 33%
- string1 · 33%
- stack1 · 33%
The distribution is deceptive because it's so compact. Two medium problems anchor the difficulty, with a single easy problem to start. Math and enumeration appear once each, which means GE Digital is testing whether you can think through combinatorial logic under pressure, not just regurgitate sorting code. Array and hash-table is your bread and butter, string and stack comes next. All six topics appear across just three problems, so each one is doing heavy lifting. Don't waste time drilling variants of problems you've already solved. Instead, map the three specific problem patterns, understand why each medium problem is medium, and use StealthCoder as your safety net if the enumeration logic doesn't click in real time.
Companies with similar patterns
If you prepped for GE Digital, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass GE Digital.
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 at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share. Works on HackerRank, CodeSignal, CoderPad, and Karat.
GE Digital interview FAQ
How much time should I spend on math and enumeration problems for GE Digital?+
One of your three problems is math and enumeration combined. That's 33 percent of the assessment. Don't skip it. Spend time understanding the 'Minimum Cost to Set Cooking Time' problem specifically. The enumeration piece is what trips people up when they haven't thought through all possible states.
Is the easy problem worth studying if I already know arrays?+
Yes. 'Degree of an Array' uses both array and hash-table logic. Even easy problems at GE Digital test clean implementation. Use it to verify your hash-table instincts are solid before you hit the medium problems.
Should I drill string and stack problems separately or together?+
Together. The 'Minimum Remove to Make Valid Parentheses' problem is medium difficulty and combines both. Drill stack-based string manipulation as one pattern, not two. That's where your practice time pays off.
What topic should I study first for this assessment?+
Start with hash-table and array since they appear first in the assessment and ground you in simpler logic. Then move to string and stack, then tackle the math enumeration problem last. It's the hardest conceptually.
Is two medium problems enough preparation or should I find harder variants?+
Two medium problems are your actual ceiling at GE Digital. Don't burn time on hard problems from other companies. Instead, solve these three until you can code each in under 10 minutes cleanly. That's your real edge.