PwC India interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
PwC India
2 rounds | 3 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 1.5 months
Topics: one programming language to be very strongdata structure and algorithmsoperating systemdbmsoops
Tip 1 : you should have very strong one programming language
Tip 2 : you should have good knowledge of your academic project
Application process
Where: Company Website
Eligibility: 6.5 cgpa throughout
Tip 1 : it should be of one page
Tip 2 : Highlights your technical skills which you are confident
Interview rounds
01
Round
Hard
Video Call
Duration60 Minutes
Interview date1 Jun 2022
Coding problem2
It is purely a Data Structure Round. Interview asked as much array problems and complexity problems
Secondly you should have great knowledge of your projects which you have mentioned in your Resume.
1. Reverse the array
Easy
0/40
Asked in companies
Given an array with N elements, the task is to reverse all the array elements and print the reversed array.
Problem approach
Tip 1:First line contains an integer denoting the test cases 'T'. T testcases follow. .
Tip 2:Each testcase contains two lines of input. First line contains N the size of the array A.
Tip 3: The second line contains the elements of the array
2. Sort Array
Moderate
15m average time
85% success
0/80
Asked in companies
You are given an array consisting of 'N' positive integers where each integer is either 0 or 1 or 2. Your task is to sort the given array in non-decreasing order.
Note :
1. The array consists of only 3 distinct integers 0, 1, 2.
2. The array is non-empty.
Problem approach
Tip 1:You don't need to read input or print anything.
Tip 2:Your task is to complete the function sortArr() which takes the list of integers and the size N as inputs and returns the modified list.
02
Round
Hard
Video Call
Duration60 Minutes
Interview date6 Jun 2022
Coding problem1
This is 2nd Technical Round + HR round and Interview asked again DSA questions
1. Distance between two nodes of a Tree
Moderate
25m average time
60% success
0/80
Asked in companies
Given a binary tree and the value of two nodes, find the distance between the given two nodes of the Binary Tree.
Distance between two nodes is defined as the minimum number of edges in the path from one node to another.
Problem approach
Tip 1:You don't need to read input or print anything.
Tip 2: Your task is to complete the function findDist() which takes the root node of the Tree and the two node values a and b as input parameters and returns the minimum distance between the nodes represented by the two given node values.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
Technology Consultant - Associate
5 rounds | 12 problems
Interviewed by PwC India
Selected 
2345 views
0 comments
0 upvotes
Data Analytics
3 rounds | 1 problems
Interviewed by PwC India
Selected 1383 views
0 comments
0 upvotes
Technical Consultant
3 rounds | 2 problems
Interviewed by PwC India
Selected 1121 views
0 comments
0 upvotes
TC-Intern
2 rounds | 4 problems
Interviewed by PwC India
Selected 0 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6261 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2159 views
0 comments
0 upvotes