Wipro pvt interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Wipro pvt
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Mention some good projects on resume
Tip 2 : Be confident
Tip 3 : Good with computer science basics and ds and algo
Application process
Where: Campus
Eligibility: Above 6 CGPA
Tip 1 : Good Projects
Tip 2 : Having some achievements is plus point
Interview rounds
01
Round
Easy
Video Call
Duration45 mins
Interview date13 May 2022
Coding problem2
1. Balanced parentheses
Moderate
10m average time
90% success
0/80
Asked in companies
Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.
Note :
Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
For Example :
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Problem approach
Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.
Note :
Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
For Example :
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
2. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
Ninjas is practicing problems on the linked list. He came across a problem in which he has given a linked list of ‘N’ nodes and two integers, ‘LOW’ and ‘HIGH’. He has to return the linked list ‘HEAD’ after reversing the nodes between ‘LOW’ and ‘HIGH’, including the nodes at positions ‘LOW’ and ‘HIGH’.
Input Format :
The first line of input contains an integer ‘T’, the number of test cases.
The first line of each test case contains the linked list separated by space and terminated by -1.
The second line of each test case contains two space-separated integers, representing the ‘LOW’ and ‘HIGH’ integers, respectively.
02
Round
Easy
HR Round
Duration30 mins
Interview date13 May 2022
Coding problem1
1. Basic HR Questions
Introduce yourself
What are your strength?
What are your tech expertise?
What are your strength and weakness?
Why do you want to join RTDS?
Explain the working of your project
Problem approach
Tip 1 : Good projects
Tip 2 : Knowledge about basic questions
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
SDE - 1
2 rounds | 5 problems
Interviewed by Wipro pvt
Rejected
1196 views
0 comments
0 upvotes
SDE - 1
3 rounds | 12 problems
Interviewed by Wipro pvt
Selected 0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 7 problems
Interviewed by Wipro pvt
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Wipro pvt
Selected 1073 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes