PwC India interview experience Real time questions & tips from candidates to crack your interview

Cloud Support Associate

PwC India
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
My journey started with building a strong foundation in core concepts and gradually applying them through real-world projects. Initially, I focused more on technical skills, but during interviews, I realized that communication plays a crucial role in expressing knowledge effectively. After facing a few rejections, I took it as a learning opportunity and worked on improving both my technical depth and communication skills through consistent practice and mock interviews. Over time, I became more confident in explaining my approach and problem-solving methods. This improvement, along with persistence and continuous learning, helped me perform better in interviews and eventually crack an opportunity. The journey taught me that growth comes from identifying weaknesses and working on them consistently.
Application story
I applied for the Associate role at PwC (Cloud & Digital) through the official Workday registration link shared by my college. After registering, I attended the pre-placement connect session where the company explained the role, expectations, and overall hiring process. The selection process started with an online assessment, followed by technical interview rounds conducted over a few days. After clearing the technical round, I attended the HR discussion. The entire process was smooth and well-structured, with clear communication at each stage. The opportunity to go through multiple stages helped me understand both technical and professional expectations of the role.
Why selected/rejected for the role?
I identified communication as an area of improvement and have since been actively working on it through regular practice and feedback.
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, Algorithms
Tip
Tip

Tip 1: Strengthen core concepts of Data Structures (arrays, strings, basic recursion, sorting, searching) and practice at least 100–150 questions.
Tip 2: Have strong understanding of OOP concepts (encapsulation, inheritance, polymorphism) and be ready to explain them with real examples.
Tip 3: Build at least 1–2 simple projects and practice explaining your logic clearly, as communication matters as much as technical skills.

Application process
Where: Campus
Eligibility: 60%+ throughout academics & No active backlog, (Salary Package: 6 LPA)
Resume Tip
Resume tip

Tip 1: Keep your resume clear and focused with relevant projects and technologies rather than adding too many unnecessary details.
Tip 2: Be honest about your skills and ensure you can confidently explain everything mentioned in your resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date27 Jan 2023
Coding problem1

The assessment was conducted in the evening from 5:00 PM to 6:00 PM. The overall environment was smooth and well-managed, and the platform worked without any major issues. Since it was an online test, it required a stable internet connection and a quiet environment.
The test was divided into four sections: Aptitude, Verbal Ability, Conceptual Computer Science, and Programming Skills. Each section had a strict time limit, so time management was very important. The questions were moderate in difficulty and required a clear understanding of basic concepts. There was no interviewer interaction during this round as it was an automated online assessment.

1. Maximum Subarray Sum

Moderate
35m average time
81% success
0/80
Asked in companies
AppleSAP LabsQualcomm

You are given an array 'arr' of length 'n', consisting of integers.


A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning and 0 or more integers from the end of an array.


Find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.


The sum of an empty subarray is 0.


Example :
Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]

Output: 11

Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Problem approach

Step 1: I first understood the problem and thought of a brute-force approach where I would check all possible subarrays and calculate their sums. However, I realized this would take O(n²) time, which is not efficient.
Step 2: Then I recalled an optimized approach using Kadane’s Algorithm, which works in linear time. The idea is to keep track of the current subarray sum and reset it whenever it becomes negative.
Step 3: I initialized two variables – currentSum and maxSum. I iterated through the array, adding each element to currentSum.
Step 4: If currentSum became greater than maxSum, I updated maxSum. If currentSum dropped below zero, I reset it to zero because a negative sum would not help in maximizing the result.
Step 5: After completing the iteration, maxSum contained the maximum subarray sum, which I returned as the final answer.

Try solving now
02
Round
Medium
Face to Face
Duration30 minutes
Interview date30 Jan 2023
Coding problem2

The interview round was conducted during the daytime in a virtual mode. The environment was smooth and professional, and the interviewer was friendly and supportive throughout the discussion.
The interviewer focused mainly on core Computer Science concepts, especially Object-Oriented Programming. Questions were asked on concepts like inheritance, polymorphism. The interviewer also checked my understanding by asking me to explain these concepts with examples.
Apart from theoretical questions, I was also given a coding problem to test my problem-solving skills. The interviewer guided me during the discussion and was interested in understanding my approach rather than just the final answer. Overall, it was an interactive and knowledge-based interview experience.

1. Merge Two Sorted Arrays

Moderate
15m average time
85% success
0/80
Asked in companies
HikeAmazonFreshworks

Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may have to assume that ‘ARR1’ has a size equal to ‘M’ + ‘N’ such that ‘ARR1’ has enough space to add all the elements of ‘ARR2’ in ‘ARR1’.

For example:

‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’. 
‘ARR1’ = [3 4 6 9 10]
Problem approach

Step 1: I first understood the problem and initially thought of a simple approach where I could combine both arrays into one and then sort the final array. However, I realized this would increase the time complexity to O((n+m) log(n+m)).
Step 2: Then I moved to an optimized approach using the two-pointer technique since both arrays were already sorted.
Step 3: I initialized two pointers, one for each array, starting from index 0. I compared the elements at both pointers.
Step 4: I added the smaller element to the result array and moved the corresponding pointer forward. This ensured the merged array remained sorted.
Step 5: I continued this process until one of the arrays was completely traversed.
Step 6: Finally, I added the remaining elements from the other array to the result array.
Step 7: This approach reduced the time complexity to O(n + m), and the interviewer was satisfied with the optimized solution.

Try solving now

2. OOPS

Explain access modifiers in C++. (Learn)

03
Round
Medium
HR Round
Duration15 minutes
Interview date2 Feb 2023
Coding problem1

This round was an HR interview conducted in a virtual mode. The timing was during the daytime, and the overall environment was comfortable and professional. The interviewer was friendly and made the conversation easy to follow.
The discussion mainly focused on my background, especially my college projects. I was asked to explain my project, my role in it, and the technologies I used. The interviewer was interested in understanding my involvement and how well I could explain my work.
Additionally, I was asked general HR questions to understand my career goals and aspirations. The round was more about evaluating communication skills, confidence, and clarity of thought rather than technical depth.

1. HR Questions

  • Explain your college project in detail, including your role, technologies used, and challenges faced.
  • Where do you see yourself in the next 5 years?
Problem approach

Tip 1: I explained my college project in a structured way by covering the problem statement, my contribution, the technologies used, and the outcome. I focused on being clear and confident while explaining.
Tip 2: For the 5-year goal question, I gave a realistic and growth-oriented answer, aligning my personal goals with the company’s growth. I avoided overstatements and kept my answer practical.
Tip 3: Overall, I ensured that my communication was clear, concise, and confident, as HR rounds mainly evaluate personality and attitude.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which data structure is used to implement a DFS?

Choose another skill to practice
Similar interview experiences
company logo
Technology Consultant - Associate
5 rounds | 12 problems
Interviewed by PwC India
2411 views
0 comments
0 upvotes
company logo
Data Analytics
3 rounds | 1 problems
Interviewed by PwC India
1448 views
0 comments
0 upvotes
company logo
TC-Intern
2 rounds | 4 problems
Interviewed by PwC India
0 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by PwC India
1197 views
0 comments
0 upvotes