i
Techxora
Filter interviews by
I applied via Approached by Company and was interviewed in Nov 2023. There were 2 interview rounds.
Not easy but good level
Not easy but good level
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.
AEM Developer
6
salaries
| ₹4.1 L/yr - ₹6.5 L/yr |
Software Developer
4
salaries
| ₹2.7 L/yr - ₹5 L/yr |
TCS
Accenture
Wipro
Cognizant