51 questions · from 8 interviews

Hashedin interview questions

Every question candidates reported from their Hashedin interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Hashedin coding and DSA questions

  1. 01

    Count Pairs with arr[i] > 3*arr[j]

    Given an array arr of size n (1 ≤ n ≤ 10⁵) where each element satisfies 0 ≤ arr[i] ≤ 10⁹, count the number of pairs of indices (i, j) such that i 3 arr[j].

    From HashedIn by Deloitte SDE-I Interview Experience | On Campus

  2. 02

    Largest Subarray with Minimum Frequency T

    Given an integer array arr of size n (1 ≤ n ≤ 10⁵) and an integer T (1 ≤ T ≤ n), find the largest (longest) subarray such that the frequency of every element inside that subarray is at least T. Each element satisfies 0 ≤ arr[i] ≤ 10⁹.

    From HashedIn by Deloitte SDE-I Interview Experience | On Campus

  3. 03

    First Non-Repeating Element Index

    Given an integer array, return the index of the first non‑repeating element. If every element repeats, return -1.

    From HashedIn by Deloitte SDE-I Interview Experience | On Campus

  4. 04

    Decode String

    Given an encoded string, return its decoded form. The encoding rule is: k[encodedstring], where the encodedstring inside the square brackets is repeated exactly k times. Nested encodings are possible. Example: "3[a2[c]]" → "accaccacc".

    From HashedIn by Deloitte SDE-I Interview Experience | On Campus

  5. 05

    Second and Third Largest Unique Salaries

    Given an employees table that contains a column salary, write a query to retrieve the second and third largest unique salary values.

    From HashedIn by Deloitte SDE-I Interview Experience | On Campus

  6. 06

    Longest Palindromic Subsequence (LCS Variation)

    Given a string, reverse it and find the Longest Common Subsequence (LCS) between the original string and its reverse. This is effectively finding the Longest Palindromic Subsequence.

    Medium · From Interview Experience in Hashedin by Deloitte

  7. 07

    Second Largest Palindromic Subsequence

    After finding the Longest Palindromic Subsequence, identify the second largest palindromic subsequence in the given string.

    Hard · From Interview Experience in Hashedin by Deloitte

  8. 08

    Detect Cycle in Linked List

    Detect if a cycle exists in a singly linked list. The Hare and Tortoise (Floyd's Cycle-Finding) method was discussed.

    Easy · From Interview Experience in Hashedin by Deloitte

  9. 09

    Implement Stack using Queue

    Implement a stack's basic operations (push, pop, top, empty) using only queues.

    Medium · From Interview Experience in Hashedin by Deloitte

  10. 10

    Remove Duplicates from Sorted List

    Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well.

    Easy · From HASHEDIN _INTERVIEW EXPERIENCE

  11. 11

    Reorganize String

    Given a string S, check if the letters can be rearranged so that two characters that are adjacent to each other are not the same. If possible, output any possible result. If not possible, return the empty string.

    Medium · From HASHEDIN _INTERVIEW EXPERIENCE

  12. 12

    Convert Decimal to Octal Number

    The problem was to convert a decimal number to its octal representation, similar in concept to converting a number to hexadecimal.

    Easy · From HASHEDIN _INTERVIEW EXPERIENCE

  13. 13

    Minimum Number of Steps to Make Two Strings Anagram

    Given two strings s and t of the same length, you want to change s into t. In one step you can choose any character of s and change it to another character. Return the minimum number of steps to make t an anagram of s. An Anagram of a string is a string that…

    Medium · From HASHEDIN _INTERVIEW EXPERIENCE

  14. 14

    Reverse Linked List

    Given the head of a singly linked list, reverse the list, and return the reversed list. I was asked to implement both iterative and recursive solutions.

    Easy · From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  15. 15

    Rotate Array

    Given an array, rotate the array to the right by k steps, where k is non-negative. There were multiple follow-up questions related to this, likely exploring in-place solutions, optimal time/space complexity, and handling edge cases.

    Medium · From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  16. 16

    Jump Game

    Given an array of non-negative integers nums , you are initially positioned at the first index, and each element in the array represents your maximum jump length at that position. Determine if you are able to reach the last index.

    Medium · From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  17. 17

    Jump Game II

    Given an array of non-negative integers nums , you are initially positioned at the first index, and each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps.

    Medium · From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  18. 18

    Jump Game III

    Given an array of non-negative integers arr , you are initially positioned at start index. When you are at index i , you can jump to i + arr[i] or i - arr[i] . You want to reach any index j where arr[j] == 0 . Return true if you can reach such an index,…

    Medium · From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  19. 19

    Jump Game IV

    Given an array of integers arr , you are initially positioned at the first index. In one step, you can jump from index i to: i + 1 if i + 1 < arr.length i - 1 if i - 1 >= 0 j where arr[i] == arr[j] and i != j Return the minimum number of steps to reach…

    Hard · From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  20. 20

    Convert String of Digits to Integer

    Given a string consisting of digits, I had to convert it into an equivalent integer without using any built-in APIs. For example, if the input is "123", the output should be 123.

    From HashedIn-by-Deloitte | Python developer | March | Bangalore [Offer]

  21. 21

    Longest Substring as Prefix, Infix, and Suffix

    Given a string, I needed to find the longest substring that appears as a prefix, an infix (somewhere in the middle), and a suffix within the given string. For example, for the input "abczygabcpqrabc", the answer is "abc".

    From HashedIn-by-Deloitte | Python developer | March | Bangalore [Offer]

  22. 22

    Kth Element in Merged Sorted Arrays

    Given two sorted arrays of sizes m and n, find the element at the kth position when the two arrays are merged and sorted. The solution should use O(1) space.

    From Hashedin SDE 2022 || March 2022 || Bangalore || Selected

  23. 23

    Triplet Sum

    Find three numbers in an array that sum up to a given target k.

    Medium · From Hashedin SDE 2022 || March 2022 || Bangalore || Selected

  24. 24

    Linked List: Fast & Slow Pointers

    An easy-level problem on linked lists, solved using the Fast and Slow Pointer approach.

    Easy · From hashedin

  25. 25

    Binary Tree Depth Traversal

    A problem on binary trees requiring traversal by depth.

    From hashedin

7 more in the Hashedin write-ups.

Hashedin system design questions

  1. 01

    Design a Flipkart-type E-commerce App

    Design a high-level e-commerce application similar to Flipkart, including features like product listings, user management, and order processing. I was asked to create API call flow diagrams and a database schema with foreign key references. Additionally, I…

    Hard · From Interview Experience in Hashedin by Deloitte

  2. 02

    Vehicle Rental System Schema Design

    I was asked to design a schema or Entity-Relationship (E-R) diagram for a vehicle rental system. The scenario involved a vendor renting 2-wheelers across 6 different locations.

    From HASHEDIN _INTERVIEW EXPERIENCE

  3. 03

    Design Database Schema for Movie Ticket Booking Application

    I was tasked with designing a comprehensive database schema for a Movie Ticket Booking Application. This required me to identify key entities such as Movies, Theaters, Shows, Bookings, Users, and Payments, and then define their attributes, relationships, and…

    From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  4. 04

    Design an Event Management Campaign Portal

    The interviewer presented a scenario: design an event management campaign portal where a manager could add, start, and stop campaigns at any time. I was asked to outline the process for adding a campaign (e.g., login, home page) and then write the exact API…

    From HashedIn-by-Deloitte | Python developer | March | Bangalore [Offer]

  5. 05

    Design Sudoku Game

    Design a low-level system for a Sudoku game.

    From Hashedin SDE 2022 || March 2022 || Bangalore || Selected

  6. 06

    Food Delivery System Design

    Design a classic food delivery system, including APIs and database tables. Discussion points included single points of failure, database scaling, and database sharding.

    From hashedin

  7. 07

    Database Schema for Restaurant Food Ordering System

    I was asked to design a database schema for a fully automated system for ordering food at a restaurant, along with different questions related to the design process.

    From Hashedin | SE | G.L. Bajaj, Greater Noida | 8 Sept 2019 [Reject]

  8. 08

    URL Shortener Design

    What is a URL shortener? They wanted to assess my problem-solving skills with this question.

    From Hashedin | SE | G.L. Bajaj, Greater Noida | 8 Sept 2019 [Reject]

Hashedin behavioural and HR questions

  1. 01

    My Journey and Experience

    The manager asked me to share details about my professional journey so far.

    From HashedIn-by-Deloitte | Python developer | March | Bangalore [Offer]

  2. 02

    Reason for Switch and Relocation

    I was asked about my reasons for looking for a job switch and considering relocation.

    From HashedIn-by-Deloitte | Python developer | March | Bangalore [Offer]

  3. 03

    Why HashedIn and This Role

    The interviewer inquired about my specific interest in HashedIn and this particular Python Developer role.

    From HashedIn-by-Deloitte | Python developer | March | Bangalore [Offer]

  4. 04

    Challenging Task & Motivation

    Describe a challenging task where I saved time and money for the company, discuss my motivations, and confirm willingness to work from the office.

    From hashedin

Hashedin other questions

  1. 01

    Diamond Inheritance in C++

    Explain the concept of diamond inheritance in C++ and how it can lead to ambiguity and the 'deadly diamond of death' problem. Discuss solutions like virtual inheritance.

    From Interview Experience in Hashedin by Deloitte

  2. 02

    Types of Joins in SQL

    Describe the different types of joins available in SQL (INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL OUTER JOIN) and provide scenarios where each would be used.

    From Interview Experience in Hashedin by Deloitte

  3. 03

    Virtual Constructor Concept

    Discuss the concept of a virtual constructor. Explain why C++ does not directly support virtual constructors and alternative design patterns or techniques to achieve similar polymorphic object creation behavior.

    From Interview Experience in Hashedin by Deloitte

  4. 04

    SQL Query: Find Second Largest Element

    Write a SQL query to find the second largest element in a given table.

    From Interview Experience in Hashedin by Deloitte

  5. 05

    SQL Queries on Joins

    I was asked several SQL queries specifically focusing on different types of JOIN operations, such as INNER JOIN , LEFT JOIN , RIGHT JOIN , and FULL JOIN . The interviewer wanted to understand my grasp of how these joins work and their practical use cases for…

    From Hashedin By Deloitte | SDE Intern | Interview Experience | Offer

  6. 06

    Operating System - Deadlocks

    I was asked some OS questions, specifically about Deadlocks.

    From Hashedin | SE | G.L. Bajaj, Greater Noida | 8 Sept 2019 [Reject]

  7. 07

    ACID Properties

    I was asked what the ACID properties are.

    From Hashedin | SE | G.L. Bajaj, Greater Noida | 8 Sept 2019 [Reject]

Hashedin interview questions FAQ

What questions are asked in Hashedin interviews?

Candidates reported 51 distinct questions across 8 Hashedin interviews. 32 coding and DSA questions, 8 system design questions, 4 behavioural and HR questions, 7 other questions.

How difficult are Hashedin interview questions?

Of the questions candidates rated, 32% were easy, 53% medium and 16% hard.