Filter interviews by
I applied via Company Website and was interviewed in Nov 2024. There were 2 interview rounds.
Leetcode similar coding tests
A graph traversal algorithm like Depth First Search (DFS) can be implemented to determine if A and B are friends, and if B and C are friends, subsequently making A and C friends automatically.
Implement a graph where each person is a node and friendships are edges between nodes
Use Depth First Search (DFS) to traverse the graph and check for connections between A and B, and B and C
If both connections exist, then A and C
I applied via Company Website and was interviewed in Nov 2022. There were 3 interview rounds.
Standard Leetcode Medium question.
I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.
Twitter interview questions for popular designations
I was interviewed in Jan 2021.
Round duration - 90 minutes
Round difficulty - Hard
Online coding round , 2-3 questions. Level - med-hard
The basic idea is to keep generating Fibonacci numbers until we find a number equal to the given number or the generated number becomes greater than the given number. If the generated number is equal to the given number then it means the given number is a Fibonacci number. Otherwise, it is not a Fibonacci number.
The steps are as follows:
This problem can be solved using the greedy approach. By greedy, we mean that we simply start cutting the board along every horizontal and vertical line. But this cutting needs to be in a specific manner. Let’s see how we can do this.
Round duration - 60 Minutes
Round difficulty - Medium
2 interviewers , coding problem, no compilation.
To obtain the total number of users Ninja needs to teach, we first need to find the users who cannot communicate with their friends on the social network. Our approach will be to maintain a set and iterate over the array 'FRIENDS', and we will check for every pair of friends whether both of them know a common language using which they can communicate with each other. If both users do not know a common langua...
Round duration - 40 minutes
Round difficulty - Medium
CS fundamentals. Tough round. 40 mins interview. 1 interviewer from USA
What is virtual memory?
Related questions on virtual memory , follow up questions on each answer.
What are Locks ?
What is transaction? Types, Uses
Round duration - 40 minutes
Round difficulty - Hard
System Design Problem
Design Facebook like application
Tip 1 : Never leave any topic from any chapter / Subject
Tip 2 : Learn to explain your thoughts well
Tip 3 : Learn from previous experiences / interviews / problems asked.
Tip 4 : Atleast 4 projects in Resume
Tip 1 : Atleast 4 projects on Resume
Tip 2 : Do not write false things. You always get caught. Be genuine.
Top trending discussions
I applied via AngelList and was interviewed in Jul 2024. There was 1 interview round.
I applied via Job Portal and was interviewed in Mar 2024. There was 1 interview round.
Good discussion there are 10 people and we got topic emerging use of technology in training the staff
I applied via Referral and was interviewed in Mar 2023. There were 5 interview rounds.
The assignment was a data dump and I was asked to find some insights to reduce cost
I applied via Referral and was interviewed in Oct 2022. There were 3 interview rounds.
Senior Software Engineer
12
salaries
| ₹37.5 L/yr - ₹80 L/yr |
Software Developer
9
salaries
| ₹21.1 L/yr - ₹49.1 L/yr |
Software Engineer
8
salaries
| ₹32 L/yr - ₹57 L/yr |
Project Manager
5
salaries
| ₹12 L/yr - ₹32 L/yr |
Senior Engineer
4
salaries
| ₹34 L/yr - ₹100 L/yr |
Snap Inc