i
Guidewire Software
Filter interviews by
Coding test was medium to hard leetcode problems.
What people are saying about Guidewire Software
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
posted on 13 Feb 2024
I applied via Referral
Java internals, coding questions 2sum
Developed a web-based project management tool for tracking tasks and deadlines.
Used React.js for front-end development
Implemented RESTful APIs for backend using Node.js and Express
Utilized MongoDB for database storage
Incorporated authentication and authorization features for user security
Open to relocation for the right opportunity
Willing to relocate for the right job opportunity
Flexible with location for the right role
Open to considering different locations for the right position
I applied via Naukri.com and was interviewed in Mar 2023. There were 2 interview rounds.
Reactive forms in Angular are a way to build forms in a reactive and scalable way.
Reactive forms use an underlying data model to manage form data.
They allow for dynamic form creation and validation.
They can be used with complex form structures and nested forms.
They provide a more scalable and maintainable approach to form development.
Example: Creating a reactive form with FormBuilder in Angular.
I applied via Campus Placement and was interviewed before Oct 2022. There were 3 interview rounds.
There will be 3 coding questions, Easy, moderate and hard level.
I applied via Campus Placement and was interviewed in Jul 2024. There was 1 interview round.
3 hours was the duration of the test. 3 questions were asked
I applied via Campus Placement and was interviewed before Oct 2023. There were 2 interview rounds.
3 coding questions - medium
I applied via Campus Placement and was interviewed in Apr 2023. There were 3 interview rounds.
Platform - Mettl
3 Questions of medium level difficulty to do in 2 hours, typically contain concepts like DSA, DP etc.
Structure padding is the insertion of unused bytes between structure members to align them on memory boundaries.
Padding is added to ensure that each member of a structure starts at a memory address that is a multiple of its size.
Padding is compiler-dependent and can vary between different platforms and architectures.
Padding can affect the size of a structure and the performance of the program.
Example: struct example { ...
Forming a dictionary from name
Create an empty dictionary
Iterate through each character in the name
Add the character as a key and its frequency as value in the dictionary
based on 1 interview
Interview experience
based on 2 reviews
Rating in categories
Business Operations Manager
16
salaries
| ₹22 L/yr - ₹27 L/yr |
Software Engineer
14
salaries
| ₹9 L/yr - ₹27 L/yr |
ETL Developer
13
salaries
| ₹14 L/yr - ₹18 L/yr |
Senior Software Engineer
9
salaries
| ₹18 L/yr - ₹55 L/yr |
QA Engineer
7
salaries
| ₹7 L/yr - ₹14.4 L/yr |
Duck Creek Technologies
FinThrive
Mobileum
AgreeYa Solutions