Sequoia Capital Software Developer Interview Questions and Answers

It was angular and java

Q1. A question about dbms etc
Add your answer

70 minutes test, and 4 questions

Q1. Behavioural Queston
Add your answer

Aptitude test question for credit Agricole company

2 coding questions based on DSA.

Q1. Easy coding problem.
Add your answer
Q2. Medium coding problem.
Add your answer

Must contain some questions which will be considered as a qualifier test for next round .it will have some passout marks to get into a next round .

Q1. About skills and communication skills
Add your answer

Q1. About introduction and some questions related to job
Add your answer

Q1. Design a LLD of portfolio management system where you can add any stock to your portfolio sell any stock. calculate % return on your port folio. list your portfolio which is stocks with current prices and ...read more
Ans. 
Design a portfolio management system to add and sell stocks, calculate returns, and display current prices and returns.
• Create a class for the portfolio with methods to add and sell stocks

• Implement a method to calculate the percentage return on the portfolio

• Maintain a list of stocks in the portfolio with their current prices and returns

• Use arrays or lists to store the portfolio data

• Ensure proper error handling for inval
Answered by AI
Add your answer
Q2. Design a referal bonus system.
Ans. 
Design a referral bonus system.
• Define the criteria for a successful referral

• Determine the bonus amount or reward for successful referrals

• Create a tracking system to monitor referrals

• Establish a process for verifying and approving referrals

• Communicate the referral program to employees or users

• Implement a mechanism for distributing the referral bonus
Answered by AI
Add your answer

30 mins was good sr engirneer was good andpolite wentwell

Q1. 30mins awas good sr engineer who interviwed me was polite and this is not true at all
Add your answer
Q2. Why do you think binary search is importnt, how maps are implemented
Ans. 
Binary search is important for efficient searching and sorting. Maps are implemented using hash tables.
• Binary search reduces the search space by half with each iteration, making it faster than linear search.

• Maps are implemented using hash tables which use a hash function to map keys to indices in an array.

• Hash tables provide constant time complexity for insertion, deletion, and retrieval of key-value pairs.

• Collision re...read more
Answered by AI
Add your answer

Round duration - 70 Minutes
Round difficulty - Hard

The test link was active for a week, and you can give anytime you like. The IDE was very good and self explanatory. There were 2 coding questions and 15 aptitude questions.

Q1. Shortest path in an unweighted graph
The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...read more
Ans. 
This is a straight forward application of Floyd Warshal algorithm
Answered by CodingNinjas
View 1 more answer
Q2.  Check If Two Nodes Are Cousins
You are given an arbitrary binary tree consisting of N nodes, where each node is associated with a certain value, and two node values, a and b, you need to check if these n...read more
Ans. 
This was a modified version of DFS on tree and storing the results in a dp to avoid recalculation.
Answered by CodingNinjas
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Medium

It contained two programming questions.

Q1. Nodes In Complete Binary Tree
You are given the root of a complete binary tree, you need to calculate the number of nodes in the given complete binary tree.
A complete binary tree is a tree in which all...read more
Ans. 
The basic solution of this problem is easy. You just need to do a level order traversal of the tree and wherever you find the first vacant spot, you can enter the node there.
The trick was to find the optimal solution. You need to use the property of almost full binary tree. Knowing the value of the node to enter, you can directly eliminate one side of the tree and just traverse the other side of the tree.
Answered by CodingNinjas
View 2 more answers
Q2. Rearrange Array Numbers to form Largest Possible Number
You are given an array(ARR) of length 'N', consisting of non-negative integers. Using only these given numbers, rearrange the numbers in such...read more
Ans. 
This was a standard array manipulation problem. You just need to find the cases that should be satisfied by the second largest number.
Answered by CodingNinjas
View 1 more answer

Round duration - 60 Minutes
Round difficulty - Medium

This was more of a interaction round with some technical skills.

Q1. DBMS Question
Interviewer asked me to explain the ACID properties and explain the rollback mechanism in DBMS.
Ans. 
Tip 1 : Focus on the basics of DBMS 
Tip 2 : Try applying the DBMS concepts on the problems at hand.
Answered by CodingNinjas
Add your answer

Q1. Types of garbage collectors
Add your answer

Q1. Salary negotiation
Add your answer