Wolters Kluwer interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Wolters Kluwer

2 rounds | 3 Coding problems

Prachi Nagpure

Fresher | Jan 2021

Selected

Interview preparation journey

Preparation

Duration: 6 months

Topics: Java, Data Structure, OPPS, SQL, SDLC, Networking, Testing

Tip

Tip 1 : Read well the job profile, company background and skill requirements and prepare accordingly.
Tip 2 : Whatever topic you are preparing don't just study to finish the topic but study to understand it because interviewers often deep dive and ask questions, make sure you basics are getting cleared.
Tip 3 : Solve Aptitude questions, coding problems as much as possible.

Application process

Where: Campus

Eligibility: Above 65% in 10th,12th, degree

Resume tip

Tip 1 : Write optimal yet powerful summary.
Tip 2 : Highlight your education,internships, projects, certifications.
Tip 3 : Do mention technologies in which you worked on in your internship, projects.
Tip 4 : If you don't have any internship/project(any one will work fine but both are big plus) done go and get some work done and make your hands dirty and then put it in your resume.
Tip 6 : Avoid writing long statements.
Tip 7 : Honesty is the best policy.

Interview rounds

Round

Medium

Online Coding Test

Duration60 minutes

Interview date20 Jan 2021

Coding problem2

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.

1. Deletion in Circular Linked List

Easy

30m average time

0/40

Asked in companies

You are given a Circular Linked List of integers, and an integer, 'key'.

You have to write a function that finds the given key in the list and deletes it. If no such key is present, then the list remains unchanged.

For Example :

This is a visualization of the Circular Linked List, represented by:
1 2 3 4 5 -1

Note :

The Circular Linked List before/after deletion may happen to be empty. In that case, only print -1.

All integers in the list are unique.

Try solving now

2. Move All Negative Numbers To Beginning And Positive To End

Easy

10m average time

90% success

0/40

Asked in companies

You are given an array 'ARR' consisting of 'N' integers. You need to rearrange the array elements such that all negative numbers appear before all positive numbers.

Note:

The order of elements in the resulting array is not important.

Example:

Let the array be [1, 2, -3, 4, -4, -5]. On rearranging the array such that all negative numbers appear before all positive numbers we get the resulting array [-3, -5, -4, 2, 4, 1].

Try solving now

Round

Medium

Video Call

Duration30-35 minutes

Interview date28 Jan 2021

Coding problem1

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

1. Basic Interview Questions

They given me 2 table containing names of different cities and told me to apply left join on them.

1) Asked me about the Languages known.
2) OOPS concepts.
3) SQL concepts(joins, acid properties, sets etc) .
4) SQL queries(left join, conditional).
5) Testing fundamentals (white box, black box)
6) SDLC