Wipro pvt interview experience Real time questions & tips from candidates to crack your interview

Project Engineer

Wipro pvt
upvote
share-icon
2 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: aptitude, data structures , OOPs algorithms , Pointers ,Dynamic Programming
Tip
Tip

Tip 1 : do coding everyday
Tip 2 : data structures are very important
Tip 3 : practice practically

Application process
Where: Campus
Eligibility: 6 CGPA
Resume Tip
Resume tip

Tip 1 : resume should not be too flashy
Tip 2 : your projects should be detailed
Tip 3 : Do not put false things on resume

Interview rounds

01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date20 Oct 2021
Coding problem2

3 sections were there
1. English Section
2. Aptitude section
3. Coding section

1. Valid Parentheses

Easy
10m average time
80% success
0/40
Asked in companies
AmazonIntuitOracle

You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .


Return true if the given string 'S' is balanced, else return false.


For example:
'S' = "{}()".

There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
Problem approach

Declare a character stack S.
Now traverse the expression string exp. 
If the current character is a starting bracket (‘(‘ or ‘{‘ or ‘[‘) then push it to stack.
If the current character is a closing bracket (‘)’ or ‘}’ or ‘]’) then pop from stack and if the popped character is the matching starting bracket then fine else brackets are not balanced.
After complete traversal, if there is some starting bracket left in stack then “not balanced”

Try solving now

2. Encode The String

Easy
10m average time
80% success
0/40
Asked in companies
Goldman SachsDeloitteMahindra Comviva

You are given a string ‘S’ of length ‘N’. The string can be encoded using the following rules:

1) If the ‘i-th’ character is a vowel, change it to the next character in the alphabetical sequence. For example, the next character of ‘o’ is ‘p’.

2) If the ‘i-th’ character is a consonant, change it to the previous character in the alphabetical sequence. For example, the previous character of ‘h’ is ‘g’.

3) The next character of ‘z’ is ‘a’.

4) The previous character of ‘a’ is ‘z’.

Find the encoded string.

Example :
‘N’ = 4, ‘S’ = “code”

Character ‘c’ gets changed to ‘b’.
Character ‘o’ gets changed to ‘p’.
Character ‘d’ gets changed to ‘c’.
Character ‘e’ gets changed to ‘f’.

Encoded string = “bpcf”
Problem approach

a) Pick the first character from the source string.
b) Append the picked character to the destination string.
c) Count the number of subsequent occurrences of the picked character and append the count to the destination string.
d) Pick the next character and repeat steps b) c) and d) if the end of the string is NOT reached.

Try solving now
02
Round
Easy
HR Round
Duration20 minutes
Interview date25 Oct 2021
Coding problem1

Basic HR questions like What are your Hobbies And what are your Future plans . Also there was a Managerial round

1. Basic HR questions

Tell us about yourself and your projects?

Where do you see yourself in next 5 years?

How do you rate your coding skills?

Are you wishing to relocate?

As you know there is a bond. How do you see this. Will You accept this?

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
990 views
0 comments
0 upvotes
Project Engineer
3 rounds | 4 problems
Interviewed by Wipro pvt
1139 views
0 comments
0 upvotes
Project Engineer
3 rounds | 4 problems
Interviewed by Wipro pvt
1383 views
0 comments
0 upvotes
Project Engineer
3 rounds | 4 problems
Interviewed by Wipro pvt
1202 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
Project Engineer
2 rounds | 4 problems
Interviewed by Amdocs
1256 views
0 comments
0 upvotes