HashedIn interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

HashedIn
upvote
share-icon
4 rounds | 9 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 month
Topics: Data Structures, OOPS, Algorithms, OS, System Design
Tip
Tip

Tip 1 : Have a good grasp of Data Structures.
Tip 2 : Good in core subjects
Tip 3 : Good projects are a plus

Application process
Where: Campus
Eligibility: Above 6.5 CGPA
Resume Tip
Resume tip

Tip 1 : Show projects on resume
Tip 2 : Have Linkedin, github urls on the resume

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60. mins
Interview date12 Nov 2020
Coding problem1

1. Divisible Substrings

Easy
15m average time
75% success
0/40
Asked in company
HashedIn

You are given a number in the form of a string ‘S’ of length ‘N’ consisting of characters from '0' to '9' (both inclusive) .

You must return the number of substrings that are divisible by 5. Some strings divisible by 5 are ‘5’, ‘370’, and ‘1000’.

Note :

A substring can start with a zero. The given number may also contain leading zeroes.

Example:

‘S'= ‘5203’

Here, four substrings are divisible by 5: ‘5’, ’520’, ‘20’, ‘0’.
Hence the answer is 4.
Problem approach

The idea is very simple to solve this problem. Calculate the sum of digits of a given number and then for each index, remove that digit and try all possible digits from 0 to 9 and see if the sum is divisible by 3 or not

Try solving now
02
Round
Medium
Video Call
Duration45 mins
Interview date2 Dec 2020
Coding problem4

1. DBMS Question

What do you know about SQL Views?

2. OOPs Question

What is Data Abstraction?

3. OS Question

What do you mean by thrashing?

4. Shortest subarray with sum at least K

Moderate
15m average time
85% success
0/80
Asked in companies
ApplePayPalPark+

Given an array/list 'ARR' of integers and an integer ‘K’. You are supposed to return the length of the shortest subarray that has a sum greater than or equal to ‘K’. If there is no subarray with a sum greater than or equal to K, then return -1.

Note :
An array ‘B’ is a subarray of an array ‘A’ if ‘B’ that can be obtained by deletion of, several elements(possibly none) from the start of ‘A’ and several elements(possibly none) from the end of ‘A’. 
Problem approach

I explained the optimal solution and the time complexity of the solution that I proposed.

Try solving now
03
Round
Easy
Video Call
Duration60 mins
Interview date4 Dec 2020
Coding problem3

1. OS Question

What is the difference between Multitasking and Multiprogramming?

2. OOPs Question

Basic knowledge of OOP implementation.

3. DSA Question

the correct usage of Data Structures.

04
Round
Easy
HR Round
Duration45 mins
Interview date12 May 2022
Coding problem1

1. Basic HR Questions

How are you doing? Tell me about your family your interests/hobbies.

Why Hashed In?

Do you hold any offers currently? CTC offered by them.

The challenges we faced during Pandemic.

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
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by HashedIn
1267 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by HashedIn
1026 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by HashedIn
924 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by HashedIn
718 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by BNY Mellon
6365 views
3 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by BNY Mellon
0 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by CIS - Cyber Infrastructure
2197 views
0 comments
0 upvotes