Filter interviews by
I applied via Job Portal and was interviewed in Dec 2023. There was 1 interview round.
I applied via Apna Jobs and was interviewed before Aug 2022. There were 6 interview rounds.
I am will do work by our staff and take all of them review on the topics
We find our loss of success in the future and we hope that we can find a way to get more views and like also do please let me I hope to be
Coding is the best way to get a good start on the project and then get more information about the project and I will be sure to send
The age difference between the price of one ethereum coin and the price of the best varies depending on market conditions.
The price of one ethereum coin is determined by market demand and supply, as well as factors like investor sentiment and technological developments.
The price of the best can refer to various products or services, so the age difference can vary greatly.
For example, if the price of one ethereum coin i...
Live coding on any platform - DSA round
I applied via LinkedIn and was interviewed in May 2024. There were 2 interview rounds.
I was interviewed in Jan 2021.
Round duration - 90 minutes
Round difficulty - Hard
Online coding round , 2-3 questions. Level - med-hard
Identify if the provided integer 'N' is a Fibonacci number.
A number is termed as a Fibonacci number if it appears in the Fibonacci sequence, where each number is the sum of...
Check if a given number is a Fibonacci number or not.
Iterate through the Fibonacci sequence until you find a number greater than or equal to the given number.
Check if the given number matches the Fibonacci number found in the sequence.
If the given number matches, output 'YES'; otherwise, output 'NO'.
Your task is to break a board of given dimensions 'L' by 'W' into 'L' * 'W' smaller squares, ensuring the total cost of breaking is minimized.
The first line con...
Minimize cost of breaking a board into smaller squares by optimizing horizontal and vertical cuts.
Iterate through all possible horizontal and vertical cuts to find the minimum cost
Use dynamic programming to store and reuse subproblem solutions
Calculate the cost of breaking the board into smaller squares based on the given dimensions and cut costs
Round duration - 60 Minutes
Round difficulty - Medium
2 interviewers , coding problem, no compilation.
Ninja has started a social networking site called Ninjas Space. The platform consists of ‘N’ users and supports ‘M’ different languages. Users communicate if they know at...
Determine the minimum number of users to teach a common language so all friends can communicate on a social networking site.
Create a graph where users are nodes and friendships are edges.
Find connected components in the graph.
For each connected component, determine the minimum number of users to teach a common language.
Return the sum of minimum users needed for all connected components.
Round duration - 40 minutes
Round difficulty - Medium
CS fundamentals. Tough round. 40 mins interview. 1 interviewer from USA
Round duration - 40 minutes
Round difficulty - Hard
System Design Problem
Design a Facebook-like application for social networking.
User profiles with personal information and photos
News feed displaying posts from friends
Ability to like, comment, and share posts
Friend requests and messaging functionality
Groups and events for community engagement
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.
I applied via Company Website and was interviewed in Nov 2022. There were 3 interview rounds.
Standard Leetcode Medium question.
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 2023. There was 1 interview round.
1 hour, 2 question. 1. Meetting scheduler (leetcode)
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Engineer
75
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
21
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Scientist
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Apple
eBay