HashedIn by Deloitte Software Developer Intern Interview Questions, Process, and Tips

3 coding questions, very basic

• Q1. Again DSA and DBMS questions, easy to medium easy
  Add Answer

• Q1. There are three technical rounds one round will be tough
  Add Answer

• Q1. They didn't ask me anything
  Add Answer
• Q2. Will give U false promises and showoff about the company
  Add Answer

Round duration - 30 Minutes
Round difficulty - Easy

Timing of test start from 11 AM and everything goes well here .

• Q1. OS Question

  What is segmentation

  Add Answer
• Q2. DBMS Question

  How many level of Normalization are there ?

  Add Answer

Round duration - 60 Minutes
Round difficulty - Easy

It happen nicely and no problem occur.

• Q1. Trapping Rain Water You have been given a long type array/list 'ARR' of size 'N'. It represents an elevation map wherein 'ARR[i]' denote...read more
  View Answers (3)
• Q2. Sort 0 1 2 You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list. Note : ...read more
  View Answers (3)

Round duration - 90 mintues
Round difficulty - Hard

Environment is very bad the intervier video call is lagging.

• Q1. Compiler Design Question

  . List The Sub Parts Or Phases Of Analysis Part

  Add Answer
• Q2. Left Rotations of An Array You are given an array consisting of 'N' elements and you need to perform 'Q' queries on the given array. Each query ...read more
  View Answers (4)

Round duration - 90 minutes
Round difficulty - Hard

Timing was 10 AM. Platform was very lagging. So overall it was not a good experience.

• Q1. Topological Sort You are given a directed acyclic graph. Your task is to find any topological sorting of the graph. A directed acyclic graph is a directed graph...read more
  View Answers (1)

Round duration - 90 Minutes
Round difficulty - Easy

This round contains only 1 coding question which you have to solve in the language selected by you at the time of registration.
(Note: One can have to attempt the question in C language is he/she had selected C++ language at the time of registration).

• Q1. Topological Sort A Directed Acyclic Graph (DAG) is a directed graph that contains no cycles. Topological Sorting of DAG is a linear ordering of vertices such th...read more
  View Answers (2)

Round duration - 60 Minutes
Round difficulty - Easy

This is a technical interview which was held on google meet. The interviewer helps me to be comfortable. He first asked me some basic questions on OOPS concepts like function overloading and overriding. Then he asked me to explain any of my project and also put some question around it. After that he asked me one DSA question and share a google docs on which I have to code it. Then we dry run the code and he was satisfied with the solution.

• Q1. Distinct Occurences You are given two strings 'A' and 'B' of length 'N' and 'M' respectively, your task is to find the number of...read more
  View Answers (2)

Round duration - 60 Minutes
Round difficulty - Easy

This round is also a Technical Interview round. The main focus of interviewer was on OOPS concepts. Around 30mins he came up with OOPS questions only like abstract class, inheritance, interfaces, exception handling and alot of other topics. Then he asked some DBMS concepts like normalization and some SQL queries for which I gave him satisfactory answer. He also asked questions around Data structures like what are queues, stack, hashmap etc. In the end he asked one DSA question around Linked List.

• Q1. Intersection of Linked List You are given two Singly Linked List of integers, which are merging at some node of a third linked list. Your task is to find the da...read more
  View Answers (3)