Filter interviews by
I applied via Company Website and was interviewed before Nov 2023. There were 2 interview rounds.
Given me 2 coding questions by cto array of object and another is more difficult
Cyclic dependency in Node.js occurs when two or more modules require each other, creating a loop that prevents the modules from being loaded correctly.
Cyclic dependencies can lead to runtime errors or infinite loops in Node.js applications.
To avoid cyclic dependencies, it is recommended to refactor the code to remove the circular references.
One common solution is to use dependency injection or event-driven architecture
I applied via Naukri.com and was interviewed before Dec 2023. There was 1 interview round.
Will give an array of object and you have to find the a particular object
Top trending discussions
I am a highly skilled System Engineer with expertise in designing and implementing complex systems.
Experienced in managing and troubleshooting network infrastructure
Proficient in virtualization technologies such as VMware and Hyper-V
Strong knowledge of operating systems like Windows and Linux
Familiar with scripting languages like PowerShell and Bash
Excellent problem-solving and communication skills
Yes, I have experience working in teams.
I have worked on several group projects during my studies.
I have collaborated with colleagues to solve complex technical problems.
I have participated in cross-functional teams to implement system upgrades.
I have also been part of agile development teams, working closely with software engineers and testers.
One example of teamwork is when I led a team of engineers to successfully d
Determining toll for Jamuna Expressway
Consider the distance of the expressway
Analyze the maintenance cost of the expressway
Take into account the traffic volume and expected revenue
Compare with toll rates of similar expressways
Consider the economic status of the region
Consult with experts and stakeholders
Print the level order traversal of binary tree in spiral form
Perform level order traversal of the binary tree
Alternate the direction of traversal for each level
Use a stack to reverse the order of nodes in each level
Print the nodes in the order of traversal
Find the maximum element in each subarray of size k in a given array.
Iterate through the array from index 0 to n-k.
For each subarray of size k, find the maximum element.
Store the maximum elements in a separate array.
Return the array of maximum elements.
To find the Kth largest element in two sorted arrays, we can use the merge step of merge sort algorithm.
Merge the two arrays into a single sorted array using a modified merge sort algorithm.
Return the Kth element from the merged array.
Merge two sorted arrays into one sorted array with expected time complexity of (m+n).
Use a two-pointer approach to compare elements from both arrays and merge them into the first array.
Start comparing elements from the end of both arrays and place the larger element at the end of the first array.
Continue this process until all elements from the second array are merged into the first array.
based on 2 interviews
Interview experience
based on 10 reviews
Rating in categories
Application Developer
6
salaries
| ₹3.6 L/yr - ₹10 L/yr |
QA Engineer
5
salaries
| ₹2.4 L/yr - ₹3.4 L/yr |
Mobile Application Developer
4
salaries
| ₹4.1 L/yr - ₹4.1 L/yr |
Reactjs Developer
4
salaries
| ₹3.2 L/yr - ₹4.3 L/yr |
Software Engineer
3
salaries
| ₹6 L/yr - ₹10 L/yr |
LTIMindtree
Persistent Systems
Happiest Minds Technologies
TCS