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

SDE - 1

Coinbase
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I kept practising DSA and CS fundamentals from the 3rd year of Engineering. Along with it, I was also learning web development and I made some good projects.
Application story
This company visited our campus for hiring, and I applied for the position. There were many rounds, starting with an online assessment.
Why selected/rejected for the role?
I was rejected because I was not able to give a concise and good solution to the question being asked to me.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1: Mention some good projects on your resume.

Tip 2: Be confident.

Tip 3: Be proficient in computer science basics, DSA, and algorithms.

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

Tip 1: Include good projects.

Tip 2: Having some achievements is a plus point.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date21 May 2023
Coding problem2

1. Count Distinct Element in Every K Size Window

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

You are given an array ‘ARR’ of size ‘N’ and an integer ‘K’. Your task is to find the total number of distinct elements present in every ‘K’ sized window of the array. A ‘K’ sized window can also be viewed as a series of continuous ‘K’ elements present in the sequence.

Note:
1. The size of ‘ARR’ will always be greater than or equal to the ‘K’.
2. Here window refers to a subarray of ‘ARR’. Hence ‘K’ sized window means a subarray of size ‘K’.
3. You are not required to print the output explicitly. It has already been taken care of. Just implement the function and return an array of the count of all distinct elements in the ‘K’ size window.

Example

Consider ARR = [ 1, 2, 1, 3, 4, 2, 3 ] and K = 3.

subsequence

As per the given input, we have a sequence of numbers of length 7, and we need to find the number of distinct elements present in all the windows of size 3.

Window-1 has three elements { 1, 2, 1 } and only two elements { 1, 2 } are distinct because 1 is repeating two times.
Window-2 has three elements { 2, 1, 3 } and all three elements are distinct { 2, 1, 3 }.
Window-3 has three elements { 1, 3, 4 } and all three elements are distinct { 1, 3, 4 }.
Window-4 has three elements { 3, 4, 2 } and all three elements are distinct { 3, 4, 2 }.
Window-5 has three elements { 4, 2, 3 } and all three elements are distinct { 4, 2, 3 }.

Hence, the count of distinct elements in all K sized windows is { 2, 3, 3, 3, 3 }.
Problem approach

Tip 1: Simple sliding window problem

Try solving now

2. Capacity To Ship Packages Within D Days

Moderate
15m average time
85% success
0/80
Asked in companies
Morgan StanleyFlipkartAmazon

You are the owner of a Shipment company. You use conveyor belts to ship packages from one port to another. The packages must be shipped within 'd' days.


The weights of the packages are given in an array 'weights'. The packages are loaded on the conveyor belts every day in the same order as they appear in the array. The loaded weights must not exceed the maximum weight capacity of the ship.


Find out the least-weight capacity so that you can ship all the packages within 'd' days.

Try solving now
02
Round
Easy
Video Call
Duration60 minutes
Interview date21 May 2023
Coding problem2

1. Two Sum IV - Input is a BST

Moderate
30m average time
65% success
0/80
Asked in companies
SprinklrAmazonMorgan Stanley

You have been given a Binary Search Tree and a target value. You need to find out whether there exists a pair of node values in the BST, such that their sum is equal to the target value.

A binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a value greater than all the values keys in the node's left subtree and less than those in its right subtree.

Follow Up:
Can you solve this in O(N) time, and O(H) space complexity?
Try solving now

2. Find Path

Hard
10m average time
90% success
0/120
Asked in companies
SamsungMorgan StanleyGameskraft

You are given a tree with 'N' nodes with 'N' - 1 distinct edge. You are also given two nodes 'N1' and 'N2'. You have to find and print the shortest path between 'N1' and 'N2'.

A tree data structure is a nonlinear hierarchical data structure that consists of nodes connected by edges.

Note

1. There is no cycle present in a tree.
2. All values in the tree are unique.
3. Both nodes will always exist in the tree.
Problem approach

Tip 1: I used graph traversal with an array

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

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Coinbase
1119 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Coinbase
2230 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Coinbase
938 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Coinbase
820 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107832 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52130 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32261 views
6 comments
0 upvotes