Filter interviews by
I applied via LinkedIn and was interviewed in Feb 2024. There were 3 interview rounds.
First round is Assignment in which have to develop simple store APIs
I appeared for an interview before Feb 2024.
How would you optimize the search function for level 1, 2, and 3 connections in a LinkedIn connection network design?
Top trending discussions
To check if a directed graph is cyclic or not
Use Depth First Search (DFS) algorithm to traverse the graph
Maintain a visited set to keep track of visited nodes
Maintain a recursion stack to keep track of nodes in the current DFS traversal
If a node is visited and is already in the recursion stack, then the graph is cyclic
If DFS traversal completes without finding a cycle, then the graph is acyclic
Return a random byte from a stream of bytes with equal probability.
Create a variable to store the count of bytes read
Create a variable to store the current random byte
For each byte read, generate a random number between 0 and the count of bytes read
If the random number is 0, store the current byte as the random byte
Return the random byte
Check if a binary tree is a binary search tree or not.
Traverse the tree in-order and check if the values are in ascending order.
For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.
Use recursion to check if all nodes in the tree satisfy the above condition.
Algorithm to find Nth-to-Last element in a singly linked list of unknown length
Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning
Move both pointers simultaneously until the second pointer reaches the end of the list
The first pointer will be pointing to the Nth-to-Last element
If N=0, return the last element
Parse the list only once
Print all possible permutations of an array of integers
Use recursion to swap elements and generate permutations
Start with the first element and swap it with each subsequent element
Repeat the process for the remaining elements
Stop when all elements have been swapped with the first element
Print each permutation as it is generated
Design a stack that prints the minimum element pushed in O(1)
Use two stacks, one for storing elements and another for storing minimums
When pushing an element, compare it with the top of minimum stack and push the smaller one
When popping an element, pop from both stacks
To get the minimum element, just return the top of minimum stack
To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.
Use two pointers, one moving at twice the speed of the other.
When they meet, move one pointer to the head of the list and keep the other at the meeting point.
Move both pointers one step at a time until they meet again, which is the starting point of the loop.
To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.
Use binary search to find the number in each row and column
Start from the top-right corner or bottom-left corner to optimize search
Time complexity: O(m log n) or O(n log m) depending on the starting corner
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
I applied via Referral and was interviewed in Feb 2024. There were 3 interview rounds.
Implement tail -f command
Browserstack is a popular cloud-based cross-browser testing tool used by developers worldwide.
Provides access to a wide range of browsers and devices for testing
Allows for parallel testing to save time and increase efficiency
Integrates with popular testing frameworks like Selenium and Appium
Offers features like screenshots, video recordings, and debugging tools
Used by companies like Microsoft, Twitter, and Airbnb for t...
Yes, I faced a challenge in integrating a new third-party API with our existing system.
Had to understand the documentation of the API thoroughly
Encountered compatibility issues with our system
Worked closely with the API provider to troubleshoot and resolve issues
Implementing 'tail -f' allows real-time monitoring of file changes, displaying new lines as they are added.
Use file handling in Python to open a file in read mode.
Utilize a loop to continuously read new lines from the file.
Implement a sleep function to avoid busy waiting and reduce CPU usage.
Example: Use 'with open(filename) as f:' to manage file context.
Use 'f.seek(0, 2)' to move to the end of the file before reading ...
I applied via Recruitment Consulltant and was interviewed before May 2023. There were 4 interview rounds.
Coding was hard conducted on the platform called interview.io
Consits of 2 q 1 is Dp, and the other is Graph
Bit harder compared to other companies
Reasoning like questions
It was an easy online test
Question relates to graph like minimum spanning tree,hashing questiond
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
On hacker rank , included subjects like DBMS , OS and coding questions on priority queue
I appeared for an interview in Apr 2021.
Round duration - 120 Minutes
Round difficulty - Medium
I was MCQ + Coding round, Their were MCQ Based on DSA, Aptitude and 2 easy coding questions.
Ninja is organizing a coding competition where two teams compete at a time. To keep it fair and interesting, both teams must have an equal number of members. Ninja’s ta...
Check if Ninja can create two teams with equal members given an integer N and its divisors.
Iterate through all divisors of N and assign members to the first or second team based on whether the divisor is even or odd.
Keep track of the total members in each team and check if they are equal at the end.
Return true if the total members in both teams are equal, false otherwise.
Bob has just turned 18 and opened a bank account. Being inexperienced with banking, Bob needs your help to validate whether an IFSC code provided by his bank is valid.
...Validate IFSC code based on given rules and return True or False for each test case.
Check if the code is 11 characters long.
Verify the first four characters are uppercase alphabets.
Ensure the fifth character is '0'.
Validate that the last six characters are alphanumeric.
Round duration - 50 Minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Round duration - 50 minutes
Round difficulty - Easy
The nature of the interviewer was very kind. The test was proctored, our webcam and mic were on, and shared my screen.
Tip 1 : Be strong at your basics.
Tip 2 : Do at least 2 projects and ask to find answers like why are you choosing this tech stack? why did not you choose its alternatives Know your project in and out because they might ask you for a modification in your project?
Tip 1 : Have some projects on your resume.
Tip 2 : Do not put false things on your resume.
Tip 3 : Try to keep a single-page resume.
based on 2 interview experiences
Difficulty level
Duration
based on 2 reviews
Rating in categories
Technical Support Engineer
34
salaries
| ₹2.3 L/yr - ₹7.5 L/yr |
Customer Success Manager
23
salaries
| ₹6.6 L/yr - ₹13 L/yr |
Senior Java Developer
21
salaries
| ₹7.4 L/yr - ₹33 L/yr |
Product Manager
21
salaries
| ₹8.6 L/yr - ₹22.7 L/yr |
Software Engineer
17
salaries
| ₹5.4 L/yr - ₹17.6 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo