Guidewire coding interview
questions, leaked.
6 problems reported across recent Guidewire interviews. Top patterns: array, breadth first search, dynamic programming. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Guidewire's assessment is all medium difficulty, no warm-up. You get six problems spanning arrays, graph traversal, and dynamic programming. Arrays dominate the question set, appearing in two thirds of what they ask. The good news: no hard problems means no trick cases designed to tank you. The catch: medium problems at Guidewire require clean implementation under pressure. If you hit a wall on the live assessment, StealthCoder runs invisibly during screen share and surfaces a working solution in seconds, so you stay moving instead of spiraling on one problem.
Top problems at Guidewire
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Construct the Longest New String | MEDIUM | 100.0 | 54% | Math · Dynamic Programming · Greedy |
| 02 | Minimum Moves to Spread Stones Over Grid | MEDIUM | 100.0 | 44% | Array · Dynamic Programming · Breadth-First Search |
| 03 | Minimum Number of Operations to Sort a Binary Tree by Level | MEDIUM | 100.0 | 74% | Tree · Breadth-First Search · Binary Tree |
| 04 | Print Words Vertically | MEDIUM | 89.3 | 66% | Array · String · Simulation |
| 05 | Get Watched Videos by Your Friends | MEDIUM | 89.3 | 50% | Array · Hash Table · Breadth-First Search |
| 06 | Kth Largest Element in an Array | MEDIUM | 89.3 | 68% | Array · Divide and Conquer · 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 Guidewire OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array4 · 67%
- breadth first search3 · 50%
- dynamic programming2 · 33%
- sorting2 · 33%
- string1 · 17%
- simulation1 · 17%
- math1 · 17%
- greedy1 · 17%
- brainteaser1 · 17%
- matrix1 · 17%
Arrays and breadth-first search are the axis of Guidewire's assessment. Four of six problems involve array manipulation, and BFS shows up in three. Dynamic programming appears in two, often paired with optimization constraints. You'll face problems like spreading stones across a grid and finding the longest string through constrained selection. These aren't trick problems, but they demand you translate problem logic into code without getting lost in state management. Study array indexing and BFS graph construction first. Sorting and tree traversal show up less frequently, but one problem chains BFS with tree-level operations. The math and greedy angle in the longest-string problem suggests Guidewire values algorithmic trade-off thinking. StealthCoder is your hedge if you blank on DP recurrence or BFS state during the actual assessment.
Companies with similar patterns
If you prepped for Guidewire, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Guidewire.
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 Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Guidewire interview FAQ
What should I study first for Guidewire's assessment?+
Arrays and breadth-first search. They appear in four and three of the six problems respectively. Nail array iteration, slicing, and 2D indexing. Then build BFS muscle with graph and matrix traversal. DP and sorting matter less by frequency, so study them second.
How many medium-difficulty array problems should I solve before the assessment?+
At minimum 10 to 15 medium array problems covering iteration, manipulation, and multi-dimensional indexing. Guidewire's assessment is all medium, and four of six problems touch arrays. You need to code these automatically without thinking.
Is it worth drilling dynamic programming for Guidewire?+
Yes, but second priority. Two of six problems use DP, and one combines it with greedy reasoning. Spend time on BFS and arrays first, then move to DP recurrence and memoization patterns if you have time.
Will I see hard problems in Guidewire's assessment?+
No. All six reported problems are medium difficulty. This means fewer edge cases and trick logic, but tighter time pressure because you're expected to code clean and fast. No hard problems doesn't mean easy.
What's the best way to prepare for the breadth-first search questions?+
Solve 8 to 12 BFS problems on graphs and matrices. Guidewire uses BFS in three of six problems, often paired with arrays or trees. Practice queue initialization, neighbor generation, and visited-state tracking until you can write BFS in your sleep.