Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Deloitte interview experience Real time questions & tips from candidates to crack your interview

Product Engineering Intern

Deloitte
upvote
share-icon
2 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I started my interview preparation during the summer vacation at the end of the second year. By this time, I already knew C++ and the basics of DSA. I started preparing and participated in contests regularly.
Application story
I applied during the on-campus internship drive. We soon received a link for the online assessment. Top students were shortlisted for the interviews.
Why selected/rejected for the role?
- Clarity about skills mentioned in resume. - Good projects to talk about. - In-depth knowledge of core CS topics like OOPS, DBMS, etc.
Preparation
Duration: 10 months
Topics: Data Structures, OOPS, DBMS, Projects, OS
Tip
Tip

Tip 1 : Good grip on DSA
Tip 2 : Have good and unique projects
Tip 3 : Focus on CS fundamentals

Application process
Where: Campus
Eligibility: CGPA >= 6.0, No active backlogs
Resume Tip
Resume tip

Tip 1 : One page resume
Tip 2 : Highlights your skills. Don't lie on your resume.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration120 minutes
Interview date11 Mar 2023
Coding problem3

The timings of the round was from 4 pm to 6 pm. The coding round was held online on HackerRank. Online proctoring was done on the platform.

1. Find Minimum in Rotated Sorted Array

Moderate
10m average time
90% success
0/80
Asked in companies
AdobeOlaPaytm (One97 Communications Limited)

You are given an array 'arr' of size 'n' having unique elements that has been sorted in ascending order and rotated between 1 and 'n' times which is unknown.


The rotation involves shifting every element to the right, with the last element moving to the first position. For example, if 'arr' = [1, 2, 3, 4] was rotated one time, it would become [4, 1, 2, 3].


Your task is to find the minimum number in this array.


Note :
All the elements in the array are distinct. 


Example :
Input: arr = [3,4,5,1,2]

Output: 1

Explanation: The original array was [1,2,3,4,5] and it was rotated 3 times.


Problem approach

We can apply simple binary search on the array.

Try solving now

2. Maximum Depth Of A Binary Tree

Easy
15m average time
85% success
0/40
Asked in companies
FacebookTata Consultancy Services (TCS)Walmart

You are given the root node of a binary tree with N nodes, whose nodes have integer values. Your task is to find the maximum depth of the given Binary tree.

Depth of a binary tree is the same as its height. In simpler terms, you have to find the total number of nodes encountered while moving from the root node to the farthest leaf node, along the longest path of the binary tree.

Example:-

example

If we are given the above binary tree as input then moving from root node(5) to the farthest leaf node(50), the path formed will be [ 5->10->25->35->40->45->50 ]. The total number of nodes encountered is 7, therefore the maximum depth of the binary tree is 7.
Try solving now

3. Diameter Of Binary Tree

Easy
10m average time
90% success
0/40
Asked in companies
AdobeSnapdealPhone Pe

You are given a Binary Tree.


Return the length of the diameter of the tree.


Note :
The diameter of a binary tree is the length of the longest path between any two end nodes in a tree.

The number of edges between two nodes represents the length of the path between them.
Example :
Input: Consider the given binary tree:

Example

Output: 6

Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.


Problem approach

The question can be solved by DFS, and it is a small modification to the program of the height of the tree. The idea is quite simple: the maximum value of Height(leftSubtree) + Height(rightSubtree) (at any node) is the diameter. Keep track of the maximum diameter during traversal and find the height of the tree.

The line 'd=max(d, ld+rd);' maintains the maximum diameter.

Try solving now
02
Round
Easy
Face to Face
Duration25 minutes
Interview date14 Mar 2023
Coding problem2

The interview was scheduled at 1 pm. It was a face-to-face interview, and we were told that the duration would be around 15 minutes, but it actually went on for almost 25 minutes. There were 4 interviewers on the panel. All of them were very friendly, but they also tested the confidence of the interviewee by asking and cross-questioning even on correct answers.

The interview was based on project discussion and CS fundamentals.

1. Technical Questions

I was asked about my Java project. 

Why did I use Java for the project? 

What classes did I use in the projects? 

Draw the ER diagram of the projects.

Problem approach

Tip 1 : Know your projects in detail.
Tip 2 : Know why you used particular technology over others.
Tip 3 : Practice ER diagrams of your projects.

2. DBMS Questions

How did you store data in databases in your project? 

What are relational databases? (Learn)

How is SQL different from NoSQL? (Learn)

What is database schema? (Learn)

Problem approach

Tip 1: Have clarity about the basics.
Tip 2: Know your database of your projects.
Tip 3: If you don't know an answer, better to communicate it to the interviewer than to beat around the bush.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
Product Engineering Intern
2 rounds | 4 problems
Interviewed by Deloitte
962 views
0 comments
0 upvotes
company logo
Software Engineer
2 rounds | 2 problems
Interviewed by Deloitte
870 views
0 comments
0 upvotes
company logo
Product Intern
2 rounds | 4 problems
Interviewed by Deloitte
766 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Deloitte
877 views
0 comments
0 upvotes