Problem database last updated: June 20, 2025
6 problems · 0 Easy, 6 Medium, 0 Hard · Ranked #211 of 458
0 Easy
0% · avg 23%
6 Medium
100% · avg 59%
0 Hard
0% · avg 18%
Based on 6 reported problems, Guidewire interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (100%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Guidewire puts unusual emphasis on breadth-first-search (33.3% of problems, 4x the industry average), sorting (33.3% of problems, 2.3x the industry average), dynamic-programming (33.3% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (66.7%), dynamic-programming (33.3%), breadth-first-search (33.3%), sorting (33.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Minimum Moves to Spread Stones Over Grid You are given a 0-indexed 2D integer matrix grid of size 3 3, representing the number of stones in each cell. The grid contains exactly 9 stones, and there can... | Medium | Very Likely | arraydynamic-programmingbacktracking | Solve |
Minimum Number of Operations to Sort a Binary Tree by Level You are given the root of a binary tree with unique values. | Medium | Very Likely | treebreadth-first-searchbinary-tree | Solve |
Construct the Longest New String You are given three integers x, y, and z. | Medium | Very Likely | mathdynamic-programminggreedy | Solve |
Kth Largest Element in an Array Given an integer array nums and an integer k, return the kth largest element in the array. | Medium | Very Likely | arraydivide-and-conquersorting | Solve |
Get Watched Videos by Your Friends There are n people, each person has a unique id between 0 and n-1. Given the arrays watchedVideos and friends, where watchedVideos[i] and friends[i] contain the... | Medium | Very Likely | arrayhash-tablebreadth-first-search | Solve |
Print Words Vertically Given a string s. Return all the words vertically in the same order in which they appear in s. Words are returned as a list of strings, complete with spaces whe... | Medium | Very Likely | arraystringsimulation | Solve |
Minimum Moves to Spread Stones Over Grid
SolveYou are given a 0-indexed 2D integer matrix grid of size 3 3, representing the number of stones in each cell. The grid contains exactly 9 stones, and there can...
Minimum Number of Operations to Sort a Binary Tree by Level
SolveYou are given the root of a binary tree with unique values.
Construct the Longest New String
SolveYou are given three integers x, y, and z.
Kth Largest Element in an Array
SolveGiven an integer array nums and an integer k, return the kth largest element in the array.
Get Watched Videos by Your Friends
SolveThere are n people, each person has a unique id between 0 and n-1. Given the arrays watchedVideos and friends, where watchedVideos[i] and friends[i] contain the...
Print Words Vertically
SolveGiven a string s. Return all the words vertically in the same order in which they appear in s. Words are returned as a list of strings, complete with spaces whe...
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Guidewire interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Guidewire interviews focus heavily on array, dynamic-programming, breadth-first-search problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Guidewire interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Guidewire has been reported to ask 6 distinct coding problems. The most common topics are array, dynamic-programming, breadth-first-search. 0 are Easy difficulty, 6 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 6 reported problems, Guidewire interviews are easier than average - only 0% Hard compared to 18% across all companies. 100% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, breadth-first-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Guidewire coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Guidewire interview with AIarrow_forward
