PwC Interview Questions, Process, and Tips for Freshers

Round duration - 60 Minutes
Round difficulty - Medium

Group Discussion 

Round duration - 70 Minutes
Round difficulty - Hard

Data Structures, DBMS, and SQL questions were asked in this round.

Q1. Merge Sort
Given a sequence of numbers ‘ARR’. Your task is to return a sorted sequence of ‘ARR’ in non-descending order with help of the merge sort algorithm.
Example :
Merge Sort Algorithm -

Merge sor...read more
Ans. Recursion
The basic idea is that we divide the given ‘ARR’ into two-part call them ‘leftHalves’ and ‘rightHalves’ and call the same function again with both the parts. In the end, we will get sorted ‘leftHaves’ and sorted ‘righthalves’ which we merge both of them and return a merged sorted ‘ARR’.
We implement this approach with a divide and conquer strategy.
 
Here is the algorithm : 
 
1. Divide ‘ARR’ into two-p...read more
Answered Anonymously
Add your answer
Q2. Bubble Sort
Bubble Sort is one of the sorting algorithms that works by repeatedly swapping the adjacent elements of the array if they are not in sorted order.
You are given an unsorted array consisting o...read more
Ans. Implementation
Bubble sort is a standard sorting algorithm that uses nested loops to check all adjacent elements in an array and swap them if they are not in the right order of sorting. 
 
Steps :
• Use a flag variable to keep track, if the array is already sorted or not.
• Use a loop to iterate over all the elements of the array.
• Use a nested loop to check if the adjacent elements are in the correct order or not.
• If no...read more
Answered Anonymously
Add your answer
Q3. Selection Sort
Selection sort is one of the sorting algorithms that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning of the unsorted regio...read more
Ans. Selection Sort Approach
Selection sort is a standard sorting algorithm that uses nested loops to find all the minimum elements in the array in each iteration and swap them with the starting element of the unsorted region of the array.
 
Steps :
• Use a minValue variable to find the index of the minimum element of the array.
• Use a loop to iterate over all the elements of the array.
• Use a nested loop to find the minimum ele...read more
Answered Anonymously
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

The Director of PwC took this Interview, It was a 30 mins Round conducted on the same Glider Platform.

Round duration - 15 Minutes
Round difficulty - Easy

It was just a 15 Mins Round in which I was asked a few HR questions.

Q1. 1) Tell me about yourself 2) Audit opinins, audit risks, Ind AS 1115, 116, 16. 3) case study on purcahse and sales
Add your answer