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
Journey
Started as a curious student who knew very little about computer science. But after having some hands on CS subjects a genuine interest developed. Later, the campus placements helped me get a good job at various companies. Generally, leaning basics on every topic helped me crack job interviews.
Application story
Wipro came in as Campus placement and people who were eligible were able to apply through the college portal.
Why selected/rejected for the role?
I was selected because my interview went really well and interviewer was pleased with knowledge i possesed.
Preparation
Duration: 6 months
Topics: OOPS, Computer Networks, DBMS, Dynamic Programming, Operating Systems
Tip
Tip

Tip 1 : Practice basic coding questions initially
Tip 2 : Later, move to advance topics
Tip 3 : Interview is easy part, qualifying for interviews is tough job

Application process
Where: Campus
Eligibility: Above 7 cgpa
Resume Tip
Resume tip

Tip 1 : Add skills which you are confident about
Tip 2 : Need not to put more than 2 projects in resume.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration128 minutes
Interview date4 Nov 2020
Coding problem2

1. Conceptual Questions

What is computer networks?
Some logical puzzles

Problem approach

Tip 1:Learn basics of Computer Networks
Tip 2:Learn Logical reasoning, English, quants, Maths
Tip 3:Also have theoretical of programing languages

2. Cycle Detection In Undirected Graph

Moderate
0/80
Asked in companies
AmazonAdobeSamsung

You have been given an undirected graph with 'N' vertices and 'M' edges. The vertices are labelled from 1 to 'N'.

Your task is to find if the graph contains a cycle or not.

A path that starts from a given vertex and ends at the same vertex traversing the edges only once is called a cycle.

Example :

In the below graph, there exists a cycle between vertex 1, 2 and 3. 

Example

Note:

1. There are no parallel edges between two vertices.

2. There are no self-loops(an edge connecting the vertex to itself) in the graph.

3. The graph can be disconnected.

For Example :

Input: N = 3 , Edges =  [[1, 2], [2, 3], [1, 3]].
Output: Yes

Explanation : There are a total of 3 vertices in the graph. There is an edge between vertex 1 and 2, vertex 2 and 3 and vertex 1 and 3. So, there exists a cycle in the graph. 
Try solving now
02
Round
Easy
Video Call
Duration30 minutes
Interview date17 Apr 2023
Coding problem1

Basic questions, mainly theoretical knowledge about C, C++, Java, Python, DBMS was asked.

1. DBMS Questions

What is difference between Database and DBMS?\

What are joins?

Problem approach

Tip 1:Have knowledge about DBMS
Tip 2:Have theoretical knowledge about all major programming language according to your resume
Tip 3:Be prepared about some HR questions as both technical as well as HR rounds were conducted in one round.

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