i
Willis Towers Watson
Filter interviews by
Clear (1)
I applied via Campus Placement
Top trending discussions
I applied via Naukri.com and was interviewed in Apr 2020. There was 1 interview round.
Synchronous means happening at the same time, while asynchronous means not happening at the same time.
Synchronous operations occur in real-time, while asynchronous operations can be delayed or queued.
Synchronous operations block the program until they are completed, while asynchronous operations allow the program to continue running.
Examples of synchronous operations include function calls and loops, while examples of ...
CTE and temp table usage in SQL
Use CTE for recursive queries and complex subqueries
Use temp tables for large data sets and complex queries
CTE is more efficient for small data sets
Temp tables can be indexed for faster performance
Consider the scope and lifespan of the data when choosing between CTE and temp table
Agile Scrum methodology is a framework for managing and completing complex projects.
Agile Scrum is based on iterative and incremental development.
It involves breaking down the project into smaller tasks called user stories.
Scrum teams work in sprints, typically 2-4 weeks long, to deliver a potentially shippable product increment.
Daily stand-up meetings are held to discuss progress and any obstacles.
Scrum Master facilit...
I was interviewed in Nov 2020.
Round duration - 135 minutes
Round difficulty - Easy
Coding questions was easy if you know the basic of coding in any language. I submitted optimized solution for every questions that's why i got selected in this round.
You are given an encrypted string where repeated substrings are represented by the substring followed by its count. Your task is to find the K'th character of the d...
Given an encrypted string with repeated substrings represented by counts, find the K'th character of the decrypted string.
Parse the encrypted string to extract substrings and their counts
Iterate through the substrings and counts to build the decrypted string
Track the position in the decrypted string to find the K'th character
You are provided with an undirected graph containing 'N' vertices and 'M' edges. The vertices are numbered from 1 to 'N'. Your objective is to determi...
Detect if an undirected graph contains a cycle.
Use Depth First Search (DFS) to traverse the graph and detect cycles.
Maintain a visited array to keep track of visited vertices.
If a visited vertex is encountered again during DFS, a cycle exists.
Check for back edges while traversing the graph.
Consider disconnected graphs as well.
Round duration - 150 minutes
Round difficulty - Medium
You are provided with an array ARR
consisting of N
distinct integers in ascending order and an integer TARGET
. Your objective is to count all the distinct pairs in ARR
whose sum...
Count distinct pairs in an array whose sum equals a given target.
Use two pointers approach to iterate through the array and find pairs with sum equal to target.
Keep track of visited pairs to avoid counting duplicates.
Return -1 if no such pair exists with the given target.
You are given a palindrome number represented as a string S
. Your task is to find the largest palindrome number that is strictly less than S
.
T...
Given a palindrome number represented as a string, find the largest palindrome number that is strictly less than the given number.
Iterate from the middle towards the start and end of the string to find the next smaller palindrome.
If the number is odd in length, simply mirror the left half to the right half to get the next smaller palindrome.
If the number is even in length, decrement the middle digit and mirror the left...
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The problem involves finding the length of the longest common subsequence between two given strings.
Use dynamic programming to solve this problem efficiently.
Create a 2D array to store the lengths of common subsequences of substrings.
Iterate through the strings to fill the array and find the length of the longest common subsequence.
Example: For input STR1 = 'abcde' and STR2 = 'ace', the longest common subsequence is 'a
Round duration - 30 minutes
Round difficulty - Easy
Interview went well.The interviewer asked me how the previous interviews were.
Given a binary tree of integers, your task is to output the boundary nodes of this binary tree in Anti-Clockwise order, starting from the root node.
The b...
Output the boundary nodes of a binary tree in Anti-Clockwise order, starting from the root node.
Traverse the left boundary nodes in top-down order
Traverse the leaf nodes from left to right
Traverse the right boundary nodes in bottom-up order
Combine the above traversals to get the boundary nodes in Anti-Clockwise order
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.
Iterate through the array and swap elements based on the values encountered.
Maintain left pointer for 0s, right pointer for 2s, and current pointer for traversal.
Example: If current element is 0, swap it with element at left pointer and increment both pointers.
Round duration - 20 minutes
Round difficulty - Easy
This round is very easy, In this round they basically need confidence and truthful person.
Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's.
Tip 2 : Do lot of hard work and practice of Data Structures and Algorithms based questions
Tip 3 : See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers.
Tip 4 : I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Tip 1 : Always try to make it a single page
Tip 2 : do mention all your skills which you are confident of in your resume.
Tip 3 : Always make resume company specific
I was interviewed before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
This test consists of two coding questions and some MCQ regarding computer fundamentals.
Kevin has two packs of cards. The first pack contains N cards, and the second contains M cards. Each card has an integer written on it. Determine two results: the tot...
Find total distinct card types and common card types between two packs of cards.
Create a set to store distinct card types when combining both packs.
Iterate through each pack and add card types to the set.
Find the intersection of card types between the two packs to get common card types.
Given an array of integers arr
, where arr[i]
represents the number of pages in the i-th
book, and an integer m
representing the number of students, allocate all the books ...
Allocate books to students in a way that minimizes the maximum number of pages assigned to a student.
Iterate through all possible allocations of books to students.
Calculate the maximum number of pages assigned to a student for each allocation.
Return the minimum of these maximums as the result.
Round duration - 40 minutes
Round difficulty - Easy
It was a technical round that is based on DSA and computer fundamentals.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Tip 1 : If you are not able to complete something in-depth, clearly mention that to the interviewer.
Tip 2 : Practice DSA well.
Tip 3 : Try to think analytically and more logically,Your thinking skills matters a lot.
Tip 1 : Try to mention max no of projects
Tip 2 : DO not fake in your resume.
Challenging questions in mathematics.
A constructive discussion about the significance of various topics and additional aspects.
I applied via Job Fair and was interviewed in Nov 2023. There were 2 interview rounds.
Customer service is an essential element in software development.
Customer service involves providing support and assistance to users of software applications.
It includes addressing user queries, resolving issues, and ensuring customer satisfaction.
Software developers may interact with customers through various channels like email, phone, or live chat.
Good customer service can lead to positive user experiences and incre...
I applied via Campus Placement and was interviewed before Apr 2023. There were 2 interview rounds.
1 20 mark easy ques and 1 50 mark med ques, time : 1h 30 mins i guess
based on 1 interview
Interview experience
Senior Advisor
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Advisor
680
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
451
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
434
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
350
salaries
| ₹0 L/yr - ₹0 L/yr |
Marsh McLennan
Aon
Mercer
Gallagher