Filter interviews by
I applied via Indeed and was interviewed in Apr 2022. There were 2 interview rounds.
Removing an element from a linked list involves updating the pointers of the previous and next nodes.
Find the node to be removed by traversing the linked list.
Update the pointers of the previous and next nodes to skip the node to be removed.
Free the memory occupied by the removed node.
posted on 23 Dec 2020
Yes, high and low level design principles are important in software development.
High level design principles focus on overall architecture and system organization.
Low level design principles focus on implementation details and code structure.
Examples of high level design principles include SOLID, DRY, and KISS.
Examples of low level design principles include naming conventions, code commenting, and code formatting.
Both ...
I applied via Referral and was interviewed in Jun 2021. There were 6 interview rounds.
I applied via Campus Placement and was interviewed before Apr 2021. There were 2 interview rounds.
2 Coding Ques + Aptitude
posted on 3 Dec 2015
posted on 15 May 2017
I was interviewed before May 2016.
Program to calculate sum of level order tree
Traverse the tree level by level using BFS
Add the values of each level and return the sum
Use a queue to store the nodes at each level
Handle edge cases like empty tree or null root
posted on 19 May 2017
I was interviewed in Aug 2016.
Find the length of longest increasing subsequence in an array.
Use dynamic programming to solve the problem efficiently.
Maintain an array to store the length of longest increasing subsequence ending at each index.
Traverse the array and update the array for each index.
Return the maximum value in the array as the length of longest increasing subsequence.
Find maximum of every window of size K in an array
Iterate through the array and maintain a deque of indices of elements in the current window
Remove indices from the front of the deque if they are outside the current window
Remove indices from the back of the deque if their corresponding elements are smaller than the current element
The front of the deque will always contain the index of the maximum element in the current
Implement binary search in a semi-infinite array.
Start with the first element and keep doubling the index until the target element is less than the current element.
Perform binary search on the subarray from the last doubled index to the current index.
If the target element is not found, repeat the process by doubling the last index and searching again.
Handle edge cases where the target element is at the first index or n
posted on 20 May 2017
I was interviewed in Dec 2016.
Convert an expression to post-fix notation.
Start with an empty stack.
Scan the expression from left to right.
If the scanned character is an operand, output it.
If the scanned character is an operator, pop two operands from stack, output them in post-fix notation and push the result back.
Repeat until the end of expression.
Find the maximum continuous sum in an array of integers.
Use Kadane's algorithm to find the maximum subarray sum in linear time complexity.
Initialize two variables, one for current maximum sum and another for overall maximum sum.
Iterate through the array and update the variables accordingly.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum continuous sum is 6 (from index 3 to 6).
posted on 23 Jan 2017
I was interviewed before Jan 2016.
posted on 28 Aug 2015
I applied via Campus Placement
Senior Software Engineer
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
7
salaries
| ₹0 L/yr - ₹0 L/yr |
Accounts Manager
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Thomson Reuters
Financial Times
Forbes & Company
Morningstar