Wolters Kluwer Software Developer Intern Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

Round 1  was a coding round of 60 min which started around 5:30PM in which 2 problem statements were given. The questions were based on Array and linked list. The platform used for test was coding which was user friendly and which use to display number of test cases passed and some test cases were hidden.

Q1. 
Problem: Deletion in Circular Linked List
You are provided with a Circular Linked List of integers and a specific integer, referred to as 'key'.
Your task is to implement a function that locates the spec...read more
Ans. 
Implement a function to delete a specific key from a Circular Linked List of integers.
• Traverse the Circular Linked List to find the key to be deleted.

• Update the pointers of the previous and next nodes to skip the node with the key.

• Handle the case where the Circular Linked List becomes empty after deletion.

• Return -1 if the Circular Linked List is empty after deletion.
Answered by AI
Add your answer
Q2. 
Rearrange Array: Move Negative Numbers to the Beginning
Given an array ARR consisting of N integers, rearrange the elements such that all negative numbers are located before all positive numbers. The orde...read more
Ans. 
Yes, this can be achieved by using a two-pointer approach to rearrange the array in-place.
• Use two pointers, one starting from the beginning and one from the end of the array.

• Swap elements at the two pointers if they are not in the correct order (negative before positive).

• Continue this process until the two pointers meet in the middle of the array.
Answered by AI
Add your answer

Round duration - 30-35 minutes
Round difficulty - Medium

This round was of technical interview and they asked me various concepts