Filter interviews by
I applied via Approached by Company and was interviewed before Sep 2023. There was 1 interview round.
Seeking new challenges and growth opportunities in a larger organization.
Looking for career advancement
Interested in taking on more responsibilities
Seeking a larger scope of work
Want to work in a more dynamic environment
I applied via Approached by Company and was interviewed before Jul 2023. There was 1 interview round.
About your behaviour and communication
I am not currently planning on getting married.
I am currently focused on my career and personal growth.
Marriage is not a priority for me at this time.
I believe in taking the time to find the right person and building a strong foundation before getting married.
I am a software engineer with experience in developing and maintaining software applications.
I have a strong background in programming languages such as Java, C++, and Python.
I have worked on various projects, including developing web applications and implementing software solutions.
I am skilled in problem-solving and debugging, ensuring efficient and effective software development.
I have experience in collaborating wi...
I learned valuable teamwork and problem-solving skills during my summer internship.
Developed strong collaboration skills by working with a team of software engineers to complete projects
Gained experience in troubleshooting and debugging software issues
Learned to effectively communicate and present technical concepts to both technical and non-technical stakeholders
Improved problem-solving abilities by identifying and re...
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.
Operations Executive
5
salaries
| ₹1.8 L/yr - ₹3.6 L/yr |
TCS
Accenture
Wipro
Cognizant