Willis Towers Watson Full Stack Developer Interview Questions and Answers

Round duration - 90 minutes
Round difficulty - Medium

This test consists of two coding questions and some MCQ regarding computer fundamentals.

Q1. 
Kevin and His Cards Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Allocate Books Problem Statement
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 ...read more
Ans. 
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.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

It was a technical round that is based on DSA and computer fundamentals.

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
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).
Answered by AI
Add your answer

Q1. Tell me difference between treemap and hashmap
Ans. 
HashMap is an unordered collection while TreeMap is a sorted collection based on keys.
• HashMap uses hashing to store key-value pairs, while TreeMap uses a red-black tree for sorting keys.

• HashMap allows one null key and multiple null values, while TreeMap does not allow null keys but allows null values.

• HashMap is generally faster for lookups and insertions, while TreeMap is useful when you need to iterate over keys in so
Answered by AI
Add your answer

Q1. Sort array without using sorting logic
Ans. 
Use custom logic to rearrange array elements without traditional sorting algorithms
• Create a custom logic to rearrange the array elements based on specific criteria

• Use loops and conditional statements to compare and swap elements

• Consider using techniques like bubble sort or insertion sort without directly implementing them
Answered by AI
Add your answer

Q1. What are salary expectations
Ans. 
Salary expectations will depend on factors such as experience, location, and company size.
• Consider factors like experience, location, and company size when determining salary expectations

• Research average salaries for Software Developers in your area

• Be prepared to negotiate based on your skills and qualifications
Answered by AI
Add your answer

GENERAL QUESTIONS WERE ASKED

Q1. SELF INTRO, ABOUT PROJECTS
Add your answer

Q1. JWT Authorization
Add your answer
Q2. Hasp Map internal
Add your answer

Q1. Palindorme program full logic
Add your answer
Q2. Anagram program full logic
Add your answer

Q1. Join, groupby questions in pyspark
Add your answer