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: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Practice Atleast 250 Questions
Tip 3 : Take time to study DSA

Application process
Where: Campus
Eligibility: no backlog
Resume Tip
Resume tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration120 minutes
Interview date4 Nov 2021
Coding problem2

English 15 Questions MCQs
Aptitude 15 Questions MCQs

2 coding problem

1. k-th node from the end of the linked list

Easy
15m average time
85% success
0/40
Asked in companies
MathworksSAP LabsDream11

Given the head node of the singly linked list and an integer ‘k’, , find the value at the kth node from the end of the linked list.

For example:

Linked List

For the above-linked list, if k=2, then the value at the kth i.e second node from the end is ‘12’.
Note :
1.You don’t need to take any input. It has already been taken care of. Just implement the given function and return a pointer pointing to the k-th element from the last of the linked list.
2.It is guaranteed that k<=size of the linked list.
Problem approach

1) Calculate the length of Linked List. Let the length be len.
2) Print the (len – n + 1)th node from the beginning of the Linked List.

Try solving now

2. Armstrong Number

Easy
15m average time
85% success
0/40
Asked in companies
OracleIBMOptum

You are given an integer ‘NUM’ . Your task is to find out whether this number is an Armstrong number or not.

A k-digit number ‘NUM’ is an Armstrong number if and only if the k-th power of each digit sums to ‘NUM’.

Example
153 = 1^3 + 5^3 + 3^3.

Therefore 153 is an Armstrong number.
Problem approach

The approach implemented below is simple. We traverse through all numbers in given range. For every number, we first count number of digits in it. Let the number of digits in current number be n. Them we find sum of n-th power of all digits. If sum is equal to i, we print the number

Try solving now
02
Round
Easy
HR Round
Duration20 minutes
Interview date8 Nov 2021
Coding problem1

1. Basic HR questions

Tell us about yourself and your projects.

will you accept bond of our company.

Where do you see yourself in next 5 years

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
1382 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