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

SDE - 1

HashedIn
upvote
share-icon
3 rounds | 3 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 2 months
Topics: OOPS (Mandatory for every interview), Data Structures, Java, Python, DBMS, SQL.
Tip
Tip

Tip 1 : Make sure that your code runs (you cab prefer whatever language you’re best at)
Tip 2 : If you don’t have projects do some courses

Application process
Where: Campus
Eligibility: 7 cgpa throughout
Resume Tip
Resume tip

Tip 1 : Everything should be crisp and clear
Tip 2 : You can elaborate your projects

Interview rounds

01
Round
Hard
Online Coding Interview
Duration90 minutes
Interview date3 Jun 2021
Coding problem1

It was an online coding test having with some Technical MCQ's

1. Remove Duplicates from Sorted Array

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

You are given a sorted integer array 'arr' of size 'n'.


You need to remove the duplicates from the array such that each element appears only once.


Return the length of this new array.


Note:
Do not allocate extra space for another array. You need to do this by modifying the given input array in place with O(1) extra memory. 


For example:
'n' = 5, 'arr' = [1 2 2 2 3].
The new array will be [1 2 3].
So our answer is 3.
Try solving now
02
Round
Medium
Video Call
Duration40 minutes
Interview date5 Jun 2021
Coding problem1

• It started with tell me about yourself 
• Which language i’m comfortable with
• I was given a question on Reverse
• Basic Computer Science theoretical questions
• DBMS
• SQL
• TESTING

1. DBMS Questions

Asked about basic Joins and Indexes in SQL

03
Round
Hard
Video Call
Duration40 minutes
Interview date7 Jun 2021
Coding problem1

It was pure Data Structure Round. You have to be very Strong in your DS Concepts

1. N Queens

Hard
55m average time
35% success
0/120
Asked in companies
AmazonAdobeIntuit

You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.

A queen can be killed when it lies in the same row, or same column, or the same diagonal of any of the other queens. You have to print all such configurations.

Try solving now

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
2198 views
0 comments
0 upvotes