AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
HashedIn by
Deloitte
Compare
Filter interviews by
HashedIn by Deloitte Interview Questions and Answers
129 Interview questions
To find all subsets of a list, use recursion or bit manipulation to generate combinations of elements.
Use recursion: Create a function that includes or excludes each element.
Example: For [1, 2], subsets are: [], [1], [2], [1, 2].
Use bit manipulation: Each subset corresponds to a binary number.
Example: For [1, 2], binary 00 -> [], 01 -> [1], 10 -> [2], 11 -> [1, 2].
Iterative approach: Start with an empt...
Key features for an Instagram-like app include user profiles, photo sharing, and social interactions.
User Authentication: Implement secure sign-up and login processes using OAuth or JWT.
Photo Uploading: Allow users to upload images with options for filters and editing (e.g., cropping, brightness).
Feed Algorithm: Develop a feed that shows posts based on user preferences and engagement (e.g., likes, comments).
Social...
Implementing a stack using two queues to maintain LIFO behavior with FIFO operations.
Push Operation: Enqueue to empty queue, move elements from non-empty queue, swap queues.
Pop Operation: Dequeue from the non-empty queue.
Top Operation: Return the front element of the non-empty queue.
IsEmpty Operation: Check if the non-empty queue is empty.
Example: Pushing 1, then 2 results in top being 2; popping gives top as 1.
A complete C++ implementation of a Tic-Tac-Toe game using object-oriented programming principles.
Use a class 'TicTacToe' to encapsulate game logic and state.
Implement methods for player moves, checking win conditions, and displaying the board.
Utilize a 2D array to represent the game board.
Include error handling for invalid moves.
Provide a simple text-based interface for user interaction.
Detecting a cycle in a linked list can be done using Floyd's Tortoise and Hare algorithm.
Use two pointers: slow and fast. Slow moves one step, fast moves two steps.
If there's a cycle, the fast pointer will eventually meet the slow pointer.
If the fast pointer reaches the end (null), there is no cycle.
Example: For a list 1 -> 2 -> 3 -> 4 -> 2 (cycle back to 2), slow and fast will meet at 2.
A palindrome is a string that reads the same forwards and backwards, like 'radar' or 'level'.
Check if the string is equal to its reverse. Example: 'madam' == 'madam'.
Ignore spaces and punctuation for a more flexible check. Example: 'A man, a plan, a canal, Panama!' is a palindrome.
Consider case sensitivity. Example: 'Racecar' is not the same as 'racecar' unless you ignore case.
A Jira system integrated with GitHub streamlines project management and version control, enhancing collaboration and tracking.
Issue Tracking: Jira allows teams to create, assign, and track issues, while GitHub manages code changes, linking commits to Jira issues.
Automation: Use webhooks to automate transitions in Jira based on GitHub events, like moving an issue to 'In Progress' when a branch is created.
Pull Reque...
Build a Python API for document processing using a web framework like Flask or FastAPI.
Choose a framework: Flask or FastAPI are popular choices for building APIs.
Set up the project structure: Create directories for routes, models, and services.
Define API endpoints: Use decorators to define routes for document upload and processing.
Implement document processing logic: Use libraries like PyPDF2 or docx to read and p...
SQL query to retrieve the second highest salary from a salary table.
Use the DISTINCT keyword to avoid duplicate salaries.
Order the salaries in descending order and limit the results.
A common approach is to use a subquery to find the maximum salary that is less than the highest salary.
Rotate an array of strings to the left by k places efficiently.
Use the modulo operator to handle cases where k is larger than the array length.
Example: For array ['a', 'b', 'c', 'd'] and k=2, result is ['c', 'd', 'a', 'b'].
Reverse the entire array, then reverse the first n-k elements and the last k elements.
Time complexity is O(n) and space complexity is O(1) if done in place.
HashedIn by Deloitte Interview Experiences
130 interviews found
Anonymous
Selected
I applied via Referral and was interviewed in Dec 2023. There were 3 interview rounds.
(2 Questions)
- Q1. Kadane's Algorithm
- Ans.
Kadane's Algorithm is used to find the maximum subarray sum in an array.
Iterate through the array and keep track of the maximum sum ending at each index.
If the sum at any index becomes negative, reset the sum to 0.
Return the maximum sum found.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
- Q2. Reverse a linkedin list
(1 Question)
- Q1. Design Instagram
(1 Question)
- Q1. Normal intro and hr related questions
Skills evaluated in this interview
I appeared for an interview in Jan 2025.
Leetcode medium level questions
(2 Questions)
- Q1. Dsa question was asked . You need to implement optimized solution
- Q2. Questions from resume and some on database
(2 Questions)
- Q1. Medium level dsa question. Again needed optimized approach .
- Q2. System design questions
(1 Question)
- Q1. Fitment round . Questions on previous work experience and hr questions
There were 3 Dsa based questions out of which two were medium and one was easy.
(2 Questions)
- Q1. System design of parking
- Ans.
Design a system for parking management
Use sensors to detect available parking spots
Implement a payment system for parking fees
Include a mobile app for users to find and reserve parking spots
Utilize cameras for security monitoring
Integrate with navigation apps for real-time parking availability updates
- Q2. Dbms acid questions
(2 Questions)
- Q1. Dsa question oninked list and array medium level.
- Q2. Project done in past
- Ans.
Developed a web application for tracking inventory and sales data
Used React.js for front-end development
Implemented RESTful APIs using Node.js and Express
Utilized MongoDB for database management
(2 Questions)
- Q1. Situation based questions
- Q2. How did you overcome failures
- Ans.
I overcome failures by learning from them, staying positive, and seeking feedback.
Learn from mistakes and identify areas for improvement
Stay positive and maintain a growth mindset
Seek feedback from colleagues or mentors to gain different perspectives
Set new goals and move forward with a renewed focus
Selected
I appeared for an interview before Dec 2022.
Based on logical thinking and reasoning questions
(2 Questions)
- Q1. Find maximum number from given array
- Ans.
Find the maximum number from a given array of strings.
Convert the array of strings to an array of integers.
Use a loop to iterate through the array and keep track of the maximum number found.
Return the maximum number at the end.
- Q2. Reverse the sentence
(1 Question)
- Q1. Why we hire you
- Ans.
I have a strong background in quality engineering, proven track record of improving processes, and a passion for continuous improvement.
I have a Bachelor's degree in Engineering with a focus on quality management.
I have successfully implemented quality improvement initiatives in my previous roles, resulting in cost savings and increased efficiency.
I am skilled in using quality tools such as Six Sigma, Lean, and statist...
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
(2 Questions)
- Q1. Product RCA and past exp
- Q2. Waste of time guy focus on some better companies
Interview Preparation Tips
I anyone from the audit/HR leadership is reading this please discuss the case with your HR Navya.
Also this happened when I had applied from employee referral, imagine what will happen to the profiles of direct applies on company portal or Linkedin.
They had three coding questions for 1:30 hr and Two technical rounds and at last they had fitment round
(2 Questions)
- Q1. Reverse the array
- Ans.
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
- Q2. Detect a loop in the linked list
- Ans.
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.
(2 Questions)
- Q1. Questions where based on sysytem design
- Q2. Low level system design questions , design a tic tac toe game
Skills evaluated in this interview
(2 Questions)
- Q1. Company culture fit
- Q2. People vs Process
- Ans.
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...
(2 Questions)
- Q1. MS proficiency related questions
- Q2. Data analysis related questions
Senior Management case study scenario, conflict management
Interview Preparation Tips
I applied via Campus Placement 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
(2 Questions)
- Q1. Asked about benefits of linked list, tree, graph
- Q2. Questions on SQL
Interview Preparation Tips
I appeared for an interview in Mar 2025, where I was asked the following questions.
- Q1. You are given n bulbs and a function that can identify a faulty bulb at any location among the n bulbs. If a bulb is found to be faulty, all subsequent bulbs will also be faulty. How can you determine the ...
- Q2. To rotate an array by k places to the left
- Q3. To find the second highest salary.Sql question
Interview Preparation Tips
I appeared for an interview in Jul 2024.
1.5 hours
1) maximum subarray sum - LeetCode;
2) keto eating banana - LeetCode;
3) the third one was difficult - dynamic programming question.
(4 Questions)
- Q1. Maximum subarray sum Length of Binary tree Merge Two sorted Linked List
- Ans.
The maximum subarray sum problem involves finding the contiguous subarray within a one-dimensional array of numbers which has the largest sum.
Use Kadane's algorithm to find the maximum subarray sum efficiently.
Consider all possible subarrays and calculate their sums to find the maximum.
Dynamic programming can be used to solve this problem efficiently.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subar...
- Q2. Quesions from projects, OOPs, Web Development.
- Q3. Pagination, Hoisting etc.
- Q4. DML, DDL etc
(2 Questions)
- Q1. System Design Relational Schema Table Designing SQL
- Q2. Project discussion + Html js code + basic ques on ML etc
Macha Jagadeesh
Selected
I appeared for an interview in Jun 2025, where I was asked the following questions.
- Q1. Array based DSA questions
- Q2. Design School time table
Top trending discussions
HashedIn by Deloitte Interview FAQs
Some of the top questions asked at the HashedIn by Deloitte interview -
The duration of HashedIn by Deloitte interview process can vary, but typically it takes about less than 2 weeks to complete.
Tell us how to improve this page.
HashedIn by Deloitte Interviews By Designations
- HashedIn by Deloitte Software Developer Interview Questions
- HashedIn by Deloitte Software Engineer Interview Questions
- HashedIn by Deloitte Software Engineer2 Interview Questions
- HashedIn by Deloitte Devops Engineer Interview Questions
- HashedIn by Deloitte SDE-2 Interview Questions
- HashedIn by Deloitte Software Engineer II Interview Questions
- HashedIn by Deloitte Software Development Engineer Interview Questions
- HashedIn by Deloitte Intern Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 99 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
HashedIn by Deloitte Reviews and Ratings
based on 478 reviews
Rating in categories
|
Software Engineer
483
salaries
|  ₹8.1 L/yr - ₹14.7 L/yr |
|
Software Engineer2
467
salaries
| ₹12 L/yr - ₹21 L/yr |
|
Software Developer
218
salaries
| ₹7.9 L/yr - ₹17.7 L/yr |
|
Software Engineer II
218
salaries
| ₹11 L/yr - ₹19 L/yr |
|
Senior Software Engineer
217
salaries
| ₹12.2 L/yr - ₹21.4 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- HashedIn by Deloitte Interview Questions
