Guidewire LeetCode Questions
5 questions all-time · 0 easy · 5 medium · 0 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Minimum Moves to Spread Stones Over Grid Array, Dynamic Programming, Backtracking, Bit Manipulation, Matrix, Bitmask | Medium | 100 | 0.5% |
| 2 | Minimum Number of Operations to Sort a Binary Tree by Level Tree, Breadth-First Search, Binary Tree | Medium | 100 | 0.7% |
| 3 | Construct the Longest New String Math, Dynamic Programming, Greedy, Brainteaser | Medium | 100 | 0.5% |
| 4 | Print Words Vertically Array, String, Simulation | Medium | 100 | 0.7% |
| 5 | Get Watched Videos by Your Friends Array, Hash Table, Breadth-First Search, Graph Theory, Sorting | Medium | 89 | 0.5% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.