Faster and better experience!
i
HashedIn by Deloitte
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
There were 3 Dsa based questions out of which two were medium and one was easy.
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
They had three coding questions for 1:30 hr and Two technical rounds and at last they had fitment round
Reverse the array of strings
Create a new array and iterate through the original array in reverse order, adding each element to the new array
Alternatively, you can use the reverse() method on the array itself
Use Floyd's Tortoise and Hare algorithm to detect a loop in a linked list.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If they meet at any point, there is a loop in the linked list.
Balancing people and processes is essential for effective team management.
Effective team management requires a balance between focusing on people and processes.
Investing in developing strong relationships with team members can lead to better collaboration and productivity.
Establishing clear processes and guidelines can help streamline workflows and ensure consistency in performance.
Regularly evaluating and adjusting bo...
Senior Management case study scenario, conflict management
HashedIn by Deloitte interview questions for popular designations
I applied via campus placement at Arya College of Engineeringg, Jaipur and was interviewed in Nov 2024. There were 2 interview rounds.
3 coding question 1 easy 2 med, 1 hard have to do in 90 mins
Get interview-ready with Top HashedIn by Deloitte Interview Questions
I applied via Campus Placement and was interviewed in Oct 2024. There were 2 interview rounds.
Arrays and dp questions
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.
I applied via Company Website and was interviewed in May 2024. There were 3 interview rounds.
1 hour.
Technical questions on AWS, Python Pseudocode, Docker, Kubernetes, Linux commands and git commands.
AWS services include EC2 for virtual servers. To create and launch EC2 instances, use the AWS Management Console, CLI, or SDK.
Access the AWS Management Console and navigate to the EC2 dashboard
Click on 'Launch Instance' to choose an Amazon Machine Image (AMI), instance type, and configure instance details
Review and launch the instance, selecting key pair for SSH access
Use AWS CLI or SDK to create and launch EC2 instanc
I applied via Company Website and was interviewed in Jun 2024. There were 4 interview rounds.
There were 3 coding questions of moderate difficulty.
Transpose a matrix by swapping rows with columns
Iterate through each row and column and swap the elements
Create a new matrix with swapped rows and columns
Ensure the new matrix has the correct dimensions
Implement a swap method for two variables.
Create a temporary variable to store the value of one variable.
Assign the value of the second variable to the first variable.
Assign the value of the temporary variable to the second variable.
The depth of a binary tree is the number of edges on the longest path from the root node to a leaf node.
Depth of a binary tree can be calculated recursively by finding the maximum depth of the left and right subtrees and adding 1.
The depth of a binary tree with only one node (the root) is 0.
Example: For a binary tree with root node A, left child B, and right child C, the depth would be 1.
To find the middle element of a linked list, use two pointers - one moving at double the speed of the other.
Use two pointers - slow and fast, with fast moving at double the speed of slow.
When fast reaches the end of the list, slow will be at the middle element.
I want to join Hashedin because of its reputation for innovative projects and collaborative work environment.
Reputation for innovative projects
Collaborative work environment
Opportunities for growth and learning
Managing tight deadlines and learning new technologies were the main challenges faced in my previous internship.
Meeting tight project deadlines
Adapting to new technologies quickly
Working in a fast-paced environment
Collaborating with team members effectively
My expected salary is based on my experience, skills, and the market rate for software engineers.
Consider my years of experience in software development.
Take into account my specialized skills or certifications.
Research the current market rate for software engineers in this location.
Factor in any additional benefits or perks offered by the company.
Be open to negotiation based on the overall compensation package.
Top trending discussions
Interview experience
based on 387 reviews
Rating in categories
Software Engineer
402
salaries
| ₹5 L/yr - ₹16 L/yr |
Software Engineer2
357
salaries
| ₹9.5 L/yr - ₹22 L/yr |
Senior Software Engineer
211
salaries
| ₹8.1 L/yr - ₹26 L/yr |
Software Developer
162
salaries
| ₹7 L/yr - ₹15.5 L/yr |
Senior Product Specialist
162
salaries
| ₹12.4 L/yr - ₹25 L/yr |
TCS
Infosys
Wipro
HCLTech