Coinbase Senior Software Engineer 1 Interview Questions and Answers

Q1. DSA question with Some Stack
Add your answer
Q2. Discussion around Current project
Add your answer

Q1. Managerial discussion around resume and some basic java and spring question
Add your answer
Q2. Java and spring boot question
Add your answer

The first round was an online assesment conducted on the hackerrank platform. This round
consisted of 3 DSA Question, 2 Medium and 1 Hard. The duration of the test was 1hr
45mins.

Q1. The question was really long, but it was essentially asking us to design a polling system with two actors (CLI only): the user and the administrator. The admin's tasks were to create a poll, delete a pol...read more
Add your answer

Q1. He asked me about the box model in CSS. He expected me to remember some basic Bootstrap and Tailwind classes, as well as the Bootstrap grid system. He was happy with the number of projects I had made and...read more
Add your answer

The exam duration is one and a half hours.

The total exam time is one and a half hours.

It encompasses all topics related to full stack development.

Q1. Asks questions on SQL
Add your answer
Q2. Asks question in typical topics
Add your answer

Q1. Where do you see yourself in two years?
Ans. 
In two years, I see myself as a senior software developer leading a team on innovative projects.
• Advancing to a senior software developer role

• Leading a team on new and innovative projects

• Continuing to enhance my technical skills through ongoing learning and training
Answered by AI
Add your answer

Q1. Explain Deadlock?
Add your answer
Q2. Explain Red Black Tree?
Add your answer
Q3. Find local minima in a 1-D array?
Add your answer
Q4. Find local minima in 2-D array?
Add your answer

Q1. LRU Cache - how to tackle
Ans. 
LRU Cache is a data structure that maintains a list of items in order of most recently used to least recently used.
• Implement using a doubly linked list and a hashmap for efficient operations

• When an item is accessed, move it to the front of the list

• When the cache is full, remove the least recently used item from the end of the list
Answered by AI
Add your answer
Q2. LRU Cache implementation based on a real time system. How would the main work which will be called etc etc
Add your answer

Q1. Asked to write a program to check whether string is valid or not. String consists of only three kind of special characters "(), [], {}". We need to return true if all special characters are in correct for...read more
Add your answer
Q2. What is useRef hook used for?
Ans. 
useRef hook is used to persist a mutable value across renders without causing a re-render.
• Used to store mutable values that do not trigger re-renders.

• Commonly used for accessing DOM elements or storing previous values.

• Does not cause a re-render when the value changes.
Answered by AI
Add your answer
Q3. What are the best practices to avoid rerenders and to improve performance
Ans. 
Use memoization, virtual DOM, and shouldComponentUpdate to avoid unnecessary rerenders and improve performance.
• Implement memoization to store the result of expensive function calls and avoid recalculating them.

• Use virtual DOM to efficiently update only the parts of the UI that have changed.

• Override shouldComponentUpdate to prevent unnecessary rerenders by comparing current and next props/state.
Answered by AI
Add your answer
Q4. What are callbacks, Promises, async await
Ans. 
Callbacks, Promises, async await are asynchronous programming concepts in JavaScript.
• Callbacks are functions passed as arguments to another function to be executed later.

• Promises are objects representing the eventual completion or failure of an asynchronous operation.

• async await is a syntax for writing asynchronous code that looks synchronous, making it easier to read and maintain.

• Example: Using a callback to handle th...read more
Answered by AI
Add your answer

It was a coding round where i need to solve 3 DSA Questions in 1.5 hour

Q1. This is Technical round where i was asked to implement the Two Question of Dsa one is bases on greedy and another is dp , another one is leetcode hard (finding maxaimal area of rectangle in matrix of 1 and...read more
Add your answer
Q2. Greedy Q was direct i don't remember clearly. I was selected for the 2nd round
Add your answer

Q1. It was also a technical round but bases on LLD problem statement. I was given a problem statement to design a society security system and the they need psudo code for complete implementation using correct ...read more
Add your answer

Q1. I was not selected for 4th round but heard that there were Q on cs fundamentals.
Add your answer