i
Willis Towers Watson
Filter interviews by
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
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 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.
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
Challenging questions in mathematics.
A constructive discussion about the significance of various topics and additional aspects.
I was interviewed in Jan 2021.
Round duration - 90 Minutes
Round difficulty - Medium
This round happened on the same day as JAM in the afternoon time. A slot of 20 minutes with respective timing was already sent to the selected students. Interview can’t be generalize as anything can happen over there and hence this was exclusively my experience.
To have a quick judgement about the person, I believe nothing is better than throwing before him/her some puzzles (mathematical/ analytical/ programming problems) and see the approach. I received back-to-back 4 problems after a quick and brief introduction. The coding problems I got were way too easy (just basics: searching & mathematical). The harder part of this round was the puzzles (tricky, mathematical, related to probability). At last, I was asked a question on DBMS and the interviewer asked if I know JAVA.
Given a sorted array 'A' of 'N' integers, determine whether a number 'X' exists within this array for a series of queries. For each query, print 1 if 'X' exists in the ...
Search for a number in a sorted array and determine its existence for multiple queries.
Use binary search algorithm to efficiently search for each query integer in the sorted array.
For each query integer 'X', check if it exists in the array 'A' and output 1 if found, 0 otherwise.
Ensure the array 'A' is sorted in non-decreasing order to apply binary search effectively.
Tip 1 : Mention some good projects on your resume.
Tip 2 : Practice competitive and aptitude questions.
Tip 3 : Work on your communication skills.
Tip 1 : Mention some good projects on your resume.
Tip 2 : Don't put false things on your resume.
based on 1 interview
Interview experience
Senior Advisor
1.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Advisor
677
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
451
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
441
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Analyst
361
salaries
| ₹0 L/yr - ₹0 L/yr |
Marsh McLennan
Aon
Mercer
Gallagher