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 Software Engineer Interview Questions and Answers
14 Interview questions
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.
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.
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.
Asymptotic notation is a way to describe the performance of an algorithm in terms of its input size.
Asymptotic notation is used to analyze the efficiency of algorithms by focusing on how they behave as the input size approaches infinity.
Common notations include O (Big O), Ω (Big Omega), and Θ (Big Theta), which represent the worst-case, best-case, and average-case time complexity respectively.
For example, if an al...
What people are saying about HashedIn by Deloitte
I am drawn to Hashedin for its innovative culture, impactful projects, and commitment to professional growth.
Hashedin fosters a culture of innovation, encouraging engineers to explore new technologies and solutions.
The company works on impactful projects that solve real-world problems, such as optimizing supply chains or enhancing user experiences.
Hashedin emphasizes continuous learning and professional developmen...
Q1 - Pre order traversal without recursion. Q2 - Reverse a linked list.
Q1: Use a stack to keep track of nodes. Start with root, push it to stack. Pop top node, print it, push right and left children to stack.
Q2: Traverse the linked list and change the direction of the pointers. Set the head of the reversed list as the last node of the original list.
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
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
Excel Column Number Conversion
Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.
Example:
Input:
S = "AB"
Output:
28
Explanation:
The sequ...
Convert Excel column title to corresponding column number.
Iterate through each character in the input string
Calculate the corresponding value of each character based on its position in the alphabet
Multiply the value by 26 raised to the power of its position from the right in the input string
Sum up all the values to get the final column number
Increase Number By 1 Problem Statement
Given an array of integers NUM that consists of N elements, where the array represents the digits of a number, your task is to add 1 to this number. The number is pos...
Given an array representing digits of a number, add 1 to the number.
Iterate through the array from right to left, starting with the least significant digit.
Add 1 to the current digit and check if it becomes 10. If so, set it to 0 and carry over to the next digit.
Handle the case where the most significant digit needs to be incremented by creating a new array with an extra digit.
HashedIn by Deloitte Software Engineer Interview Experiences
17 interviews found
Anonymous
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
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
(1 Question)
- Q1. C++ related questions
(1 Question)
- Q1. Sql related questions qnd c++
(1 Question)
- Q1. What r u expected salary
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
Basic aptitude questions
Fibonacci series , 1/2 hr all test
Basic DS Algo, leetcode
(1 Question)
- Q1. Leetcode medium level question
(1 Question)
- Q1. Leetcoide meduim level question
(1 Question)
- Q1. Basic HR questions
Selected
I appeared for an interview before Jun 2024, where I was asked the following questions.
- Q1. The problem of implementing a stack using queues involves using two queues to simulate the behavior of a stack. The solution typically requires the following steps: \n\n1. **Push Operation**: To push an el...
- Ans.
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.
- Q2. What is the complete code for implementing a Tic-Tac-Toe game in C++ using proper object-oriented programming concepts?
- Ans.
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.
I applied via Campus Placement
Three Questions were there of dsa and one was sql
(3 Questions)
- Q1. There was question from dsa and sql
- Q2. What are assymptotic notation
- Ans.
Asymptotic notation is a way to describe the performance of an algorithm in terms of its input size.
Asymptotic notation is used to analyze the efficiency of algorithms by focusing on how they behave as the input size approaches infinity.
Common notations include O (Big O), Ω (Big Omega), and Θ (Big Theta), which represent the worst-case, best-case, and average-case time complexity respectively.
For example, if an algorit...
- Q3. Some questions were from Tree
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
DSA question based on array and trees.
(1 Question)
- Q1. First one was based on BS and second one based on Tree.
Selected
I appeared for an interview before Mar 2024.
Medium level DSA questions
Selected
I applied via Campus Placement and was interviewed before Apr 2023. There were 4 interview rounds.
Topics - There were three question, 1- easy, 2-medium
Medium level questions were from dynamic programming
(1 Question)
- Q1. Basic question were asked from the topics of OS, OOP, Database and Networking. 1 DSA question was asked.
(1 Question)
- Q1. Low level system design question was given. Design a database for a online cab booking company.
- Ans.
Design a database schema for an online cab booking service to manage users, drivers, rides, and payments.
Users table: Stores user information (e.g., user_id, name, email, phone).
Drivers table: Contains driver details (e.g., driver_id, name, vehicle_info, license_number).
Rides table: Records ride details (e.g., ride_id, user_id, driver_id, start_location, end_location, fare, status).
Payments table: Manages payment trans...
(1 Question)
- Q1. Basic HR questions.
Interview Preparation Tips
- Low level design, including database design and oop design is often asked.
HashedIn by Deloitte Interview FAQs
Some of the top questions asked at the HashedIn by Deloitte Software Engineer interview -
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
- Software Developer Interview Questions
- Senior Software Engineer Interview Questions
- Senior Engineer Interview Questions
- System Engineer Interview Questions
- Associate Software Engineer Interview Questions
- Project Engineer Interview Questions
- Lead Engineer Interview Questions
- Software Development Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 13 interview experiences
Difficulty level
Duration
Software Engineer Interview Questions from Similar Companies
HashedIn by Deloitte Software Engineer Reviews and Ratings
based on 66 reviews
Rating in categories
|
Software Engineer
473
salaries
|  ₹5.9 L/yr - ₹17.1 L/yr |
|
Software Engineer2
448
salaries
| ₹12 L/yr - ₹21 L/yr |
|
Software Developer
215
salaries
| ₹6 L/yr - ₹20 L/yr |
|
Senior Software Engineer
215
salaries
| ₹8.5 L/yr - ₹27 L/yr |
|
Software Engineer II
213
salaries
| ₹9.7 L/yr - ₹19 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant
- Home >
- Interviews >
- HashedIn by Deloitte Interview Questions
