Filter interviews by
I applied via Campus Placement
Assignment based on UI design
I applied via Referral and was interviewed in Apr 2021. There were 4 interview rounds.
2 variable variation of LIS
The problem involves finding the longest increasing subsequence in two arrays
Dynamic programming can be used to solve the problem
The time complexity of the solution is O(n^2)
Example: Given two arrays [1, 3, 5, 4] and [2, 4, 3, 5], the longest increasing subsequence is [3, 5]
Example: Given two arrays [10, 22, 9, 33, 21, 50, 41, 60] and [5, 24, 39, 60, 15, 28, 27, 40], the longest increasing su
Search for an element in a rotated sorted array.
Use binary search to find the pivot point where the array is rotated.
Compare the target element with the first element of the array to determine which half to search.
Perform binary search on the selected half to find the target element.
Time complexity: O(log n), Space complexity: O(1).
Find the first non-repeating character in a continuous character stream.
Use a hash table to keep track of character frequency.
Iterate through the stream and check if the current character has a frequency of 1.
If yes, return the character as the first non-repeating character.
If no non-repeating character is found, return null or a default value.
I applied via Campus Placement and was interviewed in Jul 2022. There was 1 interview round.
Given a node in a family tree, print all nodes on the same level.
Traverse the tree level by level using BFS
Keep track of the level of each node while traversing
Print all nodes with the same level as the given node
Example: If the given node is 'John', print all his siblings and cousins
I applied via LinkedIn and was interviewed in Jul 2022. There were 2 interview rounds.
Prepare from hackerrank array and trees problems
I applied via Campus Placement and was interviewed before Dec 2023. There were 3 interview rounds.
Coding test on Amazon own website
I applied via Company Website and was interviewed in Jan 2022. There were 2 interview rounds.
Asked 2 questions
1. Find the strings with maximum pattern match in given array of strings
2. Find the shortest distance between two target elements in given array
I applied via Referral and was interviewed before Mar 2022. There were 4 interview rounds.
Binary Search Tree Traversal, 20 min, Leetcode
Caching is the process of storing frequently accessed data in a temporary storage to improve performance.
Caching improves performance by reducing the need to fetch data from the original source.
It involves storing data in a temporary storage, such as memory or disk, closer to the user or application.
Caching can be done at various levels, including browser caching, server-side caching, and database caching.
Examples of c...
POST requests are a type of HTTP request method used to submit data to a server.
POST requests are used to create or update resources on a server.
They are commonly used in web forms to submit user input data.
POST requests have a request body that contains the data being submitted.
They are different from GET requests, which are used to retrieve data from a server.
POST requests are more secure than GET requests because th
based on 1 interview
Interview experience
Business Analyst
4
salaries
| ₹3 L/yr - ₹8 L/yr |
Associate Project Manager
4
salaries
| ₹2 L/yr - ₹7 L/yr |
Performance Marketing Manager
4
salaries
| ₹8.5 L/yr - ₹12 L/yr |
Project Manager
3
salaries
| ₹7.8 L/yr - ₹8 L/yr |
Associate Product Manager
3
salaries
| ₹1 L/yr - ₹8 L/yr |
TCS
Accenture
Wipro
Cognizant