Courses

Jobs

Interviews

Discussions

Guidewire Interview Questions

Showing 6 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Guidewire. The higher the ranking, the more likely you'll encounter it in a Guidewire interview.

Question

Frequency

Difficulty

Construct the Longest New String

You're given counts of 'A', 'B', and 'AB' strings. Combine them to construct the longest possible string where no two adjacent characters are the same.

Greedy Algorithms

Very likely

If you have a Guidewire interview, it's very likely that you will get this question

Medium

#1. Construct the Longest New String

Medium

You're given counts of 'A', 'B', and 'AB' strings. Combine them to construct the longest possible string where no two adjacent characters are the same.

Greedy Algorithms

This question is very likely to be asked in your Guidewire interview

Minimum Moves to Spread Stones Over Grid

You're given a grid where some cells have stones and others are empty. Find the minimum number of moves to redistribute the stones so that each cell has exactly one stone.

ArraysGreedy Algorithms

Somewhat likely

If you have a Guidewire interview, you might get this question

Medium

#2. Minimum Moves to Spread Stones Over Grid

Medium

You're given a grid where some cells have stones and others are empty. Find the minimum number of moves to redistribute the stones so that each cell has exactly one stone.

ArraysGreedy Algorithms

This question is somewhat likely to be asked in your Guidewire interview

Minimum Number of Operations to Sort a Binary Tree by Level

You're given a binary tree. Determine the minimum number of swaps needed at each level to sort the node values in ascending order.

TreesArraysGreedy Algorithms

Somewhat likely

If you have a Guidewire interview, you might get this question

Medium

#3. Minimum Number of Operations to Sort a Binary Tree by Level

Medium

You're given a binary tree. Determine the minimum number of swaps needed at each level to sort the node values in ascending order.

TreesArraysGreedy Algorithms

This question is somewhat likely to be asked in your Guidewire interview

Get Watched Videos by Your Friends

You're given information about friend connections and watched videos. Find the videos watched by friends at a specific level in the social network, sorted by frequency and then alphabetically.

ArraysGraphsBreadth-first Search

Not likely

If you have a Guidewire interview, it's unlikely that you will get this question

Medium

#4. Get Watched Videos by Your Friends

Medium

You're given information about friend connections and watched videos. Find the videos watched by friends at a specific level in the social network, sorted by frequency and then alphabetically.

ArraysGraphsBreadth-first Search

This question is not likely to be asked in your Guidewire interview

Print Words Vertically

Given a sentence, rearrange and print each word vertically. Essentially, create a series of strings where each string represents a column of the original sentence.

ArraysStrings

Not likely

If you have a Guidewire interview, it's unlikely that you will get this question

Medium

#5. Print Words Vertically

Medium

Given a sentence, rearrange and print each word vertically. Essentially, create a series of strings where each string represents a column of the original sentence.

ArraysStrings

This question is not likely to be asked in your Guidewire interview

Kth Largest Element in an Array

Find the kth largest element in an unsorted array. Note that it is the kth largest element in sorted order, not the kth distinct element.

ArraysTwo Pointers

Not likely

If you have a Guidewire interview, it's unlikely that you will get this question

Medium

#6. Kth Largest Element in an Array

Medium

Find the kth largest element in an unsorted array. Note that it is the kth largest element in sorted order, not the kth distinct element.

ArraysTwo Pointers

This question is not likely to be asked in your Guidewire interview