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

SDE - 1

Coinbase
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
When I joined college, I was unaware of this Data Structure and Algorithm, which made my journey to getting an internship way more complicated. From that point, I started doing questions on leetcode and code studio.
Application story
This company visited for the placement to my college i get to know about this company from my college placement cell.
Why selected/rejected for the role?
I was rejected because i was not able to provide a good approach to the DSA question which are being asked
Preparation
Duration: 4 Months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1 : Practice from Leetcode, solve Leetcode medium level problems.
Tip 2 : Brush up computer fundamentals from subjects like OS, DBMS and CN.
Tip 3 : Have a good project or good internship experience and have in-depth knowledge regarding what you have done.

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

Tip 1 : Do not even mention topics you have no idea about
Tip 2 : you should have some projects on resume and you should be able to explain clearly why you have chosen the particular project, what does it do, its functionality, outcomes and everything about each of the projects.
Tip 3 : Tailor your resume according to the needs/the role you are applying for

Interview rounds

01
Round
Easy
Video Call
Duration45 Minutes
Interview date15 Dec 2022
Coding problem2

1. Count Inversions

Moderate
40m average time
55% success
0/80
Asked in companies
BNY MellonMicrosoftInfosys

For a given integer array/list 'ARR' of size 'N' containing all distinct values, find the total number of 'Inversions' that may exist.

An inversion is defined for a pair of integers in the array/list when the following two conditions are met.

A pair ('ARR[i]', 'ARR[j]') is said to be an inversion when:

1. 'ARR[i] > 'ARR[j]' 
2. 'i' < 'j'

Where 'i' and 'j' denote the indices ranging from [0, 'N').
Problem approach

Firstly I gave him a brute force approach, then he asked me to give an optimal solution so I gave him an enhanced merge-sort solution.

Try solving now

2. Convert a binary tree to its sum tree

Easy
15m average time
85% success
0/40
Asked in companies
AmazonMicrosoftSamsung

Given a binary tree of integers, you are supposed to modify the given binary tree to a sum tree where each node value is replaced by the sum of the values of both left and right subtrees in the given tree. The value of leaf nodes is changed to zero.

Example:
Below is the example showing the input tree and its sum tree.  

alt text

Try solving now
02
Round
Easy
Video Call
Duration60 Minutes
Interview date15 Dec 2022
Coding problem2

1. Maximum Frequency Number

Easy
10m average time
90% success
0/40
Asked in companies
IBMAdobeQualcomm

Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given input. He needs your help to solve this problem.

If two or more elements contend for the maximum frequency, return the element which occurs in the array first i.e. whose index is lowest.

For example,

For 'arr' = [ 1, 2, 3, 1, 2]. you need to return 1.
Try solving now

2. Zigzag Binary Tree Traversal

Easy
10m average time
90% success
0/40
Asked in companies
Goldman SachsAmazonFlexiEle Consulting Services (FE)

You are given a ‘Binary Tree’.


Return the level-order traversal of the Binary Tree.


Example:
Input: Consider the following Binary Tree:

Example

Output: 
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]


Try solving now
03
Round
Easy
HR Round
Duration60 Minutes
Interview date15 Dec 2022
Coding problem1

1. Basic HR Questions

What are your goals?
What motivates you to do good job?

Give me an example of your creativity.
How long would you expect to work for us if hired?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which array operation has O(n) worst-case time complexity?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Coinbase
2276 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Coinbase
3572 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Coinbase
952 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Coinbase
900 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
108664 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52875 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32564 views
6 comments
0 upvotes