Filter interviews by
I applied via Indeed and was interviewed in Apr 2023. There were 2 interview rounds.
Cable technician. How to laying data cabeling.
I applied via Recruitment Consultant and was interviewed in Dec 2021. There were 3 interview rounds.
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 web applications and expertise in programming languages such as Java and Python.
Proficient in Java and Python programming languages
Experience in developing web applications using frameworks such as Spring and Django
Familiarity with database technologies such as MySQL and MongoDB
Strong problem-solving and analytical skills
Ability to work in a team and collaborate ef
In the next 5 years, I see myself as a senior software engineer leading a team of developers.
I plan to continue learning and expanding my skillset
I hope to take on more leadership roles and mentor junior developers
I aim to contribute to the development of innovative software solutions
I plan to stay up-to-date with the latest technologies and industry trends
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 12 reviews
Rating in categories
Safety Engineer
6
salaries
| ₹3 L/yr - ₹5 L/yr |
Project Engineer
5
salaries
| ₹4.2 L/yr - ₹6 L/yr |
Project Manager
4
salaries
| ₹5.5 L/yr - ₹7.9 L/yr |
Network Engineer
4
salaries
| ₹3.5 L/yr - ₹4.4 L/yr |
Project Coordinator
4
salaries
| ₹2.8 L/yr - ₹4 L/yr |
TCS
Accenture
Wipro
Cognizant