i
HashedIn by
Deloitte
Filter interviews by
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.
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...
What people are saying about HashedIn by Deloitte
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...
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.
Instagram's database design focuses on user profiles, posts, comments, likes, and relationships for efficient data retrieval.
User Table: Stores user information like username, email, password hash, profile picture.
Post Table: Contains post details such as image URL, caption, timestamp, and user ID.
Comment Table: Links comments to posts and users, storing comment text and timestamps.
Like Table: Tracks likes on post...
Design a scalable loan generating system to process applications, assess risk, and disburse loans efficiently.
User Registration: Users create accounts with personal and financial information.
Loan Application: Users submit loan applications specifying amount, term, and purpose.
Credit Scoring: Integrate with credit bureaus to assess applicant creditworthiness.
Risk Assessment: Use algorithms to evaluate risk based on...
This project involves a relational database schema for a library management system.
Entities: Books, Authors, Members, Loans.
Relationships: A Book can have multiple Authors (Many-to-Many).
A Member can borrow multiple Books (One-to-Many).
Loans table tracks which Member has borrowed which Book.
I applied via Approached by Company and was interviewed before Mar 2021. There were 3 interview rounds.
Sort an array of 0s, 1s, 2s in linear time.
Use three pointers to keep track of the positions of 0s, 1s, and 2s.
Traverse the array once and swap elements based on their values.
The final array will have 0s, 1s, and 2s grouped together in that order.
Finding the Kth smallest element in an array.
Sort the array and return the Kth element.
Use a min heap to find the Kth smallest element.
Use quickselect algorithm to find the Kth smallest element.
Divide and conquer approach using binary search.
Use selection algorithm to find the Kth smallest element.
Designing APIs and finding second largest value in SQL query.
For API design, consider RESTful principles and use clear and concise naming conventions.
For finding second largest value in SQL, use ORDER BY and LIMIT clauses.
Consider edge cases such as duplicates and null values.
Test thoroughly to ensure correct functionality.
Check if there exists a pair of numbers in the array that add up to a given sum.
Iterate through the array and for each element, check if the difference between the sum and the element exists in the array using a hash table.
Alternatively, sort the array and use two pointers to traverse from both ends towards the middle, adjusting the pointers based on the sum of the current pair.
I appeared for an interview in Jan 2025.
Leetcode medium level questions
There were 3 Dsa based questions out of which two were medium and one was easy.
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
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 before Dec 2022.
Based on logical thinking and reasoning questions
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.
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.
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
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
I appeared for an interview in Mar 2025, where I was asked the following questions.
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.
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...
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.
An anagram is a word or phrase formed by rearranging the letters of another, using all original letters exactly once.
Anagrams must use all the original letters exactly once.
Example: 'listen' and 'silent' are anagrams.
Anagrams can be phrases too: 'A gentleman' and 'Elegant man'.
They are often used in word games and puzzles.
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.
based on 97 interview experiences
Difficulty level
Duration
based on 473 reviews
Rating in categories
Software Engineer
466
salaries
| ₹8.2 L/yr - ₹15.4 L/yr |
Software Engineer2
452
salaries
| ₹12 L/yr - ₹21 L/yr |
Senior Software Engineer
215
salaries
| ₹12.2 L/yr - ₹21.4 L/yr |
Software Engineer II
213
salaries
| ₹9.7 L/yr - ₹19 L/yr |
Software Developer
212
salaries
| ₹7.8 L/yr - ₹17.7 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant