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

SDE - 1

HashedIn
upvote
share-icon
4 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: DSA -> DP, Graph, Linked list, Arrays, Basics Operating System, DBMS, System Design.
Tip
Tip

Tip 1 : Be clear about the basics and DSA algorithms
Tip 2 : Have a good knowledge about anything you mentioning in your resume
 

Application process
Where: Campus
Eligibility: No backlogs
Resume Tip
Resume tip

Tip 1 : Mention the project you have worked and have good knowledge on
Tip 2 : Have a development skill

Interview rounds

01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date20 Oct 2020
Coding problem1

1. Two Sum

Easy
10m average time
90% success
0/40
Asked in companies
MeeshoAdobeInfo Edge India (Naukri.com)

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

We cannot use the element at a given index twice.

Follow Up:

Try to do this problem in O(N) time complexity. 
Try solving now
02
Round
Hard
Face to Face
Duration60 minutes
Interview date28 Oct 2020
Coding problem1

1. Merge LinkedList

Easy
20m average time
70% success
0/40
Asked in companies
PayPalRed HatAmazon

You are given two LinkedList of length ‘N’. Your task is to insert the elements of the second LinkedList in the first LinkedList at the alternate positions.

For example: Let 1 -> 3 -> 5 be the first LinkedList and 2 -> 4 -> 6 be the second LinkedList. Then after merging the first LinkedList will look like 1 -> 2 -> 3 -> 4 -> 5 -> 6.

Problem approach

In order to traverse through the lists to find the point at which they merge, we need to set two different pointers. One for the first singly linked list, another for the second. Remember that we are given the heads of both as parameters, so we will set our pointers to them in order to start from the beginning of each.

Try solving now
03
Round
Hard
Face to Face
Duration60 minutes
Interview date29 Oct 2020
Coding problem1

Theory + coding question based on problem and array

1. Count Frequency

Easy
15m average time
85% success
0/40
Asked in companies
AmazonSprinklrHewlett Packard Enterprise

You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.

Example :

Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 
Problem approach

Tip 1 : Create an empty array with size of 26(total alphabets)
Tip 2 : Run a loop through the sentence 
Tip 3 : Use ascii value to count the occurrence of the alphabet

Try solving now
04
Round
Medium
HR Round
Duration60 minutes
Interview date31 Oct 2020
Coding problem1

HR questions

1. Basic HR Questions

Questions were based on situations like what you are going to do or what should be your approach in a certain situation?

Asked about my project.

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