Filter interviews by
I applied via Campus Placement and was interviewed in Jun 2024. There were 2 interview rounds.
This round has 3 coding questions mostly based on graph and trees
Design a data structure for locking/unlocking nodes in a binary tree efficiently.
Implement a lockable tree data structure with lock(), unlock(), and isLocked() methods.
Ensure a node can only be locked if all ancestors are unlocked and all descendants are locked.
Optimize the operations for efficiency.
Consider using a flag in each node to track its locked status.
Use a recursive approach to check locking conditions.
Mainta...
Improving the operating system can enhance performance and efficiency of the system.
Optimizing memory management to reduce overhead
Implementing better scheduling algorithms to improve multitasking
Enhancing file system performance for faster data access
Improving network stack for better communication speed
I applied via Approached by Company and was interviewed in Jun 2024. There was 1 interview round.
I applied via Campus Placement and was interviewed in Sep 2023. There were 3 interview rounds.
152. Maximum Product Subarray
Medium
17.6K
552
Companies
Given an integer array nums, find a
subarray
that has the largest product, and return the product.
The test cases are generated so that the answer will fit in a 32-bit integer.
Example 1:
Input: nums = [2,3,-2,4]
Output: 6
Explanation: [2,3] has the largest product 6.
Example 2:
Input: nums = [-2,0,-1]
Output: 0
Explanation: The result cannot be 2, because [-2,-1] is not a subarray.
Constraints:
1 <= nums.length <= 2 * 104
-10 <= nums[i] <= 10
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
Basic quants and advanced quants
Top trending discussions
I appeared for an interview in Jan 2025.
Test was based on arrays and some dsa concepts.
posted on 15 May 2024
I applied via LinkedIn and was interviewed in Apr 2024. There was 1 interview round.
HashMap is implemented using an array of linked lists to handle collisions.
HashMap stores key-value pairs in an array of linked lists
Hash function is used to determine the index of the array where the key-value pair will be stored
Collision handling is done by chaining, where multiple key-value pairs with the same hash value are stored in the same linked list
HashMap allows null keys and values
HashMap is not synchronized...
Coding and aptitude round
It was of 1 hr and had 3 questions from 2d array
Asked basic medium level leetcode programming questions
I applied via Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.
Tricky we have to solv 60 question in 50 minutes
Yes, the internal data structure can be changed without affecting user interaction as long as public methods remain the same.
Use abstraction to hide implementation details from users
Ensure public methods have consistent behavior regardless of internal data structure
Consider using interfaces or abstract classes to define common behavior
based on 3 interviews
Interview experience
Product Engineer
71
salaries
| ₹10 L/yr - ₹27 L/yr |
Software Engineer
59
salaries
| ₹8 L/yr - ₹31.6 L/yr |
Software Development Engineer
55
salaries
| ₹16 L/yr - ₹31 L/yr |
Product Manager
52
salaries
| ₹22 L/yr - ₹47 L/yr |
Software Developer
46
salaries
| ₹10.1 L/yr - ₹29.7 L/yr |
OneCard
PolicyX.com
Credgenics
Jodo