Wipro interview experience Real time questions & tips from candidates to crack your interview
System Engineer
Wipro
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures, Algorithms, OOPS, DBMS, OS
Tip 1 : Lots of competitive programming
Tip 2 : Deal with real problems using any coding platform like LeetCode or CodeChef.
Tip 3 : Focus more in leaning and understanding the main concept behind the algorithm.
Application process
Where: Company Website
Eligibility: 7 CGPA, good in programming/DSA
Tip 1 : Add some working experiences like past job experience or internships and also add your impactful projects in your resume.
Tip 2 : Do not put false things and over skills in your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 Minutes
Interview date8 Feb 2022
Coding problem2
Timing-90 minutes is the Duration Of Assessment
Test is conducted virtually through Wipro platform. Test covers DSA, OOPS concept, DBMS, SQL, Programming and some general question related to Leadership Principles and workstyles.
1. Longest Substring Without Repeating Characters
Moderate
30m average time
65% success
0/80
Asked in companies
Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.
Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.
Problem approach
start loop in range length of string 's'.
if i th value is not in set 't' then add in set 't' otherwise case(means getting duplicate value)
if duplicate value then delete from starting of the set 't' using l variable until that duplicate value is deleted from the set 't'
at the same time just count the max length of set 't'
and return the max length of set 't'
class Solution:
def lengthOfLongestSubstring(self, s: str) -> int:
if not s: return 0
t=set()
l=0
res=0
for r in range(len(s)):
print(s[r],t)
if s[r] in t:
while s[r] in t:
print("remove",s[l])
t.remove(s[l])
l+=1
t.add(s[r])
print("2-",s[r],t)
res=max(res,r-l+1)
return res
2. Technical Questions
we need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.
For Example-
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.
02
Round
Medium
Face to Face
Duration60 Minutes
Interview date15 Feb 2022
Coding problem2
We need to solve 1 or 2(based on interviewer) coding question within 1 hour in which we need to explain our approach before writing the code and we need to give optimal solution of the approach.
Interviewer also ask some other question related to DBMS, SQL, OOPS concept and etc.
1. Spiral Order Traversal of a Binary Tree
Easy
20m average time
75% success
0/40
Asked in companies
You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.
For example
For the given binary tree [1, 2, 3, -1, -1, 4, 5, -1, -1, -1, -1]
1
/ \
2 3
/ \
4 5
Output: 1 3 2 4 5
Problem approach
Solution in Python:-
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def zigzagLevelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
if root is None:
return []
s1=[root]
s2=[]
level=[]
res=[]
while s1 != [] or s2 !=[]:
while s1:
root=s1.pop()
level.append(root.val)
if root.left is not None:
s2.append(root.left)
if root.right is not None:
s2.append(root.right)
res.append(level)
level=[]
while s2:
root=s2.pop()
level.append(root.val)
if root.right is not None:
s1.append(root.right)
if root.left is not None:
s1.append(root.left)
if level != []:
res.append(level)
level=[]
return res
2. Technical Questions
we need to answer questions related to DBMS, SQL, programming, OOPS concept, Leadership Principles, candidate behavior questions and workstyles.
For Example-
Write a query to find out second highest salary of an employee.
Difference between relational and non relational database?
What is the output of given program?
What is OPPS concept and its types?
Difference between function overloading and function overriding?
What is key in SQL queries and explain types of it?
Do you agree with your seniors whether that guy is correct or not.
Are you open to learn new technology or still want to work on those technologies on which you are familiar.
Problem approach
Tip 1 : Need to answer question as per your knowledge and experience.
Tip 2 : Revise your notes and main concepts
Tip 3 : practice lots of CP
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
Which keyword is used for inheritance?
Choose another skill to practice
Similar interview experiences
System Engineer
2 rounds | 4 problems
Interviewed by Wipro
Selected 
997 views
0 comments
0 upvotes
System Engineer
2 rounds | 4 problems
Interviewed by Wipro
Selected 1039 views
2 comments
0 upvotes
System Engineer
2 rounds | 3 problems
Interviewed by Wipro
Selected 1300 views
2 comments
0 upvotes
System Engineer
2 rounds | 3 problems
Interviewed by Wipro
Selected 1189 views
0 comments
0 upvotes
Companies with similar interview experiences
System Engineer
2 rounds | 2 problems
Interviewed by Cognizant
Selected 4474 views
5 comments
0 upvotes
System Engineer
3 rounds | 5 problems
Interviewed by Infosys
Selected 2751 views
0 comments
0 upvotes
System Engineer
3 rounds | 3 problems
Interviewed by Tata Consultancy Services (TCS)
Selected 2295 views
0 comments
0 upvotes