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

Software Analyst

Deloitte
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 Month
Topics: Data Structures and Algorithm, Java Basics, OOPs Design, Spring Framework, Angular
Tip
Tip

Tip 1 : Do questions from Leetcode
Tip 2 : Revise basics of any Programming Language
Tip 3 : Go through low level System Design or OOP Design

Application process
Where: Referral
Eligibility: No criteria
Resume Tip
Resume tip

Tip 1 : Mention your Projects
Tip 2 : Keep your Resume short and simple

Interview rounds

01
Round
Easy
Face to Face
Duration75 Minutes
Interview date30 Dec 2021
Coding problem3

The Interviewer started with Basics Java, Then he moved to some questions of Data Structures, asked question aboyt System Design, and finally from Backend and Frontend Technologies like Spring and Angular.

1. Java Question

Problem regarding Type Casting

Problem approach

Tip 1 : go through basics of any Programming Language

2. OOPS Design Question

Given a scenario, I had to design classes and methods by following OOPs Design Pattern

Problem approach

Tip 1 : Go through OOPs Design

3. Technical Questions

Questions on REST APIs, MVC Architecture, Severs etc
Questions on Components and Services from Angular

Problem approach

Tip 1 : Go through the above Technologies

02
Round
Easy
Face to Face
Duration60 Minutes
Interview date31 Dec 2021
Coding problem1

Problem asked from Data Structures, Projects mentioned on Resume and random questions from Resume

1. Reverse Linked List

Moderate
15m average time
85% success
0/80
Asked in companies
WalmartHCL TechnologiesInfo Edge India (Naukri.com)

Given a singly linked list of integers. Your task is to return the head of the reversed linked list.

For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach

Take a dummy node with null value, pointing to head of the LinkedList.
Take a next node pointing to head's next
Reverse the connection of head and dummy node and move all the three nodes

Try solving now

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
company logo
Consulting Engineer
2 rounds | 2 problems
Interviewed by Deloitte
2957 views
0 comments
0 upvotes
company logo
Associate Consultant
2 rounds | 2 problems
Interviewed by Deloitte
2150 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 6 problems
Interviewed by Deloitte
2457 views
0 comments
0 upvotes
company logo
Salesforce Developer
3 rounds | 3 problems
Interviewed by Deloitte
0 views
0 comments
0 upvotes