Wipro pvt interview experience Real time questions & tips from candidates to crack your interview
SDE
Wipro pvt
2 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Start with the basics if you have lost touch with competitive coding. Don't directly jump to interview questions.
Tip 2 : Create a timetable and set goals. Keep aside 3-4 hours for studying. Consistency is the key.
Tip 3 : Focus on medium and hard questions. Solving a lot of easy questions doesn't help.
Application process
Where: Company Website
Eligibility: Above 6 CGPA
Tip 1 : Link to your projects.
Tip 2 : Open source contribution.
Tip 3 : Clear Tech-stack.
Tip 4 : Link to your different profiles.
Tip 5 : Don't mess up things by writing things you don't know.
Tip 6 : Different Resumes for different job profiles.
Tip 7 : Keep it simple.
Interview rounds
01
Round
Easy
Video Call
Duration45 minutes
Interview date21 Dec 2021
Coding problem2
1. Find prime numbers
Easy
15m average time
80% success
0/40
Asked in companies
You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.
Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.
You can assume that the value of N will always be greater than 1. So, the answer will always exist.
Problem approach
I used the Sieve of Eratosthenes. Created a sieve array whose size was equal to the maximum number in the array given. Then filled the sieve using the algorithm.
2. Subarray With Given Sum
Moderate
15m average time
85% success
0/80
Asked in companies
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.
Note:
If two or more such subarrays exist, return any subarray.
For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].
Problem approach
I wrote a simple O(n) solution
02
Round
Easy
HR Round
Duration30 minutes
Interview date21 Dec 2021
Coding problem3
1. Basic HR Question
Why do you want this post and how would you be an asset to the team?
Problem approach
Told him how interested I am in this field and this company. Also told him how passionate.
2. Basic HR Question
What are improvements that can be done to this project and how?
Problem approach
Suggested some improvement on my projects.
3. Which tech-stack did you use and why?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Project Engineer
2 rounds | 6 problems
Interviewed by Wipro pvt
Selected 
990 views
0 comments
0 upvotes
Project Engineer
3 rounds | 4 problems
Interviewed by Wipro pvt
Selected 1383 views
0 comments
0 upvotes
Project Engineer
3 rounds | 4 problems
Interviewed by Wipro pvt
Selected 1202 views
1 comments
0 upvotes
SDE
1 rounds | 5 problems
Interviewed by Wipro pvt
Selected 1662 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE
3 rounds | 6 problems
Interviewed by PhonePe
Selected 0 views
0 comments
0 upvotes
SDE
5 rounds | 8 problems
Interviewed by Mathworks
Selected 1224 views
0 comments
0 upvotes
SDE
4 rounds | 7 problems
Interviewed by PhonePe
Selected 0 views
0 comments
0 upvotes