HashedIn by Deloitte Interview Questions, Process, and Tips

Leetcode medium level questions

Q1. Dsa question was asked . You need to implement optimized solution
Add your answer
Q2. Questions from resume and some on database
Add your answer

Q1. Medium level dsa question. Again needed optimized approach .
Add your answer
Q2. System design questions
Add your answer

Q1. Fitment round . Questions on previous work experience and hr questions
Add your answer

There were 3 Dsa based questions out of which two were medium and one was easy.

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
Answered by AI
Add your answer
Q2. Dbms acid questions
Add your answer

Q1. Dsa question oninked list and array medium level.
Add your answer
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
Answered by AI
Add your answer

Q1. Situation based questions
Add your answer
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
Answered by AI
Add your answer

Q1. Product RCA and past exp
Add your answer
Q2. Waste of time guy focus on some better companies
Add your answer

They had three coding questions for 1:30 hr and Two technical rounds and at last they had fitment round

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
Answered by AI
Add your answer
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.
Answered by AI
Add your answer

Q1. Questions where based on sysytem design
Add your answer
Q2. Low level system design questions , design a tic tac toe game
Add your answer

1.5 hours
1) maximum subarray sum - LeetCode;
2) keto eating banana - LeetCode;
3) the third one was difficult - dynamic programming question.

Q1. Maximum subarray sum Length of Binary tree Merge Two sorted Linked List
Add your answer
Q2. Quesions from projects, OOPs, Web Development.
Add your answer
Q3. Pagination, Hoisting etc.
Add your answer
Q4. DML, DDL etc
Add your answer

Q1. System Design Relational Schema Table Designing SQL
Add your answer
Q2. Project discussion + Html js code + basic ques on ML etc
Add your answer