Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by HashedIn by Deloitte Team. If you also belong to the team, you can get access from here

HashedIn by Deloitte Verified Tick

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

HashedIn by Deloitte Software Developer Trainee Interview Questions and Answers

Updated 29 Nov 2024

HashedIn by Deloitte Software Developer Trainee Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Arrays and dp questions

Round 2 - Technical 

(2 Questions)

  • Q1. Maximum depth of binary tree
  • Ans. 

    The maximum depth of a binary tree is the longest path from the root node to a leaf node.

    • The maximum depth of a binary tree can be calculated recursively by finding the maximum depth of the left and right subtrees and adding 1.

    • The maximum depth of an empty tree is 0.

    • Example: For a binary tree with root node A, left child B, and right child C, the maximum depth would be 2.

  • Answered by AI
  • Q2. Is anagram or not

Skills evaluated in this interview

Interview questions from similar companies

I applied via Recruitment Consultant and was interviewed before Mar 2020. There was 1 interview round.

Interview Questionnaire 

4 Questions

  • Q1. How can you print names of 4 threads in the given order?
  • Ans. 

    Printing names of 4 threads in a given order using an array of strings.

    • Create an array of strings with the names of the threads in the desired order.

    • Use a loop to iterate through the array and print each thread name.

    • Ensure that the threads are started in the same order as the names in the array.

  • Answered by AI
  • Q2. All related questions about enum
  • Q3. About data structures in java, at times they may go for algorithms
  • Q4. String based logical questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared for java relates questions and post that u will be hit with data structures and algorithms questions.

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. AWS related

I appeared for an interview before Nov 2020.

Interview Questionnaire 

3 Questions

  • Q1. Simple and Easy questions on OOPS, static variable, Prioriry queue,
  • Q2. Design question,
  • Q3. Binary Search

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy you can crack this shit easily

I applied via Referral and was interviewed before Aug 2021. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Basic Core Java questions oops concepts some sql queries
Round 2 - Technical 

(1 Question)

  • Q1. Question on Data structure list and hasmap ,java collection

Interview Preparation Tips

Topics to prepare for Bounteous x Accolite Software Engineer interview:
  • Core java,
  • Collections
Interview preparation tips for other job seekers - Prepare core java ,oops , collection coding questions to print -1 in place of duplicate elements

I applied via Naukri.com and was interviewed before Sep 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. IOS Basics , iPhone programming

Interview Preparation Tips

Interview preparation tips for other job seekers - When you tried a lot to get good company if you have no option then go for it ,Make this to last of your joining preferences.You will be deadlocked in the bond think twice before Join.

I appeared for an interview in Sep 2017.

Interview Questionnaire 

4 Questions

  • Q1. Technical interview take by client technical person actually they are hiring for another client so they took total 3 technical round and final will HR round
  • Q2. Asking about life cycle of Dot net mvc contols entity frame work and SQL queries
  • Q3. Problem based on oops and SQL queries outputs
  • Q4. Basic questions about my self ,salary discussion basic formalities form I have to fill up

Interview Preparation Tips

Round: Test
Experience: There were around 15 objective question that includes mvc, c#.net and SQL server. It was very simple question like different types of filters,Acton results in mvc. Basic oops concept and dot net web page regarding

Round: Resume Shortlist
Experience: After completing test round another was technical round discussed maily for mvc and SQL server questions. Around 30 mint discussion. After qualify this round another round will start from client technical staff.

General Tips: It was for 2-3 year experience person very simple to crack but focus on you which profile you are looking for study interview questions from net
Skills: Dot net mve oops concept jQuery and SQL server

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Basics from all framework you have worked on.
  • Q2. There working all are non technical people's they don't know the projects here major people working in testing and non related work

I applied via Walk-in and was interviewed before Jul 2021. There were 3 interview rounds.

Round 1 - Coding Test 

Data structures and algorithms

Round 2 - Coding Test 

Python etl,pandas, pyspark questions

Round 3 - HR 

(1 Question)

  • Q1. Salary negotiation , work culture

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong with the basics and practice common programming problems

HashedIn by Deloitte Interview FAQs

How many rounds are there in HashedIn by Deloitte Software Developer Trainee interview?
HashedIn by Deloitte interview process usually has 2 rounds. The most common rounds in the HashedIn by Deloitte interview process are Coding Test and Technical.
What are the top questions asked in HashedIn by Deloitte Software Developer Trainee interview?

Some of the top questions asked at the HashedIn by Deloitte Software Developer Trainee interview -

  1. maximum depth of binary t...read more
  2. is anagram or ...read more

Tell us how to improve this page.

HashedIn by Deloitte Software Developer Trainee Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

ITC Infotech Interview Questions
3.6
 • 337 Interviews
CitiusTech Interview Questions
3.4
 • 273 Interviews
NeoSOFT Interview Questions
3.6
 • 268 Interviews
Tiger Analytics Interview Questions
3.7
 • 226 Interviews
Episource Interview Questions
3.9
 • 220 Interviews
Altimetrik Interview Questions
3.8
 • 219 Interviews
Xoriant Interview Questions
4.1
 • 183 Interviews
Incedo Interview Questions
3.1
 • 182 Interviews
View all
Software Engineer
446 salaries
unlock blur

₹5 L/yr - ₹16.5 L/yr

Software Engineer2
388 salaries
unlock blur

₹8.5 L/yr - ₹23 L/yr

Senior Software Engineer
225 salaries
unlock blur

₹8.8 L/yr - ₹30 L/yr

Software Engineer II
182 salaries
unlock blur

₹9.7 L/yr - ₹20 L/yr

Software Developer
176 salaries
unlock blur

₹5.2 L/yr - ₹17 L/yr

Explore more salaries
Compare HashedIn by Deloitte with

ITC Infotech

3.6
Compare

CMS IT Services

3.1
Compare

KocharTech

3.9
Compare

Xoriant

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview