Filter interviews by
I applied via Recruitment Consulltant and was interviewed in Mar 2022. There were 2 interview rounds.
I am pavani thank u for wonderful opportunity i prove my talent in ur company
I applied via LinkedIn and was interviewed in Jul 2021. There were 3 interview rounds.
I worked as a Software Engineer Front End at XYZ Company.
Developed and maintained front-end applications using HTML, CSS, and JavaScript.
Collaborated with designers and back-end developers to implement user-friendly interfaces.
Optimized website performance by implementing efficient coding practices.
Implemented responsive design principles to ensure compatibility across different devices.
Worked on integrating APIs and t...
Seeking new challenges and growth opportunities in a different environment.
Looking for a change to expand my skill set and learn new technologies.
Seeking a more collaborative and innovative work culture.
Wanting to work on larger and more complex projects.
Desire to work with a diverse team and gain exposure to different perspectives.
Seeking better work-life balance or location-based reasons.
In 5 years, I see myself as a senior software engineer leading a team, working on cutting-edge technologies and contributing to the success of the company.
Leading a team of software engineers
Working on cutting-edge technologies
Contributing to the success of the company
Continuing to learn and grow in my role
I was interviewed in Jan 2021.
Round duration - 65 minutes
Round difficulty - Hard
Timing (6pm - 8pm)
Environment was user friendly
As usual the online round had three coding questions and 20 MCQs. This was a pretty easy round and it’s duration was 65 minutes. The round consisted of questions from various domains like Algorithm, Data Structure, Operating System and Aptitude.
You are given two arrays ARR1
and ARR2
, containing N
and M
elements respectively. There are two types of 'good triplets' that need to be identified in these arrays.
Type ...
Calculate the total number of 'good triplets' in two arrays based on given conditions.
Iterate through all possible triplets in both arrays and check if they satisfy the conditions
Use nested loops to iterate through all combinations of indices in both arrays
Check the conditions for Type 1 and Type 2 'good triplets' separately
Increment a counter for each valid 'good triplet' found
Return the total count of 'good triplets'
You are given a string str
consisting of N
lowercase alphabets. Your task is to determine if it is possible to divide the string into three non-empty substrings such tha...
Given a string, determine if it can be split into three non-empty substrings where one is a substring of the other two.
Check if any substring of the string is a substring of the other two substrings.
Iterate through all possible divisions of the string into three non-empty substrings.
Use two pointers to find all possible substrings efficiently.
Round duration - 40 minutes
Round difficulty - Medium
Given two arbitrary binary trees, your task is to determine whether these two trees are mirrors of each other.
Two trees are considered mirror of each other if...
Check if two binary trees are mirrors of each other based on specific criteria.
Compare the roots of both trees.
Check if the left subtree of the first tree is the mirror of the right subtree of the second tree.
Verify if the right subtree of the first tree is the mirror of the left subtree of the second tree.
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
Use Breadth First Search (BFS) to find the shortest path from the starting cell to the last cell.
Maintain a queue to explore all possible moves from each cell.
Consider the effect of snakes and ladders on the movement of the player.
Handle the case where the last cell is unreachable by returning -1.
Optimize the solution b...
Tip 1 : Must do questions from GFG.
Tip 2 : SDE sheet of striver can be helpful.
Tip 1 : Do at least 3 major web dev project
Tip 2 : should be precise and descriptive
Tip 3 : also add your past experiences in the resume
I applied via Naukri.com and was interviewed before Mar 2021. There were 2 interview rounds.
Aptitude regarding only previous experience
Improving production and quality requires a focus on process optimization, employee training, and continuous improvement initiatives.
Implement lean manufacturing principles to streamline processes and reduce waste
Invest in employee training and development to improve skills and knowledge
Establish quality control measures and regularly monitor performance
Encourage employee feedback and suggestions for improvement
Regular...
LinkedIn interview questions for popular designations
I applied via LinkedIn and was interviewed in Nov 2021. There was 1 interview round.
Get interview-ready with Top LinkedIn Interview Questions
I applied via LinkedIn and was interviewed in Oct 2021. There was 1 interview round.
I applied via Campus Placement and was interviewed in Jun 2021. There was 1 interview round.
I applied via Recruitment Consulltant and was interviewed before May 2021. There were 2 interview rounds.
They had a general round for some scenarios as to what action one would take if the job is given to them. They had a mcq questionnaire, it roughly took about 40 minutes to finish it.
I was interviewed before Sep 2020.
Round duration - 60 minutes
Round difficulty - Medium
6 students from the campus were selected for this round. The interviews were conducted simultaneously for all on BlueJeans along with a code sharing website. After the initial set up and introduction, a set of 2 questions from DSA were asked from all candidates. The results were announced the same day.
Given an undirected and disconnected graph G(V, E)
, where V
is the number of vertices and E
is the number of edges, the connections between vertices are provided in the 'GR...
DFS traversal to find connected components in an undirected and disconnected graph.
Use Depth First Search (DFS) to traverse the graph and find connected components
Maintain a visited array to keep track of visited vertices
For each unvisited vertex, perform DFS to explore the connected component it belongs to
Print the vertices of each connected component in ascending order
Given two sorted integer arrays A
and B
with sizes N
and M
respectively, find the median of the combined array that results from merging arrays A
and B
. If th...
Find the median of two sorted arrays after merging them.
Merge the two sorted arrays into one sorted array.
Calculate the median based on the length of the combined array.
Handle cases where the total number of elements is even or odd.
Tip 1 : Practice an ample amount of questions from online sites like GeeksforGeeks and HackkerRank on all major topics. Once you are done with topicwise preparation, go on and try out some timed tests too.
Tip 2 : Don't forget to revise OOPS, OS, DBMS too.
Tip 3 : Try out mock interviews with friends, that's the best thing you can do for yourself other than practising questions!!
Tip 4 : During the interview, one thing that is asked for sure is the time complexity of your solution, so always know the complexity of your algorithms.
Tip 1 : Have your projects clearly mentioned and well explained
Tip 2 : Make sure that there are no formatting errors
Tip 3 : Mention your LinkedIn profile ;)
Top trending discussions
Some of the top questions asked at the LinkedIn interview -
The duration of LinkedIn interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 40 interviews
Interview experience
based on 183 reviews
Rating in categories
Trust and Safety Specialist
73
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
65
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
59
salaries
| ₹0 L/yr - ₹0 L/yr |
Content Reviewer
37
salaries
| ₹0 L/yr - ₹0 L/yr |
Account Director
31
salaries
| ₹0 L/yr - ₹0 L/yr |
Microsoft Corporation
Amazon