HashedIn interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
HashedIn
4 rounds | 5 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 2 months
Topics: Dynamic Programming, Arrays, Linked List, System Design, OOPS, DBMS, OS.
Tip 1 : Do Leetcode Daily
Tip 2 : Focus on Projects
Tip 3 : Be consistent
Application process
Where: Linkedin
Eligibility: 7 CGPA and Above
Tip 1 : Be Practical in what are you writing
Tip 2 : Write things you know and be correct
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 Minutes
Interview date21 Jan 2022
Coding problem1
DSA 3 questions
1. Trapping Rain Water
Moderate
15m average time
80% success
0/80
Asked in companies
You have been given a long type array/list 'arr’ of size 'n’.
It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.
Print the total amount of rainwater that can be trapped in these elevations.
Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
Problem approach
Take two pointers l and r. Initialize l to the starting index 0 and r to the last index N-1.
Since l is the first element, left_max would be 0, and right_max for r would be 0.
While l ≤ r, iterate the array. We have two possible conditions
Condition1 : left_max <= right max
Consider Element at index l
Since we have traversed all elements to the left of l, left_max is known
For the right max of l, We can say that the right max would always be >= current r_max here
So, min(left_max,right_max) would always equal to left_max in this case
Increment l.
Condition2 : left_max > right max
Consider Element at index r
Since we have traversed all elements to the right of r, right_max is known
For the left max of l, We can say that the left max would always be >= current l_max here
So, min(left_max,right_max) would always equal to right_max in this case
Decrement r.
02
Round
Medium
Video Call
Duration60 Minutes
Interview date1 Feb 2022
Coding problem1
1. Cycle Detection in a Singly Linked List
Moderate
15m average time
80% success
0/80
Asked in companies
You are given a Singly Linked List of integers. Return true if it has a cycle, else return false.
A cycle occurs when a node's next points back to a previous node in the list.
Example:
In the given linked list, there is a cycle, hence we return true.
Problem approach
tortoise and hare algorithm
03
Round
Medium
Video Call
Duration90 Minutes
Interview date7 Feb 2022
Coding problem2
1. Fibonacci Member
Easy
0/40
Asked in companies
Create a function that determines whether a given number N belongs to the Fibonacci sequence. If N is found in the Fibonacci sequence, the function should return true; otherwise, it should return false.
Problem approach
DP using memoization(Top down approach)
2. System Design Question
Design Instagram
04
Round
Medium
HR Round
Duration40 Minutes
Interview date9 Feb 2022
Coding problem1
1. Basic HR questions
Why HashedIn?
How do you respond to change?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
4 rounds | 8 problems
Interviewed by HashedIn
Selected 
1267 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by HashedIn
Selected 1026 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by HashedIn
Selected 924 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by HashedIn
Rejected
718 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
Selected 6365 views
3 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
Selected 0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
Selected 2197 views
0 comments
0 upvotes