Faster and better experience!
Filter interviews by
I applied via Company Website and was interviewed before Apr 2021. There was 1 interview round.
Top trending discussions
Improving quality of education in India
Investing in teacher training and development
Increasing access to technology and digital resources
Encouraging parental involvement in education
Promoting vocational education and skill development
Addressing the issue of inadequate infrastructure and resources
I have the necessary skills, experience, and passion to excel in this role.
I have relevant experience in the field
I possess the required skills and qualifications
I am a quick learner and adaptable to new situations
I am passionate about the industry and eager to contribute
I am a team player and work well with others
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.
No, I am not a loner.
I enjoy working in a team and collaborating with others.
I believe that teamwork leads to better results.
I am comfortable working with people from diverse backgrounds.
I actively seek out opportunities to network and build relationships.
I am a good listener and value the opinions of others.
Interview experience
based on 22 reviews
Rating in categories
Growth Executive
4
salaries
| ₹0.7 L/yr - ₹2.5 L/yr |
ShareChat
Chingari
Roposo
MOJ